Minimal-latency secure function evaluation

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

Volumn 1807, Issue , 2000, Pages 335-350

  Beaver, Donald ^a  

^a CertCo   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY;

LOG SPACE; MULTIPARTY COMPUTATION; PARALLELIZATION TECHNIQUES; SECURE FUNCTION EVALUATION; SUB-COMPUTATIONS;

FUNCTION EVALUATION;

EID: 84948952992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_23     Document Type: Conference Paper

References (25)

1. J. Bar-Ilan, D. Beaver. “Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.” Proceedings of PODC, ACM, 1989, 201-209.
2. D. Barrington. “Bounded Width Polynomial Size Branching Programs Recognize Exactly those Languages in NC1.” Proceedings of the 18th STOC, ACM, 1986, 1-5.
3. D. Beaver. “Efficient Multiparty Protocols Using Circuit Randomization.” Advances in Cryptology - Crypto ’91 Proceedings, Springer-Verlag LNCS 576, 1992, 420-432.
4. D. Beaver, S. Micali, P. Rogaway. “The Round Complexity of Secure Protocols.” Proceedings of the 22nd STOC, ACM, 1990, 503-513.
5. M. Ben-Or, R. Cleve. “Computing Algebraic Formulas Using a Constant Number of Registers.” Proceedings of the 20th STOC, ACM, 1988, 254-257.
6. M. Ben-Or, S. Goldwasser, A. Wigderson. “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.” Proceedings of the 20th STOC, ACM, 1988, 1-10.
7. D. Chaum, C. Crépeau, I. Damgaard. “Multiparty Unconditionally Secure Protocols.” Proceedings of the 20th STOC, ACM, 1988, 11-19.
8. D. Chaum, I. Damgard, J. van de Graaf. “Multiparty Computations Ensuring Secrecy of Each Party’s Input and Correctness of the Output.” Advances in Cryptology - Crypto ’87 Proceedings, Springer-Verlag LNCS 293, 1988.
9. G.R. Blakley. “Safeguarding Cryptographic Keys.” Proceedings of AFIPS 1979 National Computer Conference, NY 48, 1979, 313-317.
10. B. den Boer. “Oblivious Transfer Protecting Secrecy.” Advances in Cryptology - Eurocrypt ’90 Proceedings, Springer-Verlag LNCS 547, 1990, 31-45.
11. A. Fiat, A. Shamir. “How to Prove Yourself: Practical Solutions to Identification and Signature Problems.” Proc. of Crypto ’86.
12. U. Feige, A. Fiat, A. Shamir. “Zero Knowledge Proofs of Identity.” J. Cryptology 1: 2, 1988, 77-94.
13. U. Feige, J. Kilian, M. Naor. “A Minimal Model for Secure Computation.” Proceedings of the 26th STOC, ACM, 1994, 554-563.
14. O. Goldreich, S. Micali, A. Wigderson. “Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design.” Proceedings of the 27th FOCS, IEEE, 1986. pages 174-187. IEEE, 1986.
15. O. Goldreich, S. Micali, A. Wigderson. “How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority.” Proceedings of the 19th STOC, ACM, 1987, 218-229.
16. S. Goldwasser, S. Micali. Probabilistic Encryption. JCCS, 28: 2, 270-299, 1984.
17. J. Kilian. “Founding Cryptography on Oblivious Transfer.” Proceedings of the 20th STOC, ACM, 1988, 20-29.
18. J. Kilian. Uses of Randomness in Algorithms and Protocols. Cambridge, MIT Press, 1990.
19. M. Naor, O. Reingold. “Number-Theoretic Consturctions of Efficient Pseudo-Random Functions.” Proceedings of the 38th FOCS, IEEE, 1997.
20. M.O. Rabin. “How to Exchange Secrets by Oblivious Transfer.” TR-81, Harvard, 1981.
21. T. Sander, A. Young, M. Yung. “Non-Interactive CryptoComputing for NC1.” Proceedings of the 40th FOCS, IEEE, 1999.
22. A. Shamir. “How to Share a Secret.” Communications of the ACM, 22, 1979, 612-613.
23. Y. Tsiounis, M. Yung. “On the Security of ElGamal-based Encryption.” Proceedings of PKC ’98, LNCS, Springer-Verlag, 1998.
24. A. Yao. “Protocols for Secure Computations.” Proceedings of the 23rd FOCS, IEEE, 1982, 160-164.
25. A. Yao. “How to Generate and Exchange Secrets.” Proceedings of the 27th FOCS, IEEE, 1986, 162-167.