Abstract
An additive privacy homomorphism is an encryption function in which the decryption of a sum (or possibly some other operation) of ciphers is the sum of the corresponding messages. Rivest, Adleman, and Dertouzos have proposed four different additive privacy homomorphisms. In this paper, we show that two of them are insecure under a ciphertext only attack and the other two can be broken by a known plaintext attack. We also introduce the notion of an R -additive privacy homomorphism, which is essentially an additive privacy homomorphism in which only at most R messages need to be added together. We give an example of an R -additive privacy homomorphism that appears to be secure against a ciphertext only attack.
Chapter PDF
Similar content being viewed by others
References
N. Ahituv, Y. Lapid, S. Neumann, “Processing Encrypted Data”, CACM, Sept. 1987, Vo. 30, No. 9, pp. 777–780.
E. F. Brickell. “Breaking Iterated Knapsacks”, Advances in Cryptofogy, Proc. Crypto 84, Santa Barbara, August 19–22, 1984, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, 1985, pp. 342–358.
E. F. Brickell. P. J. Lee. Y. Yacobi. “Secure Audio Teleconference”, to appear in Advances in Cryptofogy, Proc. Crypro 87, Springer-Verlag, New York.
J. C. Lagarias, “Knapsack Public Key Cryptosystems and Diophantine Approximation” (Extended Abstract), Advances in Cryprology, Proc. Crypto 83, Plenum Publ. Co., New York, 1984, pp.3–24.
A. K. Lustra, H. W. Lenstra, Jr., and L. Lovasz, “Factoring Polynomials with Rational Coefficients”, Mathematische Annaten 261, pp. 515–534, 1982.
Stephen C. Pohlig and Martin E. Hellman, “An Improved algorithm for computing Logarithms over GF(p) and its cryptographic signiticance”, IEEE Trans. on Inf. Th. Vol. IT-24, No. 1 Jan. 1978. pp. 106–110.
J. M. Pollard, “Theorems on factorization and primality testing”, Proc. Cambridge Philos. Soc. vol. 76 (1974). pp. 521–528.
Ronald L. Rivest, Len Adleman and Michael L. Dertouzos, “On data banks and privacy homomorphisms”, in Foundation of Secure Computations, Academic Press 1978.
R. L. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Comun. ACM, vol. 21, pp. 294–299, April 1978.
A. Shamir, “A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem”, IEEE Trans. Inform. Theory, vol. IT-30, No. 5, September 1984, pp. 699–704.
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
Brickell, E.F., Yacobi, Y. (1988). On Privacy Homomorphisms (Extended Abstract). In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive