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
Embellishing text search queries to protect user privacy
TL;DR: This paper identifies the privacy risks arising from semantically related search terms within a query, and from recurring high-specificity query terms in a search session, and proposes a solution for a similarity text retrieval system to offer anonymity and plausible deniability for the query terms, and hence the user intent, without degrading the system's precision-recall performance.
Proceedings ArticleDOI
Private, Yet Practical, Multiparty Deep Learning
TL;DR: This paper designs, implements, and evaluates ∝MDL, a new MDL paradigm built upon three primitives: asynchronous optimization, lightweight homomorphic encryption, and threshold secret sharing, which demonstrates the efficacy of ∝ MDL.
Journal ArticleDOI
A New Communication-Efficient Privacy-Preserving Range Query Scheme in Fog-Enhanced IoT
TL;DR: A new communication-efficient privacy-preserving range query scheme in Fog-enhanced IoT that employs a range query expression, decomposition, and composition technique to reorganize the range query and is efficient in terms of low range query generation cost and low communication overhead.
Posted Content
Secure Multiparty Computation for Privacy-Preserving Data Mining.
Yehuda Lindell,Benny Pinkas +1 more
TL;DR: The issue of e-ciency is discussed and the di-cul- ties involved in constructing highly e-cient protocols are demonstrated and the relationship between secure multiparty computation and privacy-preserving data mining is discussed.
Posted Content
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications.
TL;DR: In this paper, the RSA, Rabin, Paillier, and El Gamal encryption schemes were improved with a small overhead beyond the original, semantically-secure scheme.
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.