Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model

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

Volumn 293 LNCS, Issue , 1988, Pages 135-155

  Galil, Zvi ^a,b   Haber, Stuart ^a   Yung, Moti ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

CRYPTOGRAPHIC COMPUTATIONS; CRYPTOGRAPHIC PROTOCOLS; CRYPTOGRAPHIC RESOURCES; FAULT TOLERANT PROTOCOLS; FAULT-TOLERANT; MEASURE AND CONTROLS; PUBLIC-KEY MODEL; TEMPORAL AVAILABILITY;

CRYPTOGRAPHY;

EID: 84976655650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48184-2_10     Document Type: Conference Paper

References (42)

1. Abadi M., and J. Feigenbaum. A Simple Protocol for Secure Circuit Evaluation. Preprint, 1987.
2. Alexi, W., Chor, B., Goldreich O. and Schnorr C.P. RSN/Rabin Bits are 1/2 + (1/poly(k)) Secure. Proc. 25th FOCS, IEEE, 1984, pp. 449-457.
3. Barrington, D.A. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. 18th STOC, ACM, May, 1986, pp. 1-5.
4. Ben Or, M., O. Goldreich, S. Micali, and R. Rivest A Fair Protocol for Signing Contracts. Proceedings of ICALP-85, July, 1985, pp. 43-52.
5. Benaloh, J.C. and Yung M. Distributing the Power of a Government to Enhance the Privacy of Voters. Proc. 5th PODC, ACM, 1986, pp. 52-62.
6. Blum, M. and Micali, S. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. Proc. 23rd FOCS, IEEE, 1982, pp. 112-117. Also in: SIAM Journal on Computing, November 1984, 850-864.
7. Blum, M. and S. Goldwasser. An Efficient Probabilistic Public-Key Scheme Which Hides All Partial Information. Proceedings of Crypto84, 1985, pp. 289-301.
8. Blum, L., Blum M. and Shub M. Comparison of Two Pseudo-Random Number Generators. Proceedings of Crypto82, August, 1982, pp. 61-78.
9. Blum, M. “How to Exchange (Secret) Keys”. ACM Transactions on Computer System 1,2 (May 1983), 175-193.
10. Boppana, R.B. and R. Hirschfeld. Pseudorandom Generators and Complexity Classes. Preprint, 1986.
11. Chaum D., I. Damgard, and J. van de Graaf. Multiparty Computations Ensuring Secrecy of Each Party’s Input and Correctness of the Output. These proceedings.
12. Chor, B. and Rabin M.O. Achieving Independence in Logarithmic Number of Rounds. 6th PODC, ACM, August, 1987.
13. Chor, B., Goldwasser S., Micali S. and Awerbuch B. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. Proc. 26th FOCS, IEEE, 1985, pp. 383-395.
14. Cohen, J.C. (Benaloh) and Fischer M.J. A Robust and Verifiable Cryptographically Secure Election Scheme. Proc. 26th FOCS, IEEE, 1985, pp. 372-383.
15. DeMillo, R.A., N. Lynch and M. Merritt. Cryptographic Protocols. 14th STOC, ACM-SIGACT, May, 1982, pp. 383-400.
16. Diffie, W., and Hellman M.E. “New Directions in Cryptography”. IEEE Transactions of Information Theory IT-22 (November 1976), 644-654.
17. Even, S., Goldreich O. and Lempel A. “A Randomized Protocol for Signing Contracts”. Communications of the ACM 28,6 (June 1985), 637-647.
18. Feige, U., A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. 19th STOC, 1986, pp. 210-217.
19. Fischer, M., S. Micali, C. Rackoff, and D. Wittenberg. An Oblivious Transfer Protocol Equivalent to Factoring. Manuscript, 1986.
20. Galil, Z., Haber S. and Yung M. A private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cqposystems. Proc. 26th FOCS, IEEE, 1985, pp. 360-371.
21. Goldreich, O., S. Goldwasser, and S. Micali. How to Construct Random Functions. Proc. 25th FOCS, IEEE, 1984, pp. 464-479.
22. Goldreich O., and R. Vainish. How to Solve Any Protocol Problem: an Efficiency Improvement. These proceedings.
23. Goldreich, O., S. Micali and A. Wigderson. Proofs that Yield Nothing But their Validity and a Methodology of Cryptogrphic Protocol Design. 27th FOCS, IEEE, October, 1986, pp. 174-187.
24. Goldreich, O., S. Micali and A. Wigderson. How to Play Any Mental Game. 19th STOC, 1987, pp. 218-229.
25. Goldwasser, S. and Micali S. Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. Proceedings of the 14th Annual ACM Symp. on Theory of Computing, ACM-SIGACT, May, 1982, pp. 365-377.
26. Goldwasser, S., S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems. 17 STOC, ACM-SIGACT, May, 1985, pp. 291-304.
27. Halpern, J. and Rabin M.O. A Logic to Reason about Likehood. Proc. 15th STOC, ACM, 1983, pp. 310-319.
28. Hastad, J. and A. Shamir. The Cryptographic Security of Truncated Linearly Related Variables. 17th STOC, ACM-SIGACT, May, 1985, pp. 356-362.
29. Impagliazzo R., and M. Yung. Direct Minimum-Knowledge Computations. These proceedings.
30. Kranakis, E.. Primality and Cryptography. John Wiley and sons, Chichester. 1986. MATH
31. Levin, L. One-way Functions and Pseudorandom Generators. Proc. 17th STOC, ACM, 1985.
32. Luby, M., Micali S. and Rackoff C. How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. 24 FOCS, IEEE, November, 1983, pp. 11-22.
33. Pippenger, N., and M.J. Fischer. “Relations among Complexity Measures”. Journal of the ACM 26 (1979), 361-381.
34. Rabin M. O. Digitalized Signatures and Public-key Functions as Intractable as Factorization. LCS/TR-212, MIT, January“, 1979.
35. Rivest, R., Shamir A., Adleman L. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”. Commications of the ACM 21,2 (February 1978), 120-126.
36. Shamir, A. “How to Share a Secret”. Communicarions of the ACM 22,11 (November 1979), 612-613.
37. Shamir, A., Rivest R. Adleman L. Mental Poker. In Mathematical Gardner. Klarner D. E., Ed., Wadsworth Intrntl, 1981, pp. 37-43.
38. Vazirani, U. and Vazirani V. Efficient and Secure Pseudo-Random Number Generation. Proc. 25th FOCS, IEEE, 1984, pp. 458-463.
39. Vazirani, U. and Vazirani V. Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design. 24th FOCS, IEEE, November, 1983, pp. 23-30.
40. Yao, A. Protocols for Secure Computations. 23rd FOCS, IEEE, November, 1982, pp. 160-164.
41. Yao, A. Theory and Applications of Trapdoor Functions. 23rd FOCS, IEEE, November, 1982, pp. 80-91.
42. Yao, A. How to Generate and Exchange Secrets. 27th FOCS, IEEE, October, 1986, pp. 162-167.