Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier
- Vol. 1592, pp 223-238
Reads0
Chats0
TLDR
A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.Abstract:
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.read more
Citations
More filters
Proceedings ArticleDOI
Honeycrisp: large-scale differentially private aggregation without a trusted core
TL;DR: A system called Honeycrisp is described, whose privacy cost depends on how often the data changes, and not on howoften a query is asked, and which can answer periodic queries for many years, as long as the underlying data does not change too often.
Journal ArticleDOI
Efficient Encrypted Images Filtering and Transform Coding With Walsh-Hadamard Transform and Parallelization
Peijia Zheng,Jiwu Huang +1 more
TL;DR: The analysis shows that the encrypted WHT can accommodate plaintext data of larger values and has better energy compaction ability on dithered images and the speedup of the homomorphic encrypted image application exceeds 12.5x.
Journal ArticleDOI
Secure outsourcing SIFT: Efficient and Privacy-Preserving Image Feature Extraction in the Encrypted Domain
TL;DR: This paper provides an effective and practical privacy-preserving scale-invariant feature transform (SIFT) scheme for encrypted image that can realize higher computing efficiency, greatly reduce communication costs and interactive times between user and server, and perform correct feature key point detection, accurate feature point description and image matching.
Proceedings ArticleDOI
Homomorphic encryption method applied to Cloud Computing
TL;DR: This paper proposes the application of a method to perform the operation on encrypted data without decrypted and provide the same result as well that the calculations were carried out on raw data.
Proceedings ArticleDOI
Multi-lateral Privacy-Preserving Localization in Pervasive Environments
TL;DR: Three privacy-preserving localization solutions are developed by leveraging combinations of information hiding and homomorphic encryption, which provide different levels of protection for location side information and resilience to node collusion, and have the advantage of being able to trade user's privacy requirements for better computation/communication efficiency.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.