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
Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey
TL;DR: In this paper, the authors provide a review on economic analysis and pricing models for data collection and wireless communication in Internet of Things (IoT) and highlight some important open research issues as well as future research directions.
Proceedings ArticleDOI
Private and Cheating-Free Outsourcing of Algebraic Computations
D. Benjamin,Mikhail J. Atallah +1 more
TL;DR: In this article, the authors propose a secure and private outsourcing of linear algebra computations, which enable a client to securely outsource expensive algebraic computations (like the multiplication of huge matrices) to two remote servers, such that the servers learn nothing about the customer's private input or the result of the computation, and any attempted corruption of the answer by the servers is detected with high probability.
Journal ArticleDOI
Privacy in the Smart City—Applications, Technologies, Challenges, and Solutions
David Eckhoff,Isabel Wagner +1 more
TL;DR: This work systematize the application areas, enabling technologies, privacy types, attackers, and data sources for the attacks, giving structure to the fuzzy term “smart city.”
Proceedings ArticleDOI
Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability.
TL;DR: This work formally defines anonymous multi-hop locks (AMHLs), a novel cryptographic primitive that serves as a cornerstone for the design of secure and privacy-preserving PCNs and proposes a construction based on ECDSA signatures that does not require scripts, thus solving a prominent open problem in the field.
Journal ArticleDOI
k -Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data
TL;DR: This work is the first to develop a secure k-NN classifier over encrypted data under the semi-honest model and empirically analyzes the efficiency of the proposed protocol using a real-world dataset under different parameter settings.
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.