Can Homomorphic Cryptography ensure Privacy

作者: Antoine Guellier

DOI:

关键词:

摘要: The advent of information technology, the dramatic increase computational and storage capacities along with development worldwide communications promise very personalized, well designed convenient services. However, although privacy is an important right in our societies, these services often neglect abuse their consumers' privacy, by collecting sensible data notably. This work focuses on protection systems. For this, it known that traditional cryptography (e.g. encryption or signature schemes) necessary, for instance to ensure confidentiality, but not sufficient. To enable usability at same time, stronger tools are required. Homomorphic a possible promising candidate this purpose. technology allows manipulating encrypted performing logical operations without actually accessing clear. In particular, homomorphic envisioned as perfect secure computation (or storage) delegation cloud. investigates how can first giving deep insight field computer science (systems interest, tools, main goals, ...) then presenting more specifically (fully) encryption, aggregating done branch last 30 years. At last, gives clues answer question privacy?, interesting leads currently investigated yet be considered.

参考文章(159)
Craig Gentry, Shai Halevi, Implementing Gentry's fully-homomorphic encryption scheme international cryptology conference. pp. 129- 148 ,(2011) , 10.1007/978-3-642-20465-4_9
Ran Canetti, Hugo Krawczyk, Jesper B. Nielsen, Relaxing Chosen-Ciphertext Security Advances in Cryptology - CRYPTO 2003. pp. 565- 582 ,(2003) , 10.1007/978-3-540-45146-4_33
Vinod Vaikuntanathan, How to Compute on Encrypted Data international conference on cryptology in india. pp. 1- 15 ,(2012) , 10.1007/978-3-642-34931-7_1
Craig Gentry, Amit Sahai, Brent Waters, Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based international cryptology conference. ,vol. 2013, pp. 75- 92 ,(2013) , 10.1007/978-3-642-40041-4_5
Yves Deswarte, Carlos Aguilar Melchor, Current and future privacy enhancing technologies for the internet Annales Des Télécommunications. ,vol. 61, pp. 399- 417 ,(2006) , 10.1007/BF03219914
Yuanmi Chen, Phong Q. Nguyen, BKZ 2.0: better lattice security estimates international conference on the theory and application of cryptology and information security. ,vol. 7073, pp. 1- 20 ,(2011) , 10.1007/978-3-642-25385-0_1
Tancrède Lepoint, Michael Naehrig, A Comparison of the Homomorphic Encryption Schemes FV and YASHE international conference on cryptology in africa. ,vol. 8469, pp. 318- 335 ,(2014) , 10.1007/978-3-319-06734-6_20
Tancrède Lepoint, Pascal Paillier, On the Minimal Number of Bootstrappings in Homomorphic Circuits financial cryptography. ,vol. 7862, pp. 189- 200 ,(2013) , 10.1007/978-3-642-41320-9_13
Dan Boneh, Craig Gentry, A fully homomorphic encryption scheme Stanford University. ,(2009)