by Takao Onodera, Keisuke Tanaka
http://www.is.titech.ac.jp/research/research-report/C/C-193.ps.gz
Add To MetaCart
Abstract:
In this paper, we propose a zero-knowledge proof scheme of shuffle. Unlike the previous schemes [6, 9, 4], our scheme can be used as the shuffle of the elements encrypted by Paillier’s encryption scheme, which has an additive homomorphic property in the message part. The ElGamal encryption scheme, used in the previous schemes [6, 9, 4], does not have this property. Keywords: Paillier’s encryption scheme, zero-knowledge proof, shuffle 1
Citations
|
1496
|
Handbook of Applied Cryptography
– Menezes, Oorschot, et al.
- 1996
|
|
845
|
Probabilistic Encryption
– Goldwasser, Micali
- 1984
|
|
264
|
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt ’99
– Paillier
|
|
124
|
Verifiable Secret-Ballot Elections
– Benaloh
- 1987
|
|
119
|
A new public key cryptosystem as secure as factoring
– Okamoto, Uchiyama
- 1998
|
|
117
|
An efficient off-line electronic cash system based on the representation problem
– Brands
- 1993
|
|
77
|
A robust and verifiable cryptographically secure election scheme
– Cohen, Fisher
- 1985
|
|
48
|
An efficient scheme for proving a shuffle
– Furukawa, Sako
- 2001
|
|
38
|
A new public key cryptosystem based on higher residues
– Naccache, Stern
- 1998
|
|
31
|
A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system
– Damgard, Jurik
- 2001
|
|
27
|
A verifiable secret shuffle of homomorphic encryptions
– Groth
|
|
12
|
A length-flexible threshold cryptosystem with applications
– Damg˚ard, Jurik
- 2003
|
|
11
|
On the security of modular exponentiation with application to the construction of pseudorandom generators
– Goldreich, Rosen
- 2000
|
|
8
|
An implementation of a universally verifiable electronic voting scheme based on shuffling
– Furukawa, Miyauchi, et al.
- 2002
|
|
6
|
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
– Furukawa
- 2004
|
