Filters








880 Hits in 8.4 sec

Optimal bounds for semi-honest quantum oblivious transfer [article]

André Chailloux, Gus Gutoski, Jamie Sikora
2016 arXiv   pre-print
We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat.  ...  We prove that 2B + A is greater than or equal to 2 in any quantum protocol for oblivious transfer, from which it follows that one of the two parties must be able to cheat with probability at least 2/3.  ...  Research at the Centre for Quantum Technologies at the National University of Singapore is partially funded by the Singapore Ministry of Education and the National Research Foundation, also through the  ... 
arXiv:1310.3262v2 fatcat:urny4s75xvb3znsr6mlnu36mwm

Lower Bounds for Quantum Oblivious Transfer [article]

André Chailloux, Iordanis Kerenidis, Jamie Sikora
2013 arXiv   pre-print
lower and upper bounds for them.  ...  While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating.  ...  Hence the optimal biases for weak and strong coin flipping are now known. The question is still unresolved for quantum bit commitment.  ... 
arXiv:1007.1875v2 fatcat:jdvcmfyahbfcnlkm5m35qta7si

Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption [article]

Yanglin Hu, Yingkai Ouyang, Marco Tomamichel
2022 arXiv   pre-print
Furthermore, we reduce quantum oblivious transfer to quantum homomorphic encryption.  ...  Here we establish a definition of circuit privacy for quantum homomorphic encryption with information-theoretic security.  ...  They are also funded by the Quantum Engineering programme grant NRF2021-QEP2-01-P06.  ... 
arXiv:2205.12127v1 fatcat:25oscuxbr5dfxkf5t5a5u5aoca

Quantum oblivious transfer: a short review [article]

Manuel B. Santos, Paulo Mateus, Armando N. Pinto
2022 arXiv   pre-print
Although much of the work in this field is dedicated to quantum key distribution (QKD), some important steps were made towards the study and development of quantum oblivious transfer (QOT).  ...  In this review article, we survey the work developed around the concept of oblivious transfer in the area of theoretical quantum cryptography, with an emphasis on some proposed protocols and their security  ...  QuantERA II Programme that has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No 101017733, and with funding organisations, The Foundation for  ... 
arXiv:2206.03313v2 fatcat:fu3e2uchpzbqldkwdk45hoyt5u

Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation [article]

Ryan Amiri
2020 arXiv   pre-print
We introduce a theoretical framework for studying semi-random quantum oblivious transfer, which is shown equivalent to regular oblivious transfer in terms of cheating probabilities.  ...  Information-theoretically secure perfect 1-out-of 2 oblivious transfer is impossible to achieve.  ...  We introduce a theoretical framework for studying semi-random quantum oblivious transfer, which is shown equivalent to regular oblivious transfer in terms of cheating probabilities.  ... 
arXiv:2007.04712v1 fatcat:nrpij5ttnjcuxm64l3hwpnqqbm

Quantum Oblivious Transfer: A Short Review

Manuel B. Santos, Paulo Mateus, Armando N. Pinto
2022 Entropy  
In this review article, we survey the work developed around the concept of oblivious transfer within theoretical quantum cryptography.  ...  Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT).  ...  More recently, the first direct quantum protocol for a generalization of oblivious transfer known as oblivious linear evaluation was proposed [17] .  ... 
doi:10.3390/e24070945 pmid:35885167 pmcid:PMC9320716 fatcat:intzjtysznb2beheancobh54n4

Secure quantum weak oblivious transfer against individual measurements

Guang Ping He
2015 Quantum Information Processing  
Therefore, although our protocol still cannot break the bound in principle when Alice has unlimited cheating power, it is sufficient for achieving secure quantum weak oblivious transfer in practice.  ...  In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice.  ...  It was proven that the optimal security bound for any quantum weak OT protocol is [9] 2P * Alice + P * Bob ≥ 2, (1) from which it follows that one of the two parties must be able to cheat with probability  ... 
doi:10.1007/s11128-015-0970-8 fatcat:qca655akcvaajgnkwnyo5lnary

Unconditional Security From Noisy Quantum Storage

Robert Konig, Stephanie Wehner, Jürg Wullschleger
2012 IEEE Transactions on Information Theory  
We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack.  ...  Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.  ...  for various other useful suggestions.  ... 
doi:10.1109/tit.2011.2177772 fatcat:fp7ftdyefjailf5nw3xqksydja

Page 7257 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
computation (110-123); Dominic Mayers, On the security of the quantum oblivious transfer and key distribution protocols (124-135).  ...  sender and unbounded receiver (84-96); Donald Beaver, Precomputing oblivious transfer (97-109); Claude Crépeau, Jeroen van de Graaf and Alain Tapp, Committed oblivious transfer and private multi-party  ... 

Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

Christian Schaffner
2010 Physical Review A. Atomic, Molecular, and Optical Physics  
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].  ...  Whereas the more involved protocol for oblivious transfer from [KWW09] requires less noise in storage to achieve security, our "canonical" protocols have the advantage of being simpler to implement and  ...  For the second (purely classical) phase, they propose classical reductions to build bit commitment and oblivious transfer based on weak string erasure.  ... 
doi:10.1103/physreva.82.032308 fatcat:tbgml2lwujdgrbv5erjwgmptay

A constant lower bound for any quantum protocol for secure function evaluation [article]

Sarah Osborn, Jamie Sikora
2022 arXiv   pre-print
We generalize this no-go result by exhibiting a constant lower bound on the cheating probabilities for any quantum protocol for secure function evaluation, and present many applications from oblivious  ...  transfer to the millionaire's problem.  ...  And while quantum mechanics seems to deny us strong coin flipping (we have a constant lower bound [17] ), it does give us arbitrarily good security for weak coin flipping [20, 21] .  ... 
arXiv:2203.08268v1 fatcat:mjsw22jbzfa2xojb7mn6bkgc6e

Practical quantum oblivious transfer with a single photon

Guang Ping He
2019 Laser physics  
Quantum oblivious transfer (QOT) is an essential cryptographic primitive. But unconditionally secure QOT is known to be impossible.  ...  The protocol is extremely feasible, as it can be implemented using currently available Mach-Zehnder interferometer, and no quantum memory, collective measurements nor entanglement are needed for honest  ...  Oblivious Transfer: (I) Alice has a secret bit b.  ... 
doi:10.1088/1555-6611/aafd28 fatcat:h5osw46cynglrdzjah26weltsq

New Monotones and Lower Bounds in Unconditional Two-Party Computation

Stefan Wolf, JÜrg Wullschleger
2008 IEEE Transactions on Information Theory  
Our scheme matches the new lower bound and is, therefore, optimal.  ...  Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two-and multi-party computation, cannot be realized in an unconditionally secure way for both parties  ...  Acknowledgments The authors thank Don Beaver, Claude Crépeau, Anderson Nascimento, and Renato Renner for interesting discussions on the subject of this paper, and three anonymous reviewers for their helpful  ... 
doi:10.1109/tit.2008.921674 fatcat:ozul5afigbfoxezqnnxnxdmmkm

New Monotones and Lower Bounds in Unconditional Two-Party Computation [chapter]

Stefan Wolf, Jürg Wullschleger
2005 Lecture Notes in Computer Science  
Our scheme matches the new lower bound and is, therefore, optimal.  ...  Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two-and multi-party computation, cannot be realized in an unconditionally secure way for both parties  ...  Acknowledgments The authors thank Don Beaver, Claude Crépeau, Anderson Nascimento, and Renato Renner for interesting discussions on the subject of this paper, and three anonymous reviewers for their helpful  ... 
doi:10.1007/11535218_28 fatcat:x5bpyrua7fdchhgjo4a2ahpf6a

Tight Bounds for Classical and Quantum Coin Flipping [chapter]

Esther Hänggi, Jürg Wullschleger
2011 Lecture Notes in Computer Science  
and for both weak as well as strong coin flipping.  ...  But the picture is still incomplete: in the quantum setting, all results consider only protocols with perfect correctness, and in the classical setting tight bounds for strong coin flipping are still missing  ...  We thank Thomas Holenstein, Stephanie Wehner and Severin Winkler for helpful discussions, and the anonymous referees for their helpful comments.  ... 
doi:10.1007/978-3-642-19571-6_28 fatcat:wfn35sj24bdm3m376tmhxfqb6m
« Previous Showing results 1 — 15 out of 880 results