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
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th 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
How to Make Personalized Web Browising Simple, Secure, and Anonymous
FC '97 Proceedings of the First International Conference on Financial Cryptography
Remarks on Mix-Network Based on Permutation Networks
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An implementation of a universally verifiable electronic voting scheme based on shuffling
FC'02 Proceedings of the 6th international conference on Financial cryptography
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Ballot casting assurance via voter-initiated poll station auditing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Distributed Verification of Mixing - Local Forking Proofs Model
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Administrative and public verifiability: can we have both?
EVT'08 Proceedings of the conference on Electronic voting technology
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
Proving a Shuffle Using Representations of the Symmetric Group
Information Security and Cryptology --- ICISC 2008
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
Prêt à voter: a voter-verifiable voting system
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Simple and efficient hash-based verifiable mixing for remote electronic voting
Computer Communications
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
An efficient aggregate shuffle argument scheme
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Practicalization of a range test and its application to e-auction
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Formal and precise analysis of soundness of several shuffling schemes
ProvSec'10 Proceedings of the 4th international conference on Provable security
Efficient multiplicative homomorphic e-voting
ISC'10 Proceedings of the 13th international conference on Information security
An efficient shuffling based eVoting scheme
Journal of Systems and Software
On some incompatible properties of voting schemes
Towards Trustworthy Elections
Klein bottle routing: an alternative to onion routing and mix network
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Prêt à Voter with Paillier encryption
Mathematical and Computer Modelling: An International Journal
A secure mix network with an efficient validity verification mechanism
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
International Journal of Security and Networks
Reliable medical recommendation systems with patient privacy
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
| Hi-index | 0.00 |
A simple and efficient shuffling scheme containing two protocols is proposed. Firstly, a prototype, Protocol-1 is designed, which is based on the assumption that the shuffling party cannot find a linear relation of the shuffled messages in polynomial time. As application of Protocol-1 is limited, it is then optimised to Protocol-2, which does not need the assumption. Both protocols are simpler and more efficient than any other shuffling scheme with unlimited permutation. Moreover, they achieve provable correctness and ZK privacy.