A Provably Secure Additive and Multiplicative Privacy Homomorphism
By Josep Domingo-Ferrer. Information Security Conference, 2002
320 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/d29ea322cb3833c6a7ea6025b039b907d77e48cd
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Jaydip Sen
- Wei Jiang
- Yinhai Wang
- Yousef Elmehdwi
- Bharath Kumar Samanthula
- Joao Girão
- Byrav Ramamurthy
- Dirk Westhoff
In Geometry and Topology
- Jaydip Sen
- Joao Girão
- Byrav Ramamurthy
- Dirk Westhoff
- Yousef Elmehdwi
- Garhan Attebury
- Mithun P. Acharya
- Wei Jiang
Citations in the corpus
- A Survey of Homomorphic Encryption for Nonspecialists (2007, background): “There has been only a few ones proposed: by Fellows and Koblitz [69] (which cannot be considered as secure nor ef-ficient [70]), by Domingo-Ferrer [63, 66] (which has been broken [64, 65, 67]), and construction studies of Rappe et al. [3].”
- A survey of security issues in wireless sensor networks (2006, methodology): “The proposed scheme in [95], Concealed Data Aggregation (CDA), is based on the PH proposed in [ 97 ], although the study in [98] has shown that the proposed PH in [97] is unsecure against chosen plain text attacks for some parameter settings.”
- A Survey on Homomorphic Encryption Schemes (2017, background): “For instance, vulnerabilities for [Mullen and Shiue 1994; i Ferrer 1996; Grigoriev and Ponomarenko 2006; Domingo-Ferrer 2002] were reported in [Steinwandt and Geiselmann 2002; Choi et al. 2007; Wagner 2003; Cheon et al. 2006], respectively.”
- Sensor network security: a survey (2009, methodology): “Their work is based on a privacy homomorphism (PH), proposed by Domingo-Ferrer in [137], a particular encryption transformation.”
- Privacy and Data Protection by Design - from policy to engineering (2014, methodology): “In [83, 84], PHs allowing both addition and multiplication to be performed on encrypted data were presented; the PHs in those two papers could withstand ciphertext-only attacks, but it turned out they could be broken by a known-cleartext attack.”
- A Survey on Wireless Sensor Network Security (2009, methodology): “The proposed scheme, concealed data aggregation (CDA) in [147] is based on the PH proposed in [149].”
- Secure k-nearest neighbor query over encrypted data in outsourced environments (2013, methodology): “More specifically, they used a prova bly secure privacy homomorphism encryption scheme from [5] that supports modular addition, subtraction and mu ltiplication over encrypted data.”
- Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation (2006, methodology): “The applied PH from Domingo-Ferrer is secure against adversaries that exclusively carry out chosen ciphertext attacks.”