Committed oblivious transfer and private multi-party computation

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

Volumn 963, Issue , 1995, Pages 110-123

  Crépeau, Claude ^a   Van De Graaf, Jeroen ^a   Tapp, Alain ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BROADCAST CHANNELS; CIRCUIT EVALUATION; COMPUTATIONAL ASSUMPTIONS; EFFICIENT PROTOCOLS; ERROR CORRECTING CODE; MULTIPARTY COMPUTATION; OBLIVIOUS TRANSFER; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 84957649042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_9     Document Type: Conference Paper

References (27)

1. C.H. Bennett, G. Brassard, J.-M. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, Vol. 17, No.2, 1988, pp. 210-229.
2. C.H. Bennett, G. Brassard, C. Crépeau, M.-H. Skubiszewska, Practical Quantum Oblivious Transfer, Advances in Cryptology - CRYPTO'91, Springer-Verlag, 1992, pp. 351-366.
3. G. Brassard, C. Crépeau, R. Jozsa, D. Langlois, A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties, 34th IEEE Symposium on Foundation of Computer Science, 1993, pp. 362-371.
4. J. L. Carter and M. N. Wegman, Universal Classes of hash function, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143-154.
5. D. Chaum, I. Damgård and J. van de Graaf, Multiparty computations ensuring privacy of each party's input and correctness of the result, Advances in Cryptology - CRYPTO'87, Springer-Verlag, 1988, pp. 87-119.
6. R. Cleve, Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, Advances in Cryptology - CRYPTO'89, Springer-Verlag, 1991, pp. 573-590.
7. C. Crépeau, Equivalence Between Two Flavours of Oblivious Transfer, Advances in Cryptology - CRYPTO'87, Springer-Verlag, 1988, pp. 350-354.
8. Crépeau, C., Verifiable Disclosure of Secrets and Applications, Advances in Cryptology - Eurocrypt'89, Springer-Verlag, 1990, pp. 181-191.
9. C. Crépeau, Correct and Private Reductions Among Oblivious Transfers, Ph.D. thesis, MIT, 1990.
10. C. Crépeau, Quantum Oblivious Transfer, Journal of Modem Optics, vol. 41, No. 12, 1994.
11. C. Crépeau, J. Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions, 29th IEEE Symposium on Foundation of Computer Science, 1988, pp. 42-52.
12. C. Crépeau, Cryptographic protocol based on noisy channel, in preparation, 1995.
13. S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM, Vol 28, 1985, pp. 637-647.
14. Forney, G.D., Concatenated Codes, The M.I.T. Press, 1966.
15. M. Franklin, Complexity and security of distributed protocols, Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993.
16. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, or: A completeness theorem for protocols with honest majority, 19th ACM Symposium on Theory of Computing, 1987, pp. 218-229.
17. O. Goldreich, R. Vainish, How to solve any protocol problem-an efficiency improvement, Advances in Cryptology - CRYPTO'87, Springer-Verlag, 1988, pp. 73 86.
18. S. Goldwasser, L. Levin, Fair computation of general functions in presence of moral majority, Advances in Cryptology - CRYPTO'90, Springer-Verlag, 1991, pp. 77-93.
19. J. Kilian, Founding cryptography on Oblivious transfer, 20th ACM Symposium on Theory of Computation, 1988, pp. 20-31.
20. J. Kilian, Uses of Randomness in Algorithms and Protocols, MIT Press, 1990.
21. J. Kilian, A note on efficient zero-knowledge proofs and arguments, 24th ACM Symposium on Theory of Computation, 1992, pp. 723-732.
22. J. Kilian, On the complexity of bounded-interaction and noninteractive zero- knowledge proofs, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 466-477.
23. E. Kushilevitz, S. Micali, R. Ostrovski, Reducibility and completeness in multiparty private computations, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 478-489.
24. F. J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North- Holland, 1977.
25. M. Naor, Bit Commitment using Pseudo-Randomness, Advances in Cryptology - CRYPTO'89, Springer-Verlag, 1989, pp. 128-136.
26. M. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
27. D. Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes, 27th ACM Symposium on Theory of Computing, 1995, pp. 388-397.