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
Journal ArticleDOI
Enabling Efficient and Privacy-Preserving Aggregation Communication and Function Query for Fog Computing-Based Smart Grid
TL;DR: This paper builds a fog computing-based smart grid model and presents an efficient and privacy-preserving scheme which supports aggregation communication and function query based on the proposed model, which is the first concrete solution focusing on aspects of aggregating communication and data availability simultaneously in smart grid.
Proceedings ArticleDOI
SoK: Fully Homomorphic Encryption Compilers
TL;DR: Fully homomorphic encryption (FHE) allows a third party to perform arbitrary computations on encrypted data, learning neither the inputs nor the computation results as discussed by the authors, thus, it provides resilience in situations where computations are carried out by an untrusted or potentially compromised party.
Proceedings ArticleDOI
A verifiable, centralized, coercion-free reputation system
TL;DR: A reputation system that provides complete privacy of the ratings, i.e. neither the ratee nor the reputation system will learn the value of the rating, is proposed and a cryptographic proof of the privacy of this system is provided.
Journal ArticleDOI
Multi-User Multi-Keyword Rank Search Over Encrypted Data in Arbitrary Language
TL;DR: A new MRSE system is proposed which overcomes almost all the defects of the KNN-SE based MRSE systems, does not require a predefined keyword set and supports keywords in arbitrary languages, is a multi-user system which supports flexible search authorization and time-controlled revocation, and achieves better data privacy protection.
Proceedings ArticleDOI
Cryptϵ: Crypto-Assisted Differential Privacy on Untrusted Servers
TL;DR: This work proposes Cryptε, a system and programming framework that achieves the accuracy guarantees and algorithmic expressibility of the central model without any trusted data collector like in the local model and demonstrates Cryptε's practical feasibility with extensive empirical evaluations on real world datasets.
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.