Efficient cryptographic protocols based on noisy channels

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

Volumn 1233, Issue , 1997, Pages 306-317

  Crépeau, Claude ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; FACINGS;

BINARY SYMMETRIC CHANNEL; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; EFFICIENT PROTOCOLS; OBLIVIOUS TRANSFER; PRIVACY AMPLIFICATION; SECRET INFORMATION; WIRE-TAP CHANNELS;

CRYPTOGRAPHY;

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

References (20)

1. C.H. Bennett, G. Brassard, C. Crepeau, and U.M. Maurer. Generalized Privacy Amplification. IEEE Transaction on Information Theory, Volume 41, Number 6, November 1995, pp. 1915-1923.
2. C.H. Bennett, G. Brassard, C. Crepeau, and M.-H. Skubiszewska. Practical quantum oblivious transfer. In Advances in Cryptology: Proceedings of Crypto’91, Lecture Notes in Computer Science, Vol. 576, pages 351-366. Springer-Verlag, 1992.
3. M. Blum. Coin flipping by telephone. In Proceedings of IEEE Spring Computer Conference, pages 133-137. IEEE, 1982.
4. G. Brassard, D. Chaum, and C. Crepeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156-189, 1988.
5. G. Brassard, C. Crepeau, R. Jozsa and D. Langlois, “A quantum bit commitment scheme provably unbreakable by both parties,” Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 362-371.
6. J.L. Carter and M. N. Wegman, “Universal classes of hash functions”, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143-154.
7. C. Crepeau. Equivalence between two flavours of oblivious transfers (abstract). In C. Pomerance, editor, Advances in Cryptology: Proceedings of Crypto’87, pages 350-354, Springer-Verlag, 1988.
8. C. Crepeau, J. van de Graaf and A. Tapp. Committed Oblivious Transfer and Private Multi-Party Computations. Advances in Cryptology: Proceedings of Crypto’95, August 1995, pp. 110-123.
9. C. Crepeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In 23th Symposium on Foundations of Computer Science, pages 42-52. IEEE, 1988.
10. 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 v'ork, 1983.
11. Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966.
12. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, or: A completeness theorem for protocols with honest majority In Proc. 19th ACM Symposium on Theory of Computing, pages 218-229, ACM, 1987.
13. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or All languages in A'V have zero-knowledge proof systems. Journal of the ACM, 38:691-729, 1991.
14. J. Kilian, Founding cryptography on Oblivious transfer, 20th ACM Symposium on Theory of Computation, 1988, pp. 20-31.
15. F. J. MacWilliams and N.J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977.
16. M.O. Rabin, How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
17. A. Renyi, Probability Theory, North Holland, 1970.
18. S. Wiesner. Conjugate coding. SIGACT News, 15(1):78-88, 1983. Manuscript written circa 1970, unpublished until it appeared in SIGACT News.
19. A. D. Wyner, “The wire-tap channel”, Bell System Technical Journal, Vol. 54, no. 8, 1975, pp. 1355-1387.
20. Yao, A. C.-C., “Protocols for secure computations”, In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, November 1982, pp. 160-164.