Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
From MaRDI portal
Publication:1045913
DOI10.1016/J.IPL.2005.09.016zbMath1191.68271OpenAlexW2118347945MaRDI QIDQ1045913
Jung Hee Cheon, Hyun Soo Nam, Woo-Hwan Kim
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.016
Related Items (2)
CRT-based fully homomorphic encryption over the integers ⋮ Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach
Cites Work
- A new privacy homomorphism and applications
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
- Cryptanalysis of an Algebraic Privacy Homomorphism
- Algorithms for Black-Box Fields and their Application to Cryptography
- Processing encrypted data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme