Secure computation

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

Volumn 576 LNCS, Issue , 1992, Pages 392-404

  Micali, Silvio ^a   Rogaway, Phillip ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLENDING; COMPUTATION THEORY;

GLOBAL PROPERTIES; SECURE COMPUTATION; SECURE PROTOCOLS;

CRYPTOGRAPHY;

EID: 84974655726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_32     Document Type: Conference Paper

References (50)

1. D. Beaver, “Formal Definitions for Secure Distributed Protocols,” in Distributed Computing and Cryptography - Proceedings of a DIMACS Workshop, October 1989. (Paper not presented at workshop but invited to appear in proceedings.)
2. D. Beaver, “Foundations of Secure Interactive Computing,” these proceedings.
3. D. Beaver and S. Goldwasser, “Multiparty Computations with Faulty Majority,” Proc. of the 30th FOCS (1989), 468-473.
4. D. Beaver, S. Micali and P. Rogaway, “The Round Complexity of Secure Protocols,” Proc. of the 22nd FOCS (1990), 503-513.
5. J. Benaloh (Cohen) and M. Fischer, “A Robust and Verifiable Cryptographically Secure Election Scheme,” Proc. of the 26th FOCS (1985), 372-381.
6. M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,” Proc. of the 20th STOC (1988), 1-10.
7. M. Blum, Coin Flipping by Telephone, IEEE COMPCON, (1982) 133-137.
8. M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,” SIAM J. of Computing, Vol. 13, No. 4, 1984, 850-864. Earlier version in Proc. of the 23rd FOCS (1982).
9. D. Chaum. “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Comm. of the ACM 24(2) February 1981, 84-88.
10. G. Brassard, D. Chaum and C. Crépeau, “Minimum disclosure proofs of knowledge,” Journal of Computer and System Science, Vol. 37, No. 2, October 1988, 156-189.
11. D. Chaum, C. Crépeau and I. Damgárd, “Multiparty Unconditionally Secure Protocols,” Proc. of the 20th STOC (1988), 11-19.
12. D. Chaum, I. Damgård and J. van de Graff, “Multiparty Computations Ensuring the Privacy of Each Party’s Input and Correctness of the Result,” CRYPTO-87 Proceedings, 87-119.
13. B. Chor and E. Kushilevitz, “A Zero-One Law for Boolean Privacy,” Proc. of the 21st STOC (1989), 62-72.
14. B. Chor, M. Geréb-Graus and E. Kushilevitz, “Private Computations over the Integers,” Proc. of the 31st FOCS (1990), 325-344. Earlier version by Chor and Kushilevitz, “Sharing over Infinite Domains,” CRYPTO-89 Proceedings, Springer-Verlag, 299-306.
15. B. Chor, O. Goldwasser, S. Micali and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,” Proc. of the 26th FOCS (1985), 383-95.
16. C. Crépeau, “Correct and Private Reductions Among Oblivious Transfers,” MIT Ph.D. Thesis, February 1990.
17. R. DeMillo, N. Lynch, and M. Meritt, “Cryptographic Protocols,” Proc. of the 14th STOC (1982) 383-400.
18. W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, 22(6) (November 1976). 644-654.
19. J. Edmonds, “Paths, Trees, and Flowers,” Canadian J. of Mathematics, 17: 449-467, 1965.
20. U. Feige, A. Fiat, and A. Shamir, “Zero Knowledge Proofs of Identity,” Proc. of the 19th STOC (1987), 210-217.
21. U. Feige and A. Shamir, “Witness indistinguishability and witness hiding protocols,” Proc. of the 22nd STOC (1990), 416-426.
22. U. Feige and A. Shamir, “On Expected Polynomial Time Simulation of Zero Knowledge Protocols,” in Distributed Computing and Cryptography - Proceedings of a DIMACS Workshop, October 1989.
23. P. Feldman, “One Can Always Assume Private Channels,” unpublished manuscript (1988).
24. P. Feldman and S. Micali, “An Optimal Algorithms for Synchronous Byzantine Agreement,” MIT/LCS Technical Report TM-425 (June 1990). Previous version in Proc. of the 20th STOC (1988), 148-161.
25. Z. Galil, S. Haber and M. Yung, “Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model,” CRYPTO-87 Proceedings, 135-155.
26. O. Goldreich, “Foundations of Cryptography - Class Notes,” Spring 1989, Technion University, Haifa, Israel.
27. S. Goldwasser and L. Levin, “Fair Computation of General Functions in Presence of Immoral Majority,” CRYPTO-90 Proceedings, 75-84.
28. S. Goldwasser and S. Micali, “Probabilistic Encryption,” Journal of Computer and System Sciences, Vol. 28, No. 2 (1984), 270-299. Earlier version in Proc. of the 14th STOC (1982).
29. O. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems,” SIAM J. of Comp., Vol. 18, No. 1, 186-208 (February 1989). Earlier version in Proc. of the 17th STOC (1985), 291-305.
30. S. Goldwasser, S. Micali, and R. Rivest, “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,” SIAM Journal on Computing, 17(2): 281-308, April 1988.
31. O. Goldreich, S. Mmicali and A. Wigderson, “How to Play Any Mental Game,” Proc. of the 19th STOC (1987), 218-229.
32. O. Goldreich and R. Vainish, “How to Solve any Protocol Problem-An Efficiency Improvement,” CRYPTO-87 Proceedings, 76-86.
33. S. Haber, “Multi-Party Cryptographic Computation: Techniques and Applications,” Columbia University Ph.D. Thesis (1988).
34. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
35. J. Kilian, “Uses of Randomness in Algorithms and Protocols,” MIT Ph.D. Thesis, April 1989.
36. J. Kilian, S. Micali, and P. Rogaway, “The Notion of Secure Computation,” manuscript, 1990.
37. L. Levin, “One-Way Functions and Pseudorandom Generators,” Combinatorica, Vol. 17, 1988, 357-363. Earlier version in Proc. of the 17th STOC (1985).
38. M. Luby, S. Micali and C. Rackoff, “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically Biased Coin,” Proc of the 24th FOCS (1983).
39. M. Meritt, “Cryptographic Protocols.” Georgia Institute of Technology Ph.D. Thesis, Feb. 1983.
40. S. Micali, C. Rackoff and B. Sloan, “The Notion of Security for Probabilistic Cryptosystems,” SIAM J. of Computing, 17(2): 412-26, April 1988.
41. S. Micali and P. Rogaway, “Secure Computation,” manuscript, August 1991.
42. Y. Oren, “On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs,” Proc. of the 28th FOCS (1987), 462-471.
43. M. Pease, R. Shostak and L. Lamport, “Reaching Agreement in the Presence of Faults,” J. of the ACM Vol. 27, No. 2, 1980.
44. M. Rabin, “How to Exchange Secrets by Oblivious Transfer,” Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
45. T. Rabin and M. Ben-Or, “Verifiable Secret Sharing and Multiparty Protocols with Honest Majority,” Proc. of the 21st STOC (1989), 73-85.
46. A. Shamir, R. Rivest, and L. Adleman, “Mental Poker,” in Mathematical Gardener, D. D. Klarner, editor, Wadsworth International (1981) pp 37-43.
47. M. Tompa and H. Woll, “Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,” Proc. of the 28th FOCS (1987), 472-482.
48. A. Yao, “Protocols for Secure Computation,” Proc. of the 23 FOCS (1982), 160-164.
49. A. Yao, “Theory and Applications of Trapdoor Functions,” Proc. of the 23 FOCS (1982) 80-91.
50. A. Yao, “How to Generate and Exchange Secrets,” Proc. of the 27 FOCS (1986).