STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Proceedings on Advances in cryptology---CRYPTO '86
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Secret ballot elections in computer networks
Computers and Security
ACM Transactions on Computer Systems (TOCS)
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Weakening Security Assumptions and Oblivious Transfer (Abstract)
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Minimum resource zero knowledge proofs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
Generalized Zig-zag Functions and Oblivious Transfer Reductions
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Information-Theoretic Cryptography
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-local box complexity and secure function evaluation
Quantum Information & Computation
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th 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
Information-Theoretic conditions for two-party secure function evaluation
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
| Hi-index | 0.00 |
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length l should be invoked so as to obtain, by an information-theoretically secure reduction, a 1-out-of-N Oblivious Transfer of strings of length L. Our bound is tight in many significant cases. We also prove the first non-trivial lower bound for the number of random bits needed to implement such a reduction whenever the receiver sends no messages to the sender. This bound is also tight in many significant cases.