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
Book ChapterDOI
Polylogarithmic private approximations and efficient matching
Piotr Indyk,David P. Woodruff +1 more
TL;DR: In this article, the first two-party private approximation of the l2 distance with polylogarithmic communication was given, which was later extended to the private approximate near neighbor problem.
Journal ArticleDOI
Towards Privacy Protection in Smart Grid
TL;DR: An analysis of recently proposed smart grid privacy solutions is presented and their strengths and weaknesses are identified in terms of their implementation complexity, efficiency, robustness, and simplicity.
Book ChapterDOI
Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts
TL;DR: Although smart contracts are believed to have a huge potential, for the moment they are not widely used in practice, because most of Bitcoin miners allow only to post standard transactions on the blockchain, it is currently very hard to create non-trivial smart contracts in Bitcoin.
Proceedings ArticleDOI
An efficient buyer-seller watermarking protocol based on composite signal representation
TL;DR: This paper proposes an efficient buyer-seller watermarking protocol based on homomorphic public-key cryptosystem and composite signal representation in the encrypted domain and results confirm the efficiency of the proposed solution.
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.