How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
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
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
An optimally robust hybrid mix network
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
SAC '98 Proceedings of the Selected Areas in Cryptography
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th 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
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th 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
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
How to Make Personalized Web Browising Simple, Secure, and Anonymous
FC '97 Proceedings of the First International Conference on Financial Cryptography
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key 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
Self-tallying Elections and Perfect Ballot Secrecy
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
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
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th 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
An implementation of a universally verifiable electronic voting scheme based on shuffling
FC'02 Proceedings of the 6th international conference on Financial cryptography
Almost entirely correct mixing with applications to voting
Proceedings of the 9th ACM conference on Computer and communications security
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Anonymity-preserving data collection
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Efficient anonymity-preserving data collection
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A Light-Weight e-Voting System with Distributed Trust
Electronic Notes in Theoretical Computer Science (ENTCS)
Batch zero-knowledge proof and verification and its applications
ACM Transactions on Information and System Security (TISSEC)
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
Administrative and public verifiability: can we have both?
EVT'08 Proceedings of the conference on Electronic voting technology
Analysis, improvement and simplification of Prêt à voter with Paillier encryption
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
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
Information Sciences: an International Journal
Identity-based mix: Anonymous communications without public key certificates
Computers and Electrical Engineering
Survey on anonymous communications in computer networks
Computer Communications
Simple and efficient hash-based verifiable mixing for remote electronic voting
Computer Communications
Flaws in some robust optimistic mix-nets
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
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
Security of sequential multiple encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
An efficient shuffling based eVoting scheme
Journal of Systems and Software
Verifiable encrypted redundancy for mix-type remote electronic voting
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
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
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
An efficient publicly verifiable mix-net for long inputs
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Defeating malicious servers in a blind signatures based voting system
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
The vector-ballot approach for online voting procedures
Towards Trustworthy Elections
On some incompatible properties of voting schemes
Towards Trustworthy Elections
Mix-Network with stronger security
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Efficiently shuffling in public
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Cryptanalysis of a universally verifiable efficient re-encryption mixnet
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Allowing continuous evaluation of citizen opinions through social networks
EGOVIS'12/EDEM'12 Proceedings of the 2012 Joint international conference on Electronic Government and the Information Systems Perspective and Electronic Democracy, and Proceedings of the 2012 Joint international conference on Advancing Democracy, Government and Governance
A secure mix network with an efficient validity verification mechanism
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
A mix-net from any CCA2 secure cryptosystem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Randomized partial checking revisited
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Mosaic: a secure and practical remote voting system
International Journal of Autonomic Computing
| Hi-index | 0.00 |
We propose a new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly (the usual case). Our mix network only produces an output if no server cheats. However, in the rare case when one or several mix servers cheat, we convert the inputs to a format that allows "back-up" mixing. This back-up mixing can be implemented using any one of a wide array of already proposed (but slower) mix networks. When all goes well, our mix net is the fast est, both in real terms and asymptotically, of all those that offer standard guarantees of privacy and correctness. In practice, this benefit far outweighs the drawback of a comparatively complex procedure to recover from cheating. Our new mix is ideally suited to compute almost instantly the output of electronic elections, whence the name "exit-poll" mixing.