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
Outsourceable two-party privacy-preserving biometric authentication
TL;DR: This paper proposes a two-party PPBA protocol when the biometric data in consideration are fully encrypted and outsourced to a cloud, and formally analyze the security of the proposed protocol and provides extensive empirical results to show its runtime complexity.
Journal ArticleDOI
Reliable and Privacy-Preserving Truth Discovery for Mobile Crowdsensing Systems
TL;DR: This paper presents two reliable and privacy-preserving truth discovery schemes for different scenarios that are fit for applications where users are relatively stable and frequently moving, and employs the homomorphic Paillier encryption techniques to ensure strong privacy.
Book ChapterDOI
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
TL;DR: This paper uses the [6] technique for verifiable delegation of polynomial evaluations, using algebraic PRFs to achieve verifiability in the outsourced setting, and introduces a new technique for designing efficient secure protocols for these problems (and others).
Book ChapterDOI
Universally Composable Direct Anonymous Attestation
TL;DR: In this article, a comprehensive security definition for full DAA in the form of an ideal functionality in the Universal Composability model is given, which considers the host and TPM to be separate entities that can be in different corruption states.
Journal ArticleDOI
Authenticating top-k queries in location-based services with confidentiality
Qian Chen,Haibo Hu,Jianliang Xu +2 more
TL;DR: This paper proposes two novel cryptographic building blocks, followed by a comprehensive design of authentication schemes for top-k queries based on R-tree and Power Diagram indexes, which consistently show the effectiveness and robustness of the proposed schemes under various system settings and query workloads.
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.