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
Posted Content
Smooth Projective Hashing and Two-Message Oblivious Transfer.
Shai Halevi,Yael Tauman Kalai +1 more
TL;DR: Aiello et al. as mentioned in this paper presented a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup's notion of smooth projective hashing.
Journal ArticleDOI
Towards Emotionally Aware AI Smart Classroom: Current Issues and Directions for Engineering and Education
TL;DR: The proposed system is capable of making real-time suggestions to an in-class presenter to improve the quality and memorability of their presentation by allowing the presenter to make real- time adjustments/corrections to their non-verbal behavior, such as hand gestures, facial expressions, and body language.
Journal ArticleDOI
A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy
Slawomir Goryczka,Li Xiong +1 more
TL;DR: This paper considers the problem of secure data aggregation in a distributed setting, while ensuring differential privacy of the result, and introduces a new distributed privacy mechanism with noise drawn from the Laplace distribution, which achieves smaller redundant noise with efficiency.
Proceedings Article
Towards statistical queries over distributed private user data
TL;DR: A design that places tight bounds on the extent to which malicious clients can distort answers, scales well, and tolerates churn among clients is presented, and performance results of a complete implementation are given.
Proceedings ArticleDOI
A privacy-preserving protocol for neural-network-based computation
TL;DR: The problem of secure data processing by means of a neural network (NN) is addressed and an efficient way of implementing the proposed protocol by Means of some recently proposed multi-party computation techniques is 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.