English
Related papers

Related papers: Quantum linear polynomial evaluation based on XOR …

200 papers

Oblivious linear evaluation is a generalization of oblivious transfer, whereby two distrustful parties obliviously compute a linear function, f (x) = ax + b, i.e., each one provides their inputs that remain unknown to the other, in order to…

Quantum Physics · Physics 2024-10-23 Manuel B. Santos , Paulo Mateus , Chrysoula Vlachou

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…

Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically…

Quantum Physics · Physics 2022-06-01 Srijita Kundu , Jamie Sikora , Ernest Y. -Z. Tan

Oblivious transfer protocol is a basic building block in cryptography and is used to transfer information from a sender to a receiver in such a way that, at the end of the protocol, the sender does not know if the receiver got the message…

Quantum Physics · Physics 2015-06-19 A. Souto , P. Mateus , P. Adão , N. Paunković

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…

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

Motivated by the applications of secure multiparty computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum…

Oblivious transfer is the cryptographic primitive where Alice sends one of two bits to Bob but is oblivious to the bit received. Using quantum communication, we can build oblivious transfer protocols with security provably better than any…

Quantum Physics · Physics 2016-03-24 Jamie Sikora

Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that due to the nature of quantum cryptography, a protocol built upon secure quantum all-or-nothing…

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

Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network. Although it is possible with two servers, any existing protocol works only with classical messages. We propose…

Quantum Physics · Physics 2024-09-10 Masahito Hayashi , Seunghoan Song

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

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

Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor the…

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the…

Quantum Physics · Physics 2011-11-10 Roger Colbeck

We study the cryptographic primitive Oblivious Transfer; a composable construction of this resource would allow arbitrary multi-party computation to be carried out in a secure way, i.e. to compute functions in a distributed way while…

Quantum Physics · Physics 2021-06-23 Lorenzo Laneve , Lidia del Rio

We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe that existing techniques readily give a polynomial-round…

Quantum Physics · Physics 2020-11-23 Amit Agarwal , James Bartusek , Vipul Goyal , Dakshita Khurana , Giulio Malavolta

Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Its aim is to develop primitives beyond the reach of classical cryptography or to improve on existing classical implementations. Although much…

Quantum Physics · Physics 2022-07-20 Manuel B. Santos , Paulo Mateus , Armando N. Pinto

Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way…

Cryptography and Security · Computer Science 2007-05-23 Jürg Wullschleger

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

We describe efficient protocols for quantum oblivious transfer and for one-out-of-two quantum oblivious transfer. These protocols, which can be implemented with present technology, are secure against general attacks as long as the cheater…

Quantum Physics · Physics 2008-02-03 M. Ardehali
‹ Prev 1 2 3 10 Next ›