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
Secure and Efficient Capability-Based Power Management in the Smart Grid
TL;DR: In this article, the authors proposed a secure and efficient power management mechanism leveraging a homomorphic data aggregation and capability-based power distribution, which enables to gather the power demands of customers securely and efficiently, and to distribute power to customers who have the capability.
Journal ArticleDOI
A Privacy-Friendly Gaming Framework in Smart Electricity and Water Grids
TL;DR: A smart metering architecture in which the users have access to their own high-frequency data and can use them as the input data to a multi-party secure protocol and Authenticity and correctness of the data are guaranteed by the usage of a public blockchain.
Book ChapterDOI
An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data
TL;DR: Wang et al. as discussed by the authors investigated common secure indices for conjunctive keyword-based retrieval over encrypted data, and constructed an efficient scheme from Wang et al., dynamic accumulator, Nyberg combinatorial accumulator and Kiayias et al public-key encryption system.
Book ChapterDOI
Homomorphic Secret Sharing from Paillier Encryption
TL;DR: This work extends Boyle et al.
Book ChapterDOI
Certifying RSA
TL;DR: An algorithm is proposed that, given an arbitrary N of unknown factorization and prime e ≥ N1/4+e, certifies whether the RSA function RSAN,e(x) :=xe mod N defines a permutation over ℤ*N or not.
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.