Public-key cryptosystems based on composite degree residuosity classes

DMCA

Public-key cryptosystems based on composite degree residuosity classes (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Pascal Paillier

Venue:	IN ADVANCES IN CRYPTOLOGY — EUROCRYPT 1999
Citations:	1006 - 4 self

BibTeX

@INPROCEEDINGS{Paillier99public-keycryptosystems,
    author = {Pascal Paillier},
    title = {Public-key cryptosystems based on composite degree residuosity classes},
    booktitle = {IN ADVANCES IN CRYPTOLOGY — EUROCRYPT 1999},
    year = {1999},
    pages = {223--238},
    publisher = {Springer-Verlag}
}

OpenURL

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.

Keyphrases

public-key cryptosystems composite degree residuosity class encryption scheme public-key cryptography trapdoor permutation appropriate assumption novel computational problem usual modular arithmetic composite residuosity class problem new trapdoor mechanism homomorphic probabilistic encryption scheme standard model

DMCA