On the reversibility of oblivious transfer

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

Volumn 547 LNCS, Issue , 1991, Pages 106-113

  Crépeau, Claude ^a   Sántha, Miklós ^a  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

OBLIVIOUS TRANSFER;

CRYPTOGRAPHY;

EID: 84969350571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46416-6_9     Document Type: Conference Paper

References (12)

1. C. H. Bennett, G. Brassard, and J. -M. Robert. Privacy amplification by public discussion. SIAM J. Computing, 17(2):210-229, April 1988.
2. G. Brassard and C. Crépeau. Quantum bit commitment and coin tossing protocols. In S. Vanstone, editor, Advances in Cryptology: Proceedings of Crypto’90, Springer-Verlag, 1991. to appear.
3. G. Brassard, C. Crépeau, and J. -M. Robert. Information theoretic reductions among disclosure problems. In 27th Symp. of Found, of Computer Sci., pages 168-173, IEEE, 1986.
4. B. Chor, O. Goldreich, J. Hastad, J. Friedmann, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proceedings of the 26 th IEEE Symposium on Foundations of Computer Science, pages 396-407, IEEE, Portland, 1985.
5. V. Chvatal. Probabilistic methods in graph theory. Annals of Operations Research, 1:171-182, 1984.
6. C. Crépeau and S. Micali. Secure two-party protocols. 1991. in preparation.
7. C. Crepeau. Correct and Private Reductions among Oblivious Transfers. PhD thesis, Department of Elec. Eng. and Computer Science, Massachusetts Institute of Technology, 1990. Supervised by Silvio Micali.
8. C. Crépeau and M. Sántha. Efficient reductions among oblivious transfer protocols, submitted to STOC 91.
9. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proceedings CRYPTO 82, pages 205-210, Plenum Press, New York, 1983.
10. O. Goldreich and R. Vainish. How to solve any protocol problem-an efficiency improvement (extended abstract). In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto’87, pages 73-86. Springer-Verlag, 1988.
11. F. J. Mac Williams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North- Holland, 1977.
12. R. Ostrovsky, R. Venkatesan, and M. Yung. On the complexity of asymmetric games. In Proceedings of Sequences ’91, 1991. to appear. This work was first presented at the DIMACS workshop on cryptography, October 1990.