Abstract
This paper connects two areas of recent cryptographic research: secure distributed computation, and group-oriented cryptography. We construct a probabilistic public-key encryption scheme with the following properties:
-
—
It is easy to encrypt using the public keys of any subset of parties, such that it is hard to decrypt without the cooperation of every party in the subset.
-
—
It is easy for any private key holder to give a “witness” of its contribution to the decryption (e.g., for parallel decryption).
-
—
It is “blindable”: From an encrypted bit it is easy for anyone to compute a uniformly random encryption of the same bit.
-
—
It is “xor-homomorphic”: Prom two encrypted bits it is easy for anyone to compute an encryption of their xor.
-
—
It is “compact”: The size of an encryption does not depend on the number of participants.
Using this joint encryption scheme as a tool, we show how to reduce the message complexity of secure computation versus a passive adversary (gossiping faults).
Paritally supported by an AT&T Bell Laboratories Ph.D. Scholarship. Part of this work done during a summer internship at Bellcore
Chapter PDF
Similar content being viewed by others
Keywords
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
D. Beaver, “Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority,” J. Cryptology (1991) 4: 75–122.
D. Chaum, I. Damgård, and J. van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result,” Crypto 1987, 87–119.
Y. Desmedt, “Society and group oriented cryptography: A new concept,” Crypto 1987, 120–127.
Y. Desmedt and Y. Frankel, “Threshold cryptosystems,” Crypto 1989, 307–315.
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, 22(6):644–654, 1976.
T. El-Gamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, 31:469–472, 1985.
Z. Galil, S. Haber, and M. Yung, “Cryptographic computation: secure fault-tolerant protocols and the public-key model,” Crypto 1987, 135–155.
O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” STOC 1987, 218–229.
O. Goldreich and R. Vainish, “How to solve any protocol problem — an efficiency improvement,” Crypto 1987, 73–86.
S. Goldwasser and S. Micali, “Probabilistic encryption,” JCSS, 28(2):270:299, 1984.
K. McCurley, “A key distribution system equivalent to factoring,” J. Crypt., l(2):95–105, 1988.
S. Micali, “Fair public-key cryptosystems,” Crypto 1992, 3.11–3.24 (pre-proceedings abstracts).
S. Micali and P. Rogaway, “Secure Computation,” Crypto 1991, 392–404.
A. Yao, “How to generate and exchange secrets,” FOCS 1986, 162–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, M., Haber, S. (1994). Joint Encryption and Message-Efficient Secure Computation. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive