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
A Survey of Homomorphic Encryption for Nonspecialists
Caroline Fontaine,Fabien Galand +1 more
TL;DR: This paper proposes a selection of the most important available solutions for homomorphic encryption, discussing their properties and limitations.
Journal Article
On the exact security of Full Domain Hash
TL;DR: In this article, a slightly different proof is presented which provides a tighter security reduction for the full domain hash (FDH) scheme in the random oracle model, assuming that inverting RSA is hard and that smaller RSA moduli can be used for the same level of security.
Book ChapterDOI
Keyword search and oblivious pseudorandom functions
TL;DR: This work investigates the problem of privacy-preserving access to a database, where records in the database are accessed according to their associated keywords and gives efficient solutions for various settings of KS.
Journal ArticleDOI
Security and Privacy on Blockchain
Rui Zhang,Rui Xue,Ling Liu +2 more
TL;DR: This article presents a comprehensive overview of the security and privacy of blockchain with respect to concept, attributes, techniques, and systems, and describes the basic security properties that are supported as the essential requirements and building blocks for Bitcoin-like cryptocurrency systems.
Proceedings ArticleDOI
Civitas: Toward a Secure Voting System
TL;DR: Experimental results give a quantitative evaluation of the tradeoffs between time, cost, and security in Civitas.
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.