Intersection theorems and mod p rank of inclusion matrices
Journal of Combinatorial Theory Series A
A diagonal form for the incidence matrices of t-subsets vs. k-subsets
European Journal of Combinatorics
How to break the direct RSA-implementation of mixes
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Designs, Graphs, Codes, and Their Links
Designs, Graphs, Codes, and Their Links
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Mix-Networks on Permutation Networks
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Optimistic Mixing for Exit-Polls
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Reputation System to Increase MIX-Net Reliability
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Encryption schemes from bilinear maps
Encryption schemes from bilinear maps
How to break another "provably secure" payment system
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
How to break a practical MIX and design a new one
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Privacy-enhancing technologies for the internet, II: five years later
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
A sender verifiable mix-net and a new proof of a shuffle
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Simple and efficient shuffling with provable correctness and ZK privacy
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
Shuffling protocol proposed in Crypto 2005 by Peng et al. is improved so that the number of communication rounds for the verification is reduced. We use an idea of linear representations of the symmetric group and a property of the incidence matrices of 1-subsets and 2-subsets of a finite set. The proposed protocol is valid for mix networks implemented with Paillier encryption schemes with which we can apply some known zero-knowledge proofs following the same line of approaches of Peng et al. [24]. The overall cost for the verification, if we fully implement our idea, is more expensive than that of the original protocol by Peng et al. We, however , can control the level of computation cost for the verification by using the idea of ***-designs properly.