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
Efficient Two-Party Secure Computation on Committed Inputs
TL;DR: A homomorphic, semantically secure variant of the Camenisch-Shoup verifiable cryptosystem, which uses shorter keys, is unambiguous, and allows efficient proofs that a committed plaintext is encrypted under a committed key.
Proceedings ArticleDOI
Improving the Robustness of Private Information Retrieval
TL;DR: This paper presents a Byzantine-robust PIR protocol which provides information-theoretic privacy protection against coalitions of up to all but one of the responding servers, improving the previous result by a factor of 3.
Journal ArticleDOI
Facial Expression Recognition in the Encrypted Domain Based on Local Fisher Discriminant Analysis
TL;DR: This paper presents a system that addresses the challenge of performing facial expression recognition when the test image is in the encrypted domain, and to the best of the knowledge, this is the first known result that performs facial expressions recognition in theencrypted domain.
Book ChapterDOI
Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
TL;DR: In this paper, a threshold DSA scheme that does not require an honest majority is presented, which is useful for securing Bitcoin wallets. But this scheme is not optimal and does not meet the security requirements of DSA.
Journal ArticleDOI
PrÊt À Voter: a Voter-Verifiable Voting System
TL;DR: The key elements of the approach are presented and the evolution of the design and their suitability in various contexts are described and the voter experience, and the security properties that the schemes provide are described.
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.