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
Proceedings ArticleDOI
Efficient privacy preserving content based publish subscribe systems
TL;DR: This paper proposes a novel approach to preserve the privacy of the subscriptions made by Subscribers and confidentiality of the data published by Content Publishers using cryptographic techniques when third-party Content Brokers are utilized to make routing decisions based on the content.
Journal ArticleDOI
Privacy-Preserving Data Processing with Flexible Access Control
TL;DR: This paper proposes a privacy-preserving data processing scheme with flexible access control based on Paillier's partial homomorphic encryption (PHE), and proves the security of the scheme and its efficiency and advantages through simulations and comparisons with existing work.
Posted Content
Logistic Regression Model Training based on the Approximate Homomorphic Encryption.
TL;DR: This paper presents a method to train a logistic regression model without information leakage, and applies the homomorphic encryption scheme of Cheon et al. (ASIACRYPT 2017) for an efficient arithmetic over real numbers, and devise a new encoding method to reduce storage of encrypted database.
Book ChapterDOI
Secure Hamming Distance Based Computation and Its Applications
Ayman Jarrous,Benny Pinkas +1 more
TL;DR: This paper presents protocols which are secure in the sense of full simulatability against malicious adversaries, including a protocol the authors call m -point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR).
Journal ArticleDOI
Privacy-preserving collaborative association rule mining
TL;DR: This paper defines a protocol using homomorphic encryption techniques to exchange the data while keeping it private, and develops a secure protocol for multiple parties to conduct the desired computation.
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.