Lower bounds for oblivious transfer reductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1592, Issue , 1999, Pages 42-55

  Dodis, Yevgeniy ^a   Micali, Silvio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

LOWER BOUNDS; NON-TRIVIAL; OBLIVIOUS TRANSFER; RANDOM BITS;

CRYPTOGRAPHY;

EID: 84957611040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_4     Document Type: Conference Paper

References (17)

1. M. Bellare, S. Micali. Non-interactive Oblivious Transfer and Applications. In Advances in Cryptology: Proceedings of Crypto '90, pp. 547-559, Springer-Verlag, 1990.
2. M. Blum. How to Exchange (Secret) Keys. In ACM Transactions of Computer Systems, vol. 1, No. 2, pp. 175-193, May 1983.
3. G. Brassard, C. Cr_epeau. Oblivious Transfers and Privacy Ampliffication. In Advances in Cryptology: Proceedings of Eurocrypt '97, Springer-Verlag, pp. 334- 347, 1997.
4. G. Brassard, C. Cr_epeau, J. Robert. Information theoretic reductions among disclosure problems. In 27th Symp. of Found. of Computer Sci., pp. 168-173, IEEE, 1986.
5. G. Brassard, C. Cr_epeau, M. S_antha. Oblivious Transfers and Intersecting Codes. In IEEE Transaction on Information Theory, special issue in coding and com- plexity, Volume 42, Number 6, pp. 1769-1780, 1996.
6. C. Cr_epeau. Equivalence between two flavors of oblivious transfers. In Advances in Cryptology: Proceedings of Crypto '87, volume 293 of Lecture Notes in Computer Science, pp. 350-354, Springer-Verlag, 1988.
7. C. Cr_epeau. A zero-knowledge poker protocol that achieves confidentiality of the players' strategy or how to achieve an electronic poker face. In Advances in Cryptology: Proceedings of Crypto '86, pp. 239-247. Springer-Verlag, 1987.
8. C. Cr_epeau, J. Kilian. Weakening security assumptions and oblivious transfer. In Advances in Cryptology: Proceedings of Crypto '88, volume 403 of Lecture Notes in Computer Science, pp. 2-7, Springer-Verlag, 1990.
9. S. Even, O. Goldreich, A. Lempel. A Randomized Protocol for Signing Contracts. In Advances of Cryptology: Proceedings of Crypto '83, Plenum Press, New York, pp. 205-210, 1983.
10. M. Fisher, S. Micali, C. Racko_. A Secure Protocol for the Oblivious Transfer. In Journal of Cryptology, vol. 9, No. 3 pp. 191-195, 1996.
11. O. Goldreich, S. Micali, A. Wigderson. How to play any mental game, or: A completeness theorem for protocols with honest majority. In Proceedings of 19th Annual Symp. on Theory of Computing, 218-229, 1987.
12. S. Goldwasser, S. Micali, C. Racko_. The knowledge complexity of interactive proof-systems. In SIAM Journal on Computing, 18:186-208, 1989.
13. J. Kilian. Founding Cryptography on Oblivious Transfer. In Proceedings of 20th Annual Symp. on Theory of Computing, pp. 20-31, 1988.
14. J. Kilian, S. Micali, R. Ostrovsky. Minimum Resource Zero-Knowledge Proofs. In Proceedings of 30th Annual Symp. on Foundations of Computer Science, pp. 474-479, 1989.
15. S. Micali, P. Rogaway. Secure Computation. In Advances in Cryptology: Crypto' 91 Proceedings, pp. 392-404, Springer-Verlag, 1992.
16. H. Nurmi, A. Salomaa, L. Santean. Secret ballot elections in computer networks. In Computer and Security, volume 10, No. 6, pp. 553-560, 1991.
17. M. Rabin. How to Exchange Secrets by Oblivious Transfer. In Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.