A minimal model for secure computation (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 554-563

  Feige, Uri ^a   Kilian, Joe ^b   Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION; BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; FUNCTION EVALUATION; NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA;

COMMUNICATION OVERHEADS; EFFICIENT PROTOCOLS; EXTENDED ABSTRACTS; GRAPH EMBEDDINGS; LOWER-BOUND PROOFS; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; SECURE COMPUTATION;

COMPUTATION THEORY; MATHEMATICAL MODELS;

MINIMAL MODEL; SECURE COMPUTATION; SHARED RANDOM STRING;

EID: 0027986369     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195408     Document Type: Conference Paper

References (21)

1. M. Abadi, J. Feigenbaum, J. Kilian, On Hiding information From an Oracle, JCSS 39 (1989), 21-50.
2. D. A. Barrington, Bounded-width polynomial-sized branching programs recongnize exactly those languages in NC1, J. of Computer and Systems Sciences, Vol 38, 1988, pp. 150-164.
3. J. Bar Dan, D. Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction.
4. D. Beaver, J. Feigenbaum, Hiding Instances in Multi-Oracle Queries, Proc. of 7th STACS, pp. 37-48, Lecture Notes in Computer Science, Vol. 415, 1990.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. 20th Symp. on Theory of Computing, 1988, pp. 1-10.
6. E. Brickell, P.J. Lee and Y. Yacobi, Secure Audio Teleconference, Advances in Cryptology - Crypto 87 Proceedings, Springer Verlag, 1987, pp. 418-426.
7. D. Chaum, C. Crepeau, and I. Damgard, Multiparty Unconditionally Secure Protocols, Proc. 20th Symp. on Theory of Computing, 1988, pp. 11-19.
8. B. Chor and E. Kushilevitz, A zero-one law for Boolean privacy, Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 61-72.
9. O. Goldreich, M. Micali, A. Wigderson, How to play any mental game, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 218-229.
10. J. Hastad, R. Impagliazzo, L. Levin, M. Luby. Pseudorandom Generation from Oneway Functions.
11. R. Heiman, Secure Audio Teleconferencing: A Practical Solution, manuscript.
12. R. Impagliazzo and S. Rudich, Limits on the provable consequence of one-way permutations, Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 44-61.
13. J. Kiliaii, Use of Randomness in Algorithms and Protocols, MIT Press, Cambridge, Massachusetts, 1990.
14. J. Kilian, A general completeness theorem for two-party games, Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 553-560.
15. E. Kushilevitz, Privacy and communication complexity, Proc. of the 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 416-421.
16. A. Shamir, R. Rivest and L. Adleman, Mental Poker, in The Mathematical Gardner, edited by David Klarner, Wadsworth International, Belmont, 1981, pp. 37-43.
17. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. of STOC89.
18. P. Rogaway. Phd. Thesis. MIT.
19. D.G. Steer, L. Strawscynski, W. Diffie and M. Wiener, A Secure Audio Teleconference System, Advances in Cryptology - Crypto 88 Proceedings, Springer Verlag, 1988, pp. 520-528.
20. A. C. Yao, Protocols for Secure Computations, Proc. of the 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 160-164.
21. A. C. Yao, How to Generate and Exchange Secrets, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 162-167.