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
Arx: an encrypted database using semantically secure encryption
TL;DR: This paper proposes Arx, a practical and functionally rich database system that encrypts the data only with semantically secure encryption schemes, and shows that Arx supports real applications such as ShareLaTeX with a modest performance overhead.
Proceedings ArticleDOI
Data Aggregation without Secure Channel: How to Evaluate a Multivariate Polynomial Securely
TL;DR: In this paper, the authors consider how an external aggregator or multiple parties learn some algebraic statistics over participants' data while any individual's input data is kept secret to others (the aggregator and other participants).
Journal ArticleDOI
A Lightweight Continuous Authentication Protocol for the Internet of Things.
TL;DR: A lightweight continuous authentication protocol for sensing devices and gateway devices in general IoT environments is introduced and the concept of valid authentication time period is proposed to enhance robustness of authentication between IoT devices.
Journal ArticleDOI
Efficient and Privacy-Preserving Polygons Spatial Query Framework for Location-Based Services
TL;DR: Detailed security analysis shows that the proposed Polaris can resist various known security threats and performance evaluations via implementing Polaris on smartphone and workstation with real LBS dataset demonstrate Polaris’ effectiveness in term of real environment.
Journal ArticleDOI
$PROST$ : Privacy-Preserving and Truthful Online Double Auction for Spectrum Allocation
TL;DR: This paper theoretically prove that PROST can realize an all-round security against semi-honest adversaries but also extensively evaluate its performance, and Experimental results validate thatPROST achieves nice spectrum allocation efficiency with light computation and communication costs.
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.