English
Related papers

Related papers: Quantum oblivious transfer and bit commitment prot…

200 papers

Rabin oblivious transfer is the cryptographic task where Alice wishes to receive a bit from Bob but it may get lost with probability 1/2. In this work, we provide protocol designs which yield quantum protocols with improved security.…

Quantum Physics · Physics 2025-07-08 Erika Andersson , Akshay Bansal , James T. Peat , Jamie Sikora , Jiawei Wu

Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol…

Cryptography and Security · Computer Science 2008-01-10 Abhishek Parakh

It is shown that maximally efficient protocols for secure direct quantum communications can be constructed using any arbitrary orthogonal basis. This establishes that no set of quantum states (e.g. GHZ states, W states, Brown states or…

Quantum Physics · Physics 2022-06-07 Chitra Shukla , Anirban Pathak , R. Srikanth

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

A bit string commitment protocol securely commits $N$ classical bits in such a way that the recipient can extract only $M<N$ bits of information about the string. Classical reasoning might suggest that bit string commitment implies bit…

Quantum Physics · Physics 2009-11-07 Adrian Kent

Oblivious transfer has been the interest of study as it can be used as a building block for multiparty computation. There are many forms of oblivious transfer; we explore a variant known as Rabin oblivious transfer. Here the sender Alice…

Quantum Physics · Physics 2024-08-23 James T. Peat , Erika Andersson

Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems of interest such as…

Cryptography and Security · Computer Science 2019-11-21 Arpita Patra , Pratik Sarkar , Ajith Suresh

Oblivious transfer is an important primitive in modern cryptography. Applications include secure multiparty computation, oblivious sampling, e-voting, and signatures. Information-theoretically secure perfect 1-out-of 2 oblivious transfer is…

A simple proof of the unconditional security of a relativistic quantum cryptosystem based on orthogonal states is proposed. Restrictions imposed by special relativity allow to substantially simplify the proof compared with the…

Quantum Physics · Physics 2009-11-06 S. N. Molotkov , S. S. Nazin

The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters.…

Quantum Physics · Physics 2009-10-30 Dominic Mayers

There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high…

Quantum Physics · Physics 2023-07-18 Sergii Strelchuk , Michał Studziński

We prove a general relation between adaptive and non-adaptive strategies in the quantum setting, i.e., between strategies where the adversary can or cannot adaptively base its action on some auxiliary quantum side information. Our relation…

Quantum Physics · Physics 2016-07-28 Frédéric Dupuis , Serge Fehr , Philippe Lamontagne , Louis Salvail

We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real…

Information Theory · Computer Science 2015-08-05 Jithin Ravi , Bikash Kumar Dey , Emanuele Viterbo

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…

Quantum Physics · Physics 2007-05-23 Gilles Brassard , Claude Crépeau , Dominic Mayers , Louis Salvail

In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but…

Quantum Physics · Physics 2015-05-27 Adrian Kent

Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence…

Quantum Physics · Physics 2007-05-23 H. P. Yuen

We present a robust and composable device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices in the bounded storage model in which the (honest and cheating) devices and parties have…

Quantum Physics · Physics 2026-04-13 Rishabh Batra , Sayantan Chakraborty , Rahul Jain , Upendra Kapshikar

The protocol for counterfactual transmission of a qubit [Li et al., Phys. Rev. A 92, 052315 (2015)] relies on the counterfactuality of transmissions of bit 1 and of bit 0. Since counterfactuality of transmission of bit 0 is not established,…

Quantum Physics · Physics 2016-06-08 Lev Vaidman

We present a bit commitment protocol based on quantum nonlocality that seems to bring ever-lasting unconditional security. Although security is not rigorously proved, physical arguments and numerical simulations support this conclusion. The…

Quantum Physics · Physics 2015-04-09 Gláucia Murta , Marcelo Terra Cunha , Adán Cabello

We present an oblivious transfer (OT) protocol that combines the OT scheme of Chou and Orlandi together with thesupersingular isogeny Diffie-Hellman (SIDH) primitive of De Feo, Jao, and Pl\^ut. Our construction is a candidate for…

Cryptography and Security · Computer Science 2021-01-14 Paulo Barreto , Anderson Nascimento , Glaucio Oliveira , Waldyr Benits
‹ Prev 1 4 5 6 7 8 10 Next ›