Abstract
Privacy homomorphisms (PHs) are encryption functions mapping a set of operations on plaintext to another set of operations on ciphertext. In this paper we present new PH scheme that is based on the theory of the finite fields.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rivest, R.L., Adleman, L., Dertouzos, M.L.: On Data Banks and Privacy Homorphisms. In: Foundataions of Secure Computataion, pp. 169–179. Academic Press, London (1978)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier Science Publishers B.V., Amsterdam (1997)
Brickell, E., Yacobi, Y.: On Privacy Homoorphisms. In: Advances in Cryptology-Eurocrypt 1987, pp. 117–125. Springer, Heidelberg (1988)
Domingo-Ferrer, J.: New Privacy Homomorphism and Applications. Information Processing Letters 60(5), 277–282 (1996)
Domingo-Ferrer, J.: Provably Secure Additive and Multiplicative Privacy Homomorphism. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 471–483. Springer, Heidelberg (2002)
Bao, F.: Cryptanalysis of a Provable Secure Additive and Multiplicative Privacy Homomorphism. In: ICSD 2003 (2003)
Wagner, D.: Cryptanalysis of an Algebraic Privacy Homomorphism. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 234–239. Springer, Heidelberg (2003)
Cheon, J.H., Nam, H.S.: A Cryptanalysis of the Original Domingo-Ferrer’s Algebraic Privacy Homomorphism, http://eprint.iacr.org/
Hopson, K.C., Ingram, S.E.: Developing Professional Java Applets, Sams.net (June 1, 1996)
Lange, D.B., Oshima, M.: Programming and Deploying Java Mobile Agents with Aglets, 1st edn. Addison-Wesley Professional, Reading (1998)
Weiser, M.: Hot topics-ubiquitous computing. Computer 26(10), 71–72 (1993)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8), 102–114 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stepanov, M., Bezzateev, S., Jung, TC. (2006). Privacy Homomorphism for Delegation of the Computations. In: Koucheryavy, Y., Harju, J., Iversen, V.B. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2006. Lecture Notes in Computer Science, vol 4003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759355_43
Download citation
DOI: https://doi.org/10.1007/11759355_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34429-2
Online ISBN: 978-3-540-34430-8
eBook Packages: Computer ScienceComputer Science (R0)