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
VGAN-Based Image Representation Learning for Privacy-Preserving Facial Expression Recognition
TL;DR: Wang et al. as mentioned in this paper proposed a Privacy-Preserving Representation-Learning Variational Generative Adversarial Network (PPRL-VGAN) to learn an image representation that is explicitly disentangled from the identity information.
Proceedings ArticleDOI
Fault Injection Resilience
TL;DR: This paper illustrates two families of fault injection resilience (FIR) schemes suitable for symmetric encryption, and details how a countermeasure of this later family can both protect both against active and passive attacks, thereby bringing a combined global protection of the device.
Journal ArticleDOI
Chaintegrity: blockchain-enabled large-scale e-voting system with robustness and universal verifiability
TL;DR: This work proposes a novel BEV system, named Chaintegrity, that fulfills all the specified desiderata and proposes a hybrid data structure which combines the counting Bloom filter and the Merkle hash tree for fast authentication.
Book ChapterDOI
Homomorphic Encryption with CCA Security
Manoj Prabhakaran,Mike Rosulek +1 more
TL;DR: A new family of encryption schemes are described that satisfy precise definitions for a wide variety of allowed transformations T, and which are secure under the standard Decisional Diffie-Hellman (DDH) assumption.
Journal ArticleDOI
Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
TL;DR: A lightweight Homomorphic Encryption scheme is used to ensure data security and privacy with any computational limitations overcome through a convenient data processing model that employs a single private server collaborating with a set of public servers within a cloud data centre.
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.