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
Efficient Techniques for Privacy-Preserving Sharing of Sensitive Information.
TL;DR: This paper explores the notion of Privacy-Preserving Sharing of Sensitive Information (PPSSI), and provides a concrete and efficient instantiation, modeled in the context of simple database querying, that functions as a privacy shield to protect parties from disclosing more than the required minimum of their respective sensitive information.
Proceedings ArticleDOI
Secure multiparty computation based privacy preserving smart metering system
TL;DR: This work proposes a secure multi-party computation (SMC) based privacy preserving protocol for smart meter based load management and implements a demonstration system which includes a graphical user interface and simulates network communication.
Posted Content
Security for 4G and 5G Cellular Networks: A Survey of Existing Authentication and Privacy-preserving Schemes
Mohamed Amine Ferrag,Leandros A. Maglaras,Antonios Argyriou,Dimitrios Kosmanos,Helge Janicke +4 more
TL;DR: A comprehensive survey of authentication and privacy-preserving schemes for 4G and 5G cellular networks can be found in this paper, where the authors provide an overview of existing surveys that deal with 4G communications, applications, standardization, and security.
Journal ArticleDOI
Cloud-Based Quadratic Optimization With Partially Homomorphic Encryption
Andreea B. Alexandru,Konstantinos Gatsis,Yasser Shoukry,Sanjit A. Seshia,Paulo Tabuada,George J. Pappas +5 more
TL;DR: In this paper, a cloud-based protocol for a constrained quadratic optimization problem involving multiple parties, each holding private data, is proposed, based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure communication techniques.
Journal ArticleDOI
Elliptic Curve-Based Secure Multidimensional Aggregation for Smart Grid Communications
TL;DR: This paper proposes a scheme that considers multidimensional aggregation with privacy preserving and an efficient verification of smart grid data that is based on elliptic curve cryptography along with homomorphic encryption and without pairings.
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.