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
Security and Privacy-Enhancing Multicloud Architectures
TL;DR: A survey on the achievable security merits by making use of multiple distinct clouds simultaneously according to their security and privacy capabilities and prospects is provided.
Homomorphic Encryption Applied to the Cloud Computing Security
TL;DR: This paper is proposing an application of a method to execute operations on encrypted data without decrypting them which will provide the same results after calculations as if the authors have worked directly on the raw data.
Journal ArticleDOI
Secure and private control using semi-homomorphic encryption
TL;DR: It is shown that the problem of figuring out the state measurements of the neighbouring agents of a compromised agent upon using the proposed algorithm is numerically intractable.
Book ChapterDOI
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
Anne Broadbent,Stacey Jeffery +1 more
TL;DR: In this article, the authors formally define and give schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only.
Book ChapterDOI
Non-interactive zero-knowledge arguments for voting
TL;DR: A NIZK argument for correctness of an approval vote is suggested, which improves on state of the art in the case of limited votes, where each voter can vote a small number of times and in shareholder elections, whereEach voter may have a large number of votes to spend.
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.