A randomized protocol for signing contracts
Communications of the ACM
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Security of quantum protocols against coherent measurements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth 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
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
ACM SIGACT News - A special issue on cryptography
Interactive hashing and reductions between oblivious transfer variants
Interactive hashing and reductions between oblivious transfer variants
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Improving the Security of Quantum Protocols via Commit-and-Open
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
On the Power of Two-Party Quantum Cryptography
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the reversibility of oblivious transfer
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient unconditional oblivious transfer from almost any noisy channel
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Universally composable quantum multi-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Optimal reductions between oblivious transfers using interactive hashing
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions
IEEE Transactions on Information Theory
New Monotones and Lower Bounds in Unconditional Two-Party Computation
IEEE Transactions on Information Theory
Tight bounds for classical and quantum coin flipping
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Constant-rate oblivious transfer from noisy channels
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
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
On the feasibility of extending oblivious transfer
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the power of correlated randomness in secure computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Hi-index | 0.00 |
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditionally secure way, but there are many reductions of OT to other variants of OT, as well as other primitives such as noisy channels. It is important to know how efficient such unconditionally secure reductions can be in principle, i.e., how many instances of a given primitive are at least needed to implement OT. For perfect (error-free) implementations good lower bounds are known, e.g. the bounds by Beaver (STOC '96) or by Dodis and Micali (EUROCRYPT '99). However, in practice one is usually willing to tolerate a small probability of error and it is known that these statistical reductions can in general be much more efficient. Thus, the known bounds have only limited application. In the first part of this work we provide bounds on the efficiency of secure (one-sided) two-party computation of arbitrary finite functions from distributed randomness in the statistical case. From these results we derive bounds on the efficiency of protocols that use (different variants of) OT as a black-box. When applied to implementations of OT, our bounds generalize known results to the statistical case. Our results hold in particular for transformations between a finite number of primitives and for any error. Furthermore, we provide bounds on the efficiency of protocols implementing Rabin OT. In the second part we study the efficiency of quantum protocols implementing OT. Recently, Salvail, Schaffner and Sotakova (ASIACRYPT'09) showed that most classical lower bounds for perfectly secure reductions of OT to distributed randomness still hold in a quantum setting. We present a statistically secure protocol that violates these bounds by an arbitrarily large factor. We then present a weaker lower bound that does hold in the statistical quantum setting. We use this bound to show that even quantum protocols cannot extend OT. Finally, we present two lower bounds for reductions of OT to commitments and a protocol based on string commitments that is optimal with respect to both of these bounds.