Abstract
We consider the communication complexity of secure multiparty computations by networks of processors each with unlimited computing power. Say that an n-party protocol for a function of m bits is efficient if it uses a constant number of rounds of communication and a total number of message bits that is polynomial in max(m, n). We show that any function has an efficient protocol that achieves (n log n)/m resilience, Ours is the first secure multiparty protocol in which the communication complexity is independent of the computational complexity of the function being computed.
We also consider the communication complexity of zero-knowledge proofs of properties of committed bits. We show that every function f of m bits has an efficient notarized envelope scheme; that is, there is a protocol in which a computationally unlimited prover commits a sequence of bits x to a computationally unlimited verifier and then proves in perfect zero-knowledge (without decommitting x) that f(x) = 1, using a constant number of rounds and poly(m) message bits. Ours is the first notarized envelope scheme in which the communication complexity is independent of the computational complexity of f.
Finally, we establish a new upper bound on the number of oracles needed in instance-hiding schemes for arbitrary functions. These schemes allow a computationally limited querier to capitalize on the superior power of one or more computationally unlimited oracles in order to obtain f(x) without revealing its private input x to any one of the oracles. We show that every function of m bits has an (m/log m)-oracle instance-hiding scheme.
The central technique used in all of these results is locally random reducibility, which was used for the first time in [7] and is formally defined for the first time here. In addition to the applications that we present, locally random reducibility has been applied to interactive proof systems, program checking, and program testing.
Work done at Harvard University, supported in part by NSF grant CCR-870-4513.
Supported by an NSF Postdoctoral Fellowship.
Chapter PDF
Similar content being viewed by others
Keywords
- Communication Complexity
- Oblivious Transfer
- Arithmetic Circuit
- Secure Multiparty Computation
- Private Input
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21–50.
L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Proofs, Proc. of FOCS 1990, IEEE.
J. Bar-Ilan and D. Beaver. Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds, Proc. of PODC 1989, ACM, 201–209.
D. Beaver. Secure Multiparty Protocols Tolerating Half Faulty Processors, to appear in J. Cryptology. Preliminary version in Proc. of CRYPTO 1989, Springer Verlag LNCS 435, 560–572.
D. Beaver. Perfect Privacy for Two-Party Protocols, Proc. of DIMACS Workshop on Distributed Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990.
D. Beaver. Security, Fault-Tolerance, and Communication Complexity for Distributed Systems, PhD Thesis, Harvard University, 1990.
D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of STACS 1990, Springer Verlag LNCS 415, 37–48.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989.
D. Beaver, S. Micali, and P. Rogaway. The Round Complexity of Secure Protocols, Proc. of STOC 1990, ACM, 503–513.
C. Bennett, G. Brassard, and C. Crépeau. Private communication.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable is Provable in Zero-Knowledge, Proc. of CRYPTO 1988, Springer Verlag LNCS 403, 37–56.
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proc. of STOC 1988, ACM, 113–131.
M. Ben-Or. S. Goldwasser. and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of STOC 1988, ACM, 1–10
M. Rlum. M. Luby, and R. Rubinfeld. Stronger Checkers and General Techniques for Numerical Problems. Proc. of STOC 1990. ACM. 73–83.
M. Blum. M. Luby, and R. Rubinfeld. Program Result Checking Against Adaptive Programs and in Cryptographic Settings, Proc. of DIMACS Workshop on Distrabuted Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990.
D. Chaum. The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities, Proc. of CRYPTO 1989, Springer Verlag LNCS 435, 591–604.
D. Chaum, C. Crépeau, and U. Damgărd. Mu1ultiparty Unconditionally Secure Protocols, Proc. of STOC 1988, ACM, 11–19.
D. Chaum, I. Damgård, and J. van de Graaf. Multiparty Computations Ensuring Secrecy of Each Party’s Input and Correctness of the Output, Proc. of CRYPTO 1987, Springer Verlag LNCS 293. 87–119.
B. Chor, E. Kushilevitz. A Zero-One Law for Boolean Privacy, Proc. of STOC 1989, ACM, 62–72.
J. Feigenbaum and L. Fortnow. On the Random-Self-Reducibility of Complete Sets, University of Chicago Technical Report 90-22, Computer Science Department, August 20, 1990.
J. Feigenbaum, S. Kannan, and N. Nisan. Lower Bounds on Random-Self-Reducibility, Proc. of Structures 1990, IEEE, 100–109.
L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multi-Prover Interactive Protocols, Proc. of Structures 1988, IEEE, 156–161.
Z. Galil, S. Haber, and M. Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. Proc. of CRYPTO 1987, Springer Verlag LNCS 293, 135–155.
O. Goldreich, S. Micali, and A. Wigderson. How to Play ANY Mental Game, Proc. of STOC 1987, ACM, 218–229.
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186–208.
J. Kilian. Founding Cryptography on Oblivious Transfer, Proc. of STOC 1988, ACM, 20–31.
E. Kushilevitz. Privacy and Communication Complexity, Proc. of FOCS 1989, IEEE, 416–421.
R. Lipton. New Directions in Testing, Proc. of DIMACS Workshop on Distributed Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algrebraic Methods for Interactive Proof Systems, Proc. of FOCS 1990, IEEE.
T. Rabin. Robust Sharing of Secrets When the Dealer is Honest or Cheating, M.Sc. Thesis, Hebrew University, 1988.
T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. of STOC 1989, ACM, 73–85.
S. Rudich. Private communication.
A. Shamir. How to Share a Secret, Commun. Assoc. Comput. Muchinery 22 (1979), 612–613.
A. Shamir. IP = PSPACE, Proc. of FOCS 1990, IEEE.
A. C. Yao. Protocols for Secure Computations, Proc. of FOCS 1982, IEEE, 160–164.
A. C. Yao. How to Generate and Exchange Secrets, Proc. of FOCS 1986, IEEE, 162–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P. (1991). Security with Low Communication Overhead. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive