TY - GEN
T1 - Practical packing method in somewhat homomorphic encryption
AU - Yasuda, Masaya
AU - Shimoyama, Takeshi
AU - Kogure, Jun
AU - Yokoyama, Kazuhiro
AU - Koshiba, Takeshi
PY - 2014
Y1 - 2014
N2 - Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.
AB - Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.
KW - Packed ciphertexts
KW - Ring-LWE assumption
KW - Secure Hamming distance
KW - Somewhat homomorphic encryption
UR - http://www.scopus.com/inward/record.url?scp=84958547803&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958547803&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-54568-9_3
DO - 10.1007/978-3-642-54568-9_3
M3 - Conference contribution
AN - SCOPUS:84958547803
SN - 9783642545672
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 34
EP - 50
BT - Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers
PB - Springer Verlag
T2 - 8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013
Y2 - 12 September 2013 through 13 September 2013
ER -