Supersonic OT: Fast Unconditionally Secure Oblivious Transfer

• URL: http://arxiv.org/abs/2406.15529v2
• Date: Sun, 25 Aug 2024 12:39:05 GMT
• Title: Supersonic OT: Fast Unconditionally Secure Oblivious Transfer
• Authors: Aydin Abadi, Yvo Desmedt,
• Abstract summary: Supersonic OT is a highly efficient and unconditionally secure cryptographic protocol. A single instance of Supersonic OT completes in 0.35 milliseconds, making it up to 2000 times faster than the state-of-the-art base OT.
• Score: 1.90298817989995
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Oblivious Transfer (OT) is a fundamental cryptographic protocol with applications in secure Multi-Party Computation, Federated Learning, and Private Set Intersection. With the advent of quantum computing, it is crucial to develop unconditionally secure core primitives like OT to ensure their continued security in the post-quantum era. Despite over four decades since OT's introduction, the literature has predominantly relied on computational assumptions, except in cases using unconventional methods like noisy channels or a fully trusted party. Introducing "Supersonic OT", a highly efficient and unconditionally secure OT scheme that avoids public-key-based primitives, we offer an alternative to traditional approaches. Supersonic OT enables a receiver to obtain a response of size O(1). Its simple (yet non-trivial) design facilitates easy security analysis and implementation. The protocol employs a basic secret-sharing scheme, controlled swaps, the one-time pad, and a third-party helper who may be corrupted by a semi-honest adversary. Our implementation and runtime analysis indicate that a single instance of Supersonic OT completes in 0.35 milliseconds, making it up to 2000 times faster than the state-of-the-art base OT.

Related papers

• 1-Shot Oblivious Transfer and 2-Party Computation from Noisy Quantum Storage [0.0]
  A major research path is minimizing the required assumptions to achieve Oblivious Transfer (OT) In this work, three main contributions are evidenced by leveraging quantum resources.
  arXiv  Detail & Related papers  (2024-10-10T20:54:09Z)
• Experimental coherent-state quantum secret sharing with finite pulses [15.261941167557849]
  Quantum secret sharing (QSS) plays a significant role in quantum communication. We propose a three-user QSS protocol based on phase-encoding technology. Our protocol achieves secure key rates ranging from 432 to 192 bps.
  arXiv  Detail & Related papers  (2024-10-08T09:01:06Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Physical Layer Deception with Non-Orthogonal Multiplexing [52.11755709248891]
  We propose a novel framework of physical layer deception (PLD) to actively counteract wiretapping attempts. PLD combines PLS with deception technologies to actively counteract wiretapping attempts. We prove the validity of the PLD framework with in-depth analyses and demonstrate its superiority over conventional PLS approaches.
  arXiv  Detail & Related papers  (2024-06-30T16:17:39Z)
• Insecurity of Quantum Two-Party Computation with Applications to Cheat-Sensitive Protocols and Oblivious Transfer Reductions [0.0]
  We rigorously establish the impossibility of cheat-sensitive OT, where a dishonest party can cheat, but risks being detected. We provide entropic bounds on primitives needed for secure function evaluation. Our results hold in particular for transformations between a finite number of primitives and for any error.
  arXiv  Detail & Related papers  (2024-05-20T15:39:30Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Hybrid Quantum Cryptography from Communication Complexity [0.43695508295565777]
  We build a key distribution protocol called HM-QCT from the Hidden Matching problem. We show that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem. Remarkably, the scheme remains secure with up to $mathcalObig( fracsqrtnlog(n)big)$ input photons for each channel use.
  arXiv  Detail & Related papers  (2023-11-15T18:03:15Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Moving beyond the transmon: Noise-protected superconducting quantum circuits [55.49561173538925]
  superconducting circuits offer opportunities to store and process quantum information with high fidelity. Noise-protected devices constitute a new class of qubits in which the computational states are largely decoupled from local noise channels. This Perspective reviews the theoretical principles at the heart of these new qubits, describes recent experiments, and highlights the potential of robust encoding of quantum information in superconducting qubits.
  arXiv  Detail & Related papers  (2021-06-18T18:00:13Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Agile and versatile quantum communication: signatures and secrets [0.7980685978549763]
  We demonstrate two quantum cryptographic protocols, quantum digital signatures (QDS) and quantum secret sharing (QSS) on the same hardware sender and receiver platform. This is the first proof-of-principle demonstration of an agile and versatile quantum communication system.
  arXiv  Detail & Related papers  (2020-01-27T21:11:18Z)

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.