Kouichi Sakurai, Tsuyoshi Takagi  Home/Search
Context
Related
| informatik.tudarmstad...TI0204.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.tud...DME.year.author (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Choi et al. proposed the modified Paillier cryptosystem (M-Paillier cryptosystem). They use a special public-key g ∈ Z/nZ such that g^φ(n) = 1 + n mod n², where n is the RSA modulus. The distribution of the public key g is different from that of the original one. In this paper, we study the security of the usage of the public key. Firstly, we prove that the one-wayness of the M-Paillier cryptosystem is as intractable as factoring the modulus n, if the public key g can be generated ... (Update)
Similar documents based on text: More All
0.4: A Provably Secure and Efficient Verifiable Shuffle.. - Nguyen.. (2005) (Correct)
0.4: New Semantically Secure Public-Key Cryptosystems from the.. - Sakurai, Takagi (2001) (Correct)
0.3: Enhancing Classroom Lectures with Digital Sliding.. - Rößling, Trompler.. (2004) (Correct)
BibTeX entry: (Update)
@misc{ sakurai-security,
author = "Kouichi Sakurai and Tsuyoshi Takagi",
title = "On the Security of a Modified {Paillier} Public-Key Primitive",
url = "citeseer.ist.psu.edu/sakurai02security.html" }
Citations (may not include all citations):260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999
109 A new public-key cryptosystem as secure as factoring (context) - Okamoto, Uchiyama - 1998
109 Digitalized signatures and public-key functions as intractab.. (context) - Rabin - 1979
108 Secure integration of asymmetric and symmetric encryption sc.. - Fujisaki, Okamoto - 1999
48 REACT: Rapid Enhanced-security Asymmetric Cryptosystem Trans.. (context) - Okamoto, Pointcheval - 2001
22 Paillier's cryptosystem revisited - Catalano, Gennaro et al. - 2001
9 a simpli cation and some applications of Paillier's probabil.. (context) - Damg, Jurik et al. - 2001
9 The bit security of Paillier's encryption scheme and its app.. (context) - Catalano, Gennaro et al. - 2001
7 Elliptic curve Paillier schemes - Galbraith - 2001
5 New semantically secure public-key cryptosystems from the RS.. - Sakurai, Takagi - 2002
4 An ecient non-interactive statistical zero-knowledge proof s.. - Gennaro, Micciancio et al. - 1998
3 Proving that a number is the product of two safe primes (context) - Camenish, Michels - 1999
3 Ecient public key cryptosystems provably secure against acti.. (context) - Paillier, Pointcheval - 1999
2 International Workshop on Practice and Theory in Public Key .. (context) - Fujisaki, Okamoto et al. - 1999
[Article contains additional citations not shown here]
Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html): More
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Jr.. (Correct)
Efficient Undeniable Signature Schemes Based on Ideal.. - Biehl, Paulus, Takagi (1999) (Correct)
Number Field Cryptography - Buchmann, Takagi, Vollmer (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC