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
Secure evaluation of private linear branching programs with medical applications
Mauro Barni,Pierluigi Failla,Vladimir Kolesnikov,Riccardo Lazzeretti,Ahmad-Reza Sadeghi,Thomas Schneider +5 more
TL;DR: In this paper, the authors present new, more efficient privacy-protecting protocols for remote evaluation of such classification/diagnostic programs, in addition to efficiency improvements, they generalize previous solutions -they securely evaluate private linear branching programs (LBP), a useful generalization of Branching programs that they introduce.
Book ChapterDOI
Secure computation on the web: computing without simultaneous interaction
TL;DR: In this article, a study of secure computation in a client-server model where each client connects to the server once and interacts with it, without any other client necessarily being connected at the same time is presented.
Journal ArticleDOI
Privately Evaluating Decision Trees and Random Forests
TL;DR: In this article, two protocols for private evaluation of decision trees and random forests are presented, where the server holds a model (ei- ther a tree or a forest), and the client holds an input (a feature vector). At the conclusion of the protocol, the client learns only the model's output on its input and a few generic parameters concerning the model; the server learns nothing.
Book ChapterDOI
Optimistic Mixing for Exit-Polls
TL;DR: A new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly, and which is ideally suited to compute almost instantly the output of electronic elections, whence the name "exit-poll" mixing.
Proceedings ArticleDOI
Optimal Average-Complexity Ideal-Security Order-Preserving Encryption
TL;DR: This paper presents an also ideal-secure, but significantly more efficient order-preserving encryption scheme, inspired by Reed's referenced work on the average height of random binary search trees, and shows that it improves the average communication complexity from O(n log n) to O( n) under uniform distribution.
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.