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
Computing Blindfolded: New Developments in Fully Homomorphic Encryption
TL;DR: This work will take the reader through a journey of developments of fully homomorphic encryption involving novel mathematical techniques, and a glimpse of the exciting research directions that lie ahead.
Proceedings ArticleDOI
Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations
TL;DR: Wysteria is presented, a high-level programming language for writing SMCs and it is found that Wysteria's performance is competitive with prior approaches while making programming far easier, and more trustworthy.
Proceedings ArticleDOI
Paillier's cryptosystem revisited
TL;DR: This work re-examine Paillier's cryptosystem, and shows that by choosing a particular discrete log base g, and by introducing an alternative decryption procedure, the scheme can be extended to allow an arbitrary exponent e instead of N, and the use of low exponents substantially increases the efficiency of the scheme.
Proceedings ArticleDOI
Efficient Arguments without Short PCPs
TL;DR: A direct method for compiling an exponentially long PCP which is succinctly described by a linear oracle function into an argument system in which the verifier sends to the prover O(n) encrypted field elements and receives O(1) encryptions in return.
Journal Article
Secure multiple linear regression based on homomorphic encryption
TL;DR: This work conceptualizes the existence of a single combined database containing all of the information for the individuals in the separate databases and for the union of the variables, and proposes an approach that gives full statistical calculation on this combined database without actually combining information sources.
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.