DSig: Breaking the Barrier of Signatures in Data Centers

• URL: http://arxiv.org/abs/2406.07215v1
• Date: Tue, 11 Jun 2024 12:44:16 GMT
• Title: DSig: Breaking the Barrier of Signatures in Data Centers
• Authors: Marcos K. Aguilera, Clément Burgelin, Rachid Guerraoui, Antoine Murat, Athanasios Xygkis, Igor Zablotchi,
• Abstract summary: DSig is the first digital signature system to achieve single-digit microsecond latency to sign, transmit, and verify signatures in data center systems. We introduce a new hybrid signature scheme that combines cheap single-use hash-based signatures verified in the foreground with traditional signatures pre-verified in the background.
• Score: 5.064447369892275
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Data centers increasingly host mutually distrustful users on shared infrastructure. A powerful tool to safeguard such users are digital signatures. Digital signatures have revolutionized Internet-scale applications, but current signatures are too slow for the growing genre of microsecond-scale systems in modern data centers. We propose DSig, the first digital signature system to achieve single-digit microsecond latency to sign, transmit, and verify signatures in data center systems. DSig is based on the observation that, in many data center applications, the signer of a message knows most of the time who will verify its signature. We introduce a new hybrid signature scheme that combines cheap single-use hash-based signatures verified in the foreground with traditional signatures pre-verified in the background. Compared to prior state-of-the-art signatures, DSig reduces signing time from 18.9 to 0.7 us and verification time from 35.6 to 5.1 us, while keeping signature transmission time below 2.5 us. Moreover, DSig achieves 2.5x higher signing throughput and 6.9x higher verification throughput than the state of the art. We use DSig to (a) bring auditability to two key-value stores (HERD and Redis) and a financial trading system (based on Liquibook) for 86% lower added latency than the state of the art, and (b) replace signatures in BFT broadcast and BFT replication, reducing their latency by 73% and 69%, respectively

Related papers

• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• A new approach to delegate signing rights to proxy signers using isogeny-based cryptography [5.662132994900804]
  We propose the first post-quantum isogeny based proxy signature scheme CSI-PS (commutative supersingular isogeny proxy signature) Our construction is proven to be uf-cma secure under the hardness of the group action inverse problem (IPGA) based on isogeny.
  arXiv  Detail & Related papers  (2024-07-18T09:19:19Z)
• Efficient Arbitrated Quantum Digital Signature with Multi-Receiver Verification [3.6788660756664773]
  Quantum digital signature is used to authenticate the identity of the signer with theoretical security. In traditional multi-receiver quantum digital signature schemes without an arbitrater, the transferability of one-to-one signature is always required to achieve unforgeability. We propose an arbitrated quantum digital signature scheme, in which the signature can be verified by multiple receivers simultaneously.
  arXiv  Detail & Related papers  (2024-06-12T02:46:54Z)
• Revocable Quantum Digital Signatures [57.25067425963082]
  We define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables a user to sign many messages. Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
  arXiv  Detail & Related papers  (2023-12-21T04:10:07Z)
• Entanglement-based quantum digital signatures over deployed campus network [0.6617348612068856]
  A major advantage of a quantum-digital-signatures protocol is that it can have information-theoretic security. We demonstrate and characterize hardware to implement entanglement-based quantum digital signatures over our campus network.
  arXiv  Detail & Related papers  (2023-10-30T11:31:23Z)
• FedSOV: Federated Model Secure Ownership Verification with Unforgeable Signature [60.99054146321459]
  Federated learning allows multiple parties to collaborate in learning a global model without revealing private data. We propose a cryptographic signature-based federated learning model ownership verification scheme named FedSOV.
  arXiv  Detail & Related papers  (2023-05-10T12:10:02Z)
• On the Importance of Signer Overlap for Sign Language Detection [65.26091369630547]
  We argue that the current benchmark data sets for sign language detection estimate overly positive results that do not generalize well. We quantify this with a detailed analysis of the effect of signer overlap on current sign detection benchmark data sets. We propose new data set partitions that are free of overlap and allow for more realistic performance assessment.
  arXiv  Detail & Related papers  (2023-03-19T22:15:05Z)
• Secure access system using signature verification over tablet PC [62.21072852729544]
  We describe a highly versatile and scalable prototype for Web-based secure access using signature verification. The proposed architecture can be easily extended to work with different kinds of sensors and large-scale databases.
  arXiv  Detail & Related papers  (2023-01-11T11:05:47Z)
• Sensor interoperability and fusion in signature verification: A case study using tablet PC [66.32254395574994]
  Two commercial Tablet PCs are evaluated for signature verification using two different commercial Tablet PCs. An enrolment strategy using signatures from the two Tablet PCs is also proposed. Authentication performance experiments are reported by using a database with over 3000 signatures.
  arXiv  Detail & Related papers  (2022-10-20T10:06:36Z)
• K-nearest neighbour and dynamic time warping for online signature verification [0.0]
  This paper presents a combination of k-nearest neighbor and dynamic time warping algorithms as a verification system using the recently published DeepSignDB database. Our algorithm was applied on both finger and stylus input signatures which represent both office and mobile scenarios.
  arXiv  Detail & Related papers  (2021-11-29T10:38:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.