Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Tight security proofs for the bounded-storage model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information-Theoretic Cryptography
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Generalized Oblivious Transfer Protocols Based on Noisy Channels
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Efficient oblivious transfer from algebraic signaling over the Gaussian channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Bootstrapped oblivious transfer and secure two-party function computation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Building oblivious transfer on channel delays
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Constant-rate oblivious transfer from noisy channels
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Secure two-party computation over a Z-channel
ProvSec'11 Proceedings of the 5th international conference on Provable security
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On the efficiency of bit commitment reductions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Implementing information-theoretically secure oblivious transfer from packet reordering
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
| Hi-index | 0.00 |
Oblivious transfer (OT) is a cryptographic primitive of central importance, in particular in two- and multi-party computation. There exist various protocols for different variants of OT, but any such realization from scratch can be broken in principle by at least one of the two involved parties if she has sufficient computing power—and the same even holds when the parties are connected by a quantum channel. We show that, on the other hand, if noise—which is inherently present in any physical communication channel—is taken into account, then OT can be realized in an unconditionally secure way for both parties, i.e., even against dishonest players with unlimited computing power. We give the exact condition under which a general noisy channel allows for realizing OT and show that only “trivial” channels, for which OT is obviously impossible to achieve, have to be excluded. Moreover, our realization of OT is efficient: For a security parameter α 0—an upper bound on the probability that the protocol fails in any way—the required number of uses of the noisy channel is of order O(log(1/ α)2+ε) for any ε 0.