Oblivious transfers and privacy amplification

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

Volumn 1233, Issue , 1997, Pages 334-347

  Brassard, Gilles ^a   Crépeau, Claude ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Information theoretic security; Oblivious transfer; Privacy amplification; Reduction between protocols

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY;

BIT-STRINGS; EFFICIENT IMPLEMENTATION; INFORMATION- THEORETIC SECURITIES; OBLIVIOUS TRANSFER; PRIVACY AMPLIFICATION; PROBABILITY OF FAILURE;

AMPLIFICATION;

EID: 84957360961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_23     Document Type: Conference Paper

References (21)

1. C. H. Bennett, G. Brassard, C. Crepeau and U.M. Maurer, “Generalized privacy amplification”, IEEE Transaction on Information Theory, Vol. 41, no. 6, November 1995, pp. 1915-1923.
2. C.H. Bennett, G. Brassard and J.-M. Robert, “Privacy amplification by public discussion”, SIAM Journal on Computing, Vol. 17, no. 2, April 1988, pp. 210-229.
3. G. Brassard, C. Crepeau and J.-M. Robert, “Information theoretic reductions among disclosure problems”, Proceedings of 27th Annual IEEE Symposium on Foundations of Computer Science, 1986, pp. 168-173.
4. G. Brassard, C. Crepeau and J.-M. Robert, “All-or-nothing disclosure of secrets”, Advances in Cryptology: Proceedings of Crypto’86, Springer-Verlag, 1987, pp. 234-238.
5. G. Brassard, C. Crepeau and M. Santha, “Oblivious transfers and intersecting codes”, IEEE Transactions on Information Theory, Vol. 42, no. 6, November 1996, pp. 1769-1780.
6. C. Cachin, “Smooth entropy and Renyi entropy”, Advances in Cryptology: Proceedings of Eurocrypt’97, Springer-Verlag, 1997.
7. J. L. Carter and M. N. Wegman, “New hash functions and their use in authentication and set equality”, Journal of Computer and System Sciences, Vol. 22, 1981, pp. 265-279.
8. G.D. Cohen and A. Lempel, “Linear intersecting codes”, Discrete Mathematics, Vol. 56, 1985, pp. 35-43.
9. G. D. Cohen and G. Zemor, “Intersecting codes and independent families”, IEEE Transactions on Information Theory, Vol. 40, no. 6, November 1994, pp. 1872-1881.
10. C. Crepeau, “Verifiable disclosure of secrets and application”, Advances in Cryptology: Proceedings of Eurocrypt’89, Springer-Verlag, 1990, pp. 181-191.
11. C. Crepeau, Correct and Private Reductions Among Oblivious Transfers, PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1990. Supervised by Silvio Micali.
12. C. Crepeau, J. van de Graaf and A. Tapp, “Committed oblivious transfer and private multi-party computations”, Advances in Cryptology: Proceedings of Crypto’95, Springer-Verlag, 1995, pp. 110-123.
13. C. Crepeau and M. Santha, “On the reversibility of oblivious transfer”, Advances in Cryptology: Proceedings of Eurocrypt’91, Springer-Verlag, 1991, pp. 106-113.
14. C. Crepeau and M. Santha, “Efficient reductions among oblivious transfer protocols based on new self-intersecting codes”, Sequences II, Methods in Communications, Security and Computer Science, Springer-Verlag, 1991, pp. 360-368.
15. S. Even, O. Goldreich and A. Lempel, “A randomized protocol for signing contracts”, Proceedings of Crypto 82, Plenum Press, New York, 1983, pp. 205-210.
16. S. Goldwasser, S. Micali and C. Rackoff, “The knowledge complexity of interactive proof-systems”, SIAM Journal on Computing, Vol. 18, 1989, pp. 186-208.
17. J. Kilian, “Founding cryptography on oblivious transfer”, Proceedings of 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 20-31.
18. M. O. Rabin, “How to exchange secrets by oblivious transfer”, Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981
19. A. Renyi, Probability Theory, North Holland, 1970.
20. D. R. Stinson, Private communication, 12 February 1997.
21. S. Wiesner, “Conjugate coding”, Sigact News, Vol. 15, no. 1, 1983, pp. 78-88. Original manuscript written circa 1970.