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
VF2Boost: Very Fast Vertical Federated Gradient Boosting for Cross-Enterprise Learning
TL;DR: Wang et al. as mentioned in this paper introduced VF^2Boost, a novel and efficient vertical federated gradient boosting decision tree (GBDT) algorithm under the vertical FL setting, which can be 12.8-18.9 times faster than the existing vertical FL implementations and support much larger datasets.
Journal ArticleDOI
Lightweight and Efficient Privacy-Preserving Data Aggregation Approach for the Smart Grid
Mohamad Badra,Sherali Zeadally +1 more
TL;DR: This work proposes an efficient, lightweight privacy-preserving data aggregation approach that makes use of symmetric homomorphic encryption and Diffie-Hellman or Elliptic Curve Diffie–Hellman (ECDH) key exchange methods and demonstrates the superiority of this approach in terms of its low transmission and message overheads.
Proceedings Article
Analysis, improvement and simplification of Prêt à voter with Paillier encryption
TL;DR: In this paper, information leakage is analysed in Ryan's Pret a Voter with Paillier encryption scheme (PAV-Paillier) and it is suggested that this model can be applied to analyse information leakage in other complex mixnet based e-voting schemes as well.
Book ChapterDOI
Threshold Cryptosystems Based on Factoring
Jonathan Katz,Moti Yung +1 more
TL;DR: A threshold version of a variant of the signature standards ISO 9796-2 and PKCS#1 v1.5 is described, thus giving the first threshold signature scheme whose security (in the random oracle model) is equivalent to the hardness of factoring.
Journal ArticleDOI
Information fusion in data privacy: A survey
TL;DR: The role of information fusion in data privacy is reviewed, and how information and data fusion are used in some fields of data privacy 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.