Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes

15Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 1998/99, T. Okamoto and S. Uchiyama on the one hand and P. Paillier on the other hand introduced homomorphic encryption schemes semantically secure against passive adversaries (IND-CPA). Both schemes follow in the footsteps of Goldwasser-Micali, Benaloh-Fischer and Naccache-Stern cryptosystems, and yield their improvements above the latter by changing the group structure. Paillier's scheme works in the group ℤn2x where n is an RSA modulus, whilst Okamoto-Uchiyama is located in the group Znx for n of p2q type. The new schemes attracted much attention because of their rich mathematical structure. It is notable that Okamoto-Uchiyama is one-way under the p2q factoring assumption, whilst there is no reduction known from the one-wayness of Paillier's scheme to a standard computational assumption. In this paper we point out that the combination of both techniques yields a new scheme that inherits all the nice properties of Paillier's scheme and that is one-way under the p2q factoring assumption. The one-wayness is based on a new trapdoor one-way function which might be of independent interest. In addition, we show how to construct trapdoor commitment schemes with practical applications based on our new scheme and on the trapdoor function. Among other things, we propose a trapdoor commitment scheme that perfectly meets the requirements to construct Shamir-Tauman on-line/off-line signatures. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Schmidt-Samoa, K., & Takagi, T. (2005). Paillier’s cryptosystem modulo p2q and its applications to trapdoor commitment schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3715 LNCS, pp. 296–313). https://doi.org/10.1007/11554868_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free