Elsevier

Information Processing Letters

Volume 60, Issue 5, 9 December 1996, Pages 277-282
Information Processing Letters

A new privacy homomorphism and applications

https://doi.org/10.1016/S0020-0190(96)00170-6Get rights and content

Abstract

An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classified retrieval of exact statistics from unclassified computation on disclosure-protected (perturbed) data.

References (7)

  • N. Ahituv et al.

    Processing encrypted data

    Comm. ACM

    (1987)
  • E. Brickell et al.

    On privacy homomorphisms

  • E.F. Brickell et al.

    Cryptanalysis: A survey of recent results

There are more references available in the full text version of this article.

Cited by (106)

  • AdaptableSDA: secure data aggregation framework in wireless body area networks

    2019, Wearable and Implantable Medical Devices: Applications and Challenges
  • Fully Enhanced Homomorphic Encryption algorithm of MORE approach for real world applications

    2017, Journal of Information Security and Applications
    Citation Excerpt :

    DGHV another FHE was presented by Van Dijk et al. in [7]. The MORE (Matrix Operation for Randomization and Encryption) and the PORE (Polynomial Operation for Randomization and Encryption) two FHE algorithms based on linear transformations are explained in [8–10], and Josepeh Domingo Ferrer also talked in [11,12] about a FHE approach based on polynomial calculations. Two additive HE schemes Iterated Hill Cipher (IHC) and Modified Rivest Scheme (MRS) are presented in [13,14].

  • Privacy preserving cloud computation using Domingo-Ferrer scheme

    2016, Journal of King Saud University - Computer and Information Sciences
    Citation Excerpt :

    This led to the advantage of moving applications that require secure computations on both positive and negative ranges in cloud computing. Moreover, this contribution can be applicable to extend another Domingo-Ferrer’s scheme named a new privacy homomorphism and application Ferrer, 1996. According to that, we designed an aggregation maximum/minimum function based on Domingo-Ferrer’s scheme that improves the existing scheme (Ertaul and Kedlaya, 2007) by extending this function to work in the negative number range and improving the efficiency by combining the processes of finding maximum and minimum values in a single process.

  • The Design of Postgresql's Security Protection Scheme

    2023, ITOEC 2023 - IEEE 7th Information Technology and Mechatronics Engineering Conference
  • A Multi-Party Collaborative Privacy-Preserving Method for Power Defect Detection

    2023, 2023 International Conference on Data Science and Network Security, ICDSNS 2023
View all citing articles on Scopus
1

This work is partly supported by the Spanish CICYT under grant no. TIC95-0903-C02-02. Current address: Escola Tecnica Superior d'Enginyera, Universitat Rovira i Virgili, Carretera de Salou s/n., E-43006 Tarragona, Catalonia, Spain.

View full text