Abstract
We give a general procedure for designing correct, secure, and fault-tolerant cryptographic protocols for many parties, thus enlarging the domain of tasks that can be performed efficiently by cryptographic means. We model the most general sort of feasible adversarial behavior, and describe fault-recovery procedures that can tolerate it. Our constructions minimize the use of cryptographic resources. By applying the complexity-theoretic approach to knowledge, we are able to measure and control the computational knowledge released to the various users, as well as its temporal availability.
Supported in part by NSF grants MCS-8303139 and DCR-8511713.
Supported in part by an IBM graduate fellowship.
Chapter PDF
Similar content being viewed by others
References
Abadi M., and J. Feigenbaum. A Simple Protocol for Secure Circuit Evaluation. Preprint, 1987.
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.
Barrington, D.A. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. 18th STOC, ACM, May, 1986, pp. 1–5.
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.
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.
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.
Blum, M. and S. Goldwasser. An Efficient Probabilistic Public-Key Scheme Which Hides All Partial Information. Proceedings of Crypto84, 1985, pp. 289–301.
Blum, L., Blum M. and Shub M. Comparison of Two Pseudo-Random Number Generators. Proceedings of Crypto82, August, 1982, pp. 61–78.
Blum, M. “How to Exchange (Secret) Keys”. ACM Transactions on Computer System 1,2 (May 1983), 175–193.
Boppana, R.B. and R. Hirschfeld. Pseudorandom Generators and Complexity Classes. Preprint, 1986.
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.
Chor, B. and Rabin M.O. Achieving Independence in Logarithmic Number of Rounds. 6th PODC, ACM, August, 1987.
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.
Cohen, J.C. (Benaloh) and Fischer M.J. A Robust and Verifiable Cryptographically Secure Election Scheme. Proc. 26th FOCS, IEEE, 1985, pp. 372–383.
DeMillo, R.A., N. Lynch and M. Merritt. Cryptographic Protocols. 14th STOC, ACM-SIGACT, May, 1982, pp. 383–400.
Diffie, W., and Hellman M.E. “New Directions in Cryptography”. IEEE Transactions of Information Theory IT-22 (November 1976), 644–654.
Even, S., Goldreich O. and Lempel A. “A Randomized Protocol for Signing Contracts”. Communications of the ACM 28,6 (June 1985), 637–647.
Feige, U., A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. 19th STOC, 1986, pp. 210–217.
Fischer, M., S. Micali, C. Rackoff, and D. Wittenberg. An Oblivious Transfer Protocol Equivalent to Factoring. Manuscript, 1986.
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.
Goldreich, O., S. Goldwasser, and S. Micali. How to Construct Random Functions. Proc. 25th FOCS, IEEE, 1984, pp. 464–479.
Goldreich O., and R. Vainish. How to Solve Any Protocol Problem: an Efficiency Improvement. These proceedings.
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.
Goldreich, O., S. Micali and A. Wigderson. How to Play Any Mental Game. 19th STOC, 1987, pp. 218–229.
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.
Goldwasser, S., S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems. 17 STOC, ACM-SIGACT, May, 1985, pp. 291–304.
Halpern, J. and Rabin M.O. A Logic to Reason about Likehood. Proc. 15th STOC, ACM, 1983, pp. 310–319.
Hastad, J. and A. Shamir. The Cryptographic Security of Truncated Linearly Related Variables. 17th STOC, ACM-SIGACT, May, 1985, pp. 356–362.
Impagliazzo R., and M. Yung. Direct Minimum-Knowledge Computations. These proceedings.
Kranakis, E.. Primality and Cryptography. John Wiley and sons, Chichester. 1986.
Levin, L. One-way Functions and Pseudorandom Generators. Proc. 17th STOC, ACM, 1985.
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.
Pippenger, N., and M.J. Fischer. “Relations among Complexity Measures”. Journal of the ACM 26 (1979), 361–381.
Rabin. M. O. Digitalized Signatures and Public-key Functions as Intractable as Factorization. LCS/TR-212, MIT, January“, 1979.
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.
Shamir, A. “How to Share a Secret”. Communicarions of the ACM 22,11 (November 1979), 612–613.
Shamir, A., Rivest R. Adleman L. Mental Poker. In Mathematical Gardner. Klarner D. E., Ed., Wadsworth Intrntl, 1981, pp. 37–43.
Vazirani, U. and Vazirani V. Efficient and Secure Pseudo-Random Number Generation. Proc. 25th FOCS, IEEE, 1984, pp. 458–463.
Vazirani, U. and Vazirani V. Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design. 24th FOCS, IEEE, November, 1983, pp. 23–30.
Yao, A. Protocols for Secure Computations. 23rd FOCS, IEEE, November, 1982, pp. 160–164.
Yao, A. Theory and Applications of Trapdoor Functions. 23rd FOCS, IEEE, November, 1982, pp. 80–91.
Yao, A. How to Generate and Exchange Secrets. 27th FOCS, IEEE, October, 1986, pp. 162–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galil, Z., Haber, S., Yung, M. (1988). Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract). In: Pomerance, C. (eds) Advances in Cryptology — CRYPTO ’87. CRYPTO 1987. Lecture Notes in Computer Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48184-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18796-7
Online ISBN: 978-3-540-48184-3
eBook Packages: Springer Book Archive