English
Related papers

Related papers: Post-Quantum Oblivious Transfer from Smooth Projec…

200 papers

Spacetime-constrained oblivious transfer (SCOT) extends the fundamental primitive of oblivious transfer to Minkowski space. SCOT and location oblivious data transfer (LODT) are the only known cryptographic tasks with classical inputs and…

Quantum Physics · Physics 2018-11-20 Damián Pitalúa-García , Iordanis Kerenidis

Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation…

Quantum Physics · Physics 2024-11-08 Kai-Yi Zhang , An-Jing Huang , Kun Tu , Ming-Han Li , Chi Zhang , Wei Qi , Ya-Dong Wu , Yu Yu

The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based only on classical cryptography is severely limited by the security and efficiency of the oblivious…

We present a new template for building oblivious transfer from quantum information that we call the "fixed basis" framework. Our framework departs from prior work (eg., Crepeau and Kilian, FOCS '88) by fixing the correct choice of…

Quantum Physics · Physics 2022-09-13 Amit Agarwal , James Bartusek , Dakshita Khurana , Nishant Kumar

As database deployments shift toward cloud platforms and edge devices, thin clients need to securely retrieve sensitive records without leaking their query intent or metadata to the proxies that mediate access. Oblivious Transfer (OT) is a…

Cryptography and Security · Computer Science 2026-03-17 Aydin Abadi , Yvo Desmedt

Due to the commonly known impossibility results, information theoretic security is considered impossible for oblivious transfer (OT) in both the classical and the quantum world. In this paper, we proposed a weak version of the…

Quantum Physics · Physics 2010-10-06 K. Y. Cheong , Min-Hsiu Hsieh , Takeshi Koshiba

Oblivious Transfer, a fundamental problem in the field of secure multi-party computation is defined as follows: A database DB of N bits held by Bob is queried by a user Alice who is interested in the bit DB_b in such a way that (1) Alice…

Quantum Physics · Physics 2015-06-11 M. V. Panduranga Rao , M. Jakobi

Commitment schemes are essential to many cryptographic protocols and schemes with applications that include privacy-preserving computation on data, privacy-preserving authentication, and, in particular, oblivious transfer protocols. For…

Cryptography and Security · Computer Science 2025-02-17 Thomas Lorünser , Sebastian Ramacher , Federico Valbusa

Databases play a pivotal role in the contemporary World Wide Web and the world of cloud computing. Unfortunately, numerous privacy violations have recently garnered attention in the news. To enhance database privacy, we consider Oblivious…

Cryptography and Security · Computer Science 2024-06-24 Yvo Desmedt , Aydin Abadi

Noisy channels are a powerful resource for cryptography as they can be used to obtain information-theoretically secure key agreement, commitment and oblivious transfer protocols, among others. Oblivious transfer (OT) is a fundamental…

Cryptography and Security · Computer Science 2014-10-13 Rafael Dowsley , Anderson C. A. Nascimento

Quantum oblivious transfer (QOT) is an essential cryptographic primitive. But unconditionally secure QOT is known to be impossible. Here we propose a practical QOT protocol, which is perfectly secure against dishonest sender without relying…

Quantum Physics · Physics 2019-04-02 Guang Ping He

Cryptography's importance in our everyday lives continues to grow in our increasingly digital world. Oblivious transfer (OT) has long been a fundamental and important cryptographic primitive since it is known that general two-party…

Quantum Physics · Physics 2014-05-20 C. Erven , Nelly Huei Ying Ng , N. Gigov , R. Laflamme , S. Wehner , G. Weihs

All existing quantum oblivious transfer protocols are to realize the oblivious transfer of bit or bit-string. In this paper, p-Rabin quantum oblivious transfer of a qubit (abbr. p-Rabin qubit-OT) is achieved by using a probabilistic…

Quantum Physics · Physics 2018-08-01 Zhang MeiLing , Li Jin , Liu YuanHua , Shi sha , Zheng Dong , Zheng QingJi , Nie Min

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional…

Quantum Physics · Physics 2017-03-21 Li Yang

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in [KWW09]. We argue that a technical tool from [KWW09] suffices to…

Quantum Physics · Physics 2015-03-13 Christian Schaffner

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…

Quantum Physics · Physics 2025-11-12 David Reichmuth , Ittoop Vergheese Puthoor , Petros Wallden , Erika Andersson

Cryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We…

Oblivious transfer (OT) is an important cryptographic primitive. Any multi-party computation can be realised with OT as building block. XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits, and a receiver Bob…

Based on quantum entanglement, an all-or-nothing oblivious transfer protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this…

Quantum Physics · Physics 2007-05-23 Guang Ping He , Z. D. Wang

We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \mathbf{y}$, exchanging two simultaneous messages. Crucially,…

Cryptography and Security · Computer Science 2026-04-21 Damiano Abram , Giulio Malavolta , Lawrence Roy