Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa  Home/Search
Context
Related
| iacr.org/2005/162.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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic property. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we show how to construct a publicly verifiable mix-net using the shuffle system. (Update)
Active bibliography (related documents): More All
0.7: Breaking and Mending Resilient Mix-nets - Nguyen, Safavi-Naini (2003) (Correct)
0.5: Receipt-Free Electronic Voting Scheme with a Tamper-Resistant.. - Lee, Kim (2002) (Correct)
0.5: Optimistic Mixing for Exit-Polls - Golle, Zhong, Boneh, Jakobsson, Juels (2002) (Correct)
Similar documents based on text: More All
0.7: Verifiable Shuffles: A Formal Model and a.. - Nguyen.. (2005) (Correct)
0.4: On the Security of a Modified Paillier Public-Key Primitive - Sakurai, Takagi (2002) (Correct)
0.3: New Semantically Secure Public-Key Cryptosystems from the.. - Sakurai, Takagi (2001) (Correct)
BibTeX entry: (Update)
@misc{ nguyen-provably,
author = "Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa",
title = "A Provably Secure and Efficient Verifiable Shuffle Based on a Variant of
the {Paillier} Cryptosystem",
url = "citeseer.ist.psu.edu/nguyen05provably.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
645 How to Share a Secret (context) - Shamir - 1979
177 Public-Key Cryptosystems Provably Secure against Chosen Ciph.. - Naor, Yung - 1990
162 Public-Key Cryptosystems Based on Composite Degree Residuosi.. - Paillier - 1999
99 Foundations of Cryptography Basic Tools (context) - Goldreich - 2001
89 the security of El Gamal based encryption - Tsiounis, Yung - 1998
89 Untraceable electronic mail, return addresses, and digital p.. (context) - Chaum - 1981
55 Flash mixing - Jakobsson - 1999
47 A practical mix - Jakobsson - 1998
38 How to break a practical mix and design a new one - Desmedt, Kurosawa - 2000
33 Millimix: Mixing in small batches - Jakobsson, Juels - 1999
32 Fault tolerant anonymous channel - Ogata, Kurosawa et al. - 1997
31 Mix-networks on permutation networks (context) - Abe - 1999
26 Making Mix Nets Robust For Electronic Voting By Randomized P.. - Jakobsson, Juels et al. - 2002
25 An Optimally Robust Hybrid Mix Network - Jakobsson, Juels - 2001
23 Universal Reencryption for Mixnets - Golle, Jakobsson et al. - 2004
21 Mix-based electronic payments - Jakobsson, M'Raihi - 1998
19 Remarks on Mix-Network Based on Permutation Networks (context) - Abe, Hoshino - 2001
16 Optimistic Mixing for Exit-Polls - Golle, Zhong et al. - 2002
16 Foundations of Cryptography, Basic Applications (context) - Goldreich - 2004
13 E#cient anonymous channel and all/nothing election scheme (context) - Park, Itoh et al. - 1993
12 An E#cient Scheme for Proving a Shu#e (context) - Furukawa, Sako - 2001
11 Threshold Cryptosystems Secure against Chosen-Ciphertext Att.. (context) - Fouque, Pointcheval - 2001
10 How to make personalized Web browsing simple, secure, and an.. - Gabber, Gibbons et al. - 1997
8 Almost Entirely Correct Mixing with Application to Voting - Boneh, Golle - 2002
8 A Verifiable Secret Shu#e of Homomorphic Encryptions (context) - Groth - 2003
7 ANODR: ANonymous On Demand Routing with Untraceable Routes f.. - Kong, Hong - 2003
6 An Implementation of a Universally Verifiable Electronic Vot.. (context) - Furukawa, Miyauchi et al. - 2002
3 Targeted advertising and privacy too (context) - Juels - 2001
3 Combining Encryption and Proof of Knowledge in the Random Or.. (context) - Abe - 2004
2 Breaking an E#cient Anonymous Channel (context) - Pfitzmann - 1995
1 The security of a mix-center based on a semantically secure .. (context) - Wikstrom - 2002
1 E#cient, Verifiable Shu#e Decryption and Its Requirement of .. (context) - Furukawa - 2004
1 Authentication and Payment Protocol Preserving Location Priv.. (context) - Choi, Kim - 2003
1 An e#cient o#-line electronic cash system based on the repre.. (context) - Brands - 1993
1 Breaking and Mending Resilient Mix-nets - Nguyen, Safavi-Naini - 2003
1 Verifiable Shu#es: A Formal Model and a Paillier-based E#cie.. (context) - Nguyen, Safavi-Naini et al. - 2004
1 An E#cient Verifiable Shu#e with Perfect Zero-knowledge Proo.. (context) - Nguyen, Safavi-Naini - 2004
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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