scispace - formally typeset
Open AccessBook ChapterDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

A New Randomness Extraction Paradigm for Hybrid Encryption.

TL;DR: This framework provides an efficient generic transformation from 1-universal to 2-universal hash proof systems and allows to prove IND-CCA2 security of a hybrid version of 1991's Damgard's ElGamal public-key encryption scheme under the DDH assumption.
Book ChapterDOI

A framework for password-based authenticated key exchange

TL;DR: In this article, the authors present a general framework for password-based authenticated key exchange protocols in the common reference string model, based on the recently introduced notion of smooth projective hashing by Cramer and Shoup.
Posted Content

Coercion-Resistant Electronic Elections.

TL;DR: In this paper, the authors introduce a model for electronic election schemes that involves a more powerful adversary than previous work, allowing the adversary to demand of coerced voters that they vote in a particular manner, abstain from voting, or even disclose their secret keys.
Journal ArticleDOI

Securing smart grid: cyber attacks, countermeasures, and challenges

TL;DR: This article describes smart grid goals and tactics, and presents a threelayer smart grid network architecture, and defines a taxonomy of basic cyber attacks, upon which sophisticated attack behaviors may be built.
Proceedings ArticleDOI

Secure and practical outsourcing of linear programming in cloud computing

TL;DR: This paper investigates secure outsourcing of widely applicable linear programming (LP) computations and develops a set of efficient privacy-preserving problem transformation techniques, which allow customers to transform original LP problem into some random one while protecting sensitive input/output information.
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

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.