A randomized protocol for signing contracts
Communications of the ACM
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Weak coin flipping with small bias
Information Processing Letters
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Loss-Tolerant Quantum Coin Flipping
ICQNM '08 Proceedings of the Second International Conference on Quantum, Nano and Micro Technologies (ICQNM 2008)
Cryptography in the Bounded-Quantum-Storage Model
SIAM Journal on Computing
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Optimal Quantum Strong Coin Flipping
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Semi-loss-tolerant strong coin flipping protocol using EPR pairs
Quantum Information & Computation
Hi-index | 0.00 |
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 protocol built using classical communication. However, with imperfect apparatus, one needs to consider other attacks. In this paper, we present an oblivious transfer protocol which is impervious to lost messages.