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
A Hybrid Scheme of Public-Key Encryption and Somewhat Homomorphic Encryption
Jung Hee Cheon,Jinsu Kim +1 more
TL;DR: A hybrid homomorph encryption that combines public-key encryption (PKE) and somewhat homomorphic encryption (SHE) and a method to reduce the degree of the exponentiation circuit at the cost of additional public keys is introduced.
Book ChapterDOI
Walsh-Hadamard transform in the homomorphic encrypted domain and its application in image watermarking
Peijia Zheng,Jiwu Huang +1 more
TL;DR: This paper discusses the implementation of Walsh-Hadamard transform and its fast algorithm in the encrypted domain and proposes an WHT-based image watermarking algorithm that possesses the characteristics of blind watermark extraction both in the decrypted domain and theencrypted domain.
Journal ArticleDOI
Secure Comparison Protocols in the Semi-Honest Model
TL;DR: This paper analyzes the state-of-the-art comparison protocols for a two-party setting in the semi-honest security protocol in three stages, namely initialization, pre-processing and online computation, by implementing them on a single platform.
Posted Content
Privacy-Preserving Matching of DNA Profiles.
TL;DR: In this article, the authors introduce cryptographic privacy enhancing protocols that allow to perform the most common DNA-based identity, paternity and ancestry tests and thus imple ment privacy-enhanced online genealogy services or research projects.
On Protocol Security in the Cryptographic Model
TL;DR: This dissertation shows that threshold homomorphic encryption allows to solve the secure general multiparty computation problem more efficiently than previous approaches to the problem and augments the recent model of universally composable security with a formal notion of what it means for a protocol to only realize a given problem under a given restricted input-output behavior of the environment.
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.