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
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
SIAM Journal on Computing
Batch Verification with Applications to Cryptography and Checking
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
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
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
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
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
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
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
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
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Proceedings of the 11th ACM conference on Computer and communications security
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Single-bit re-encryption with applications to distributed proof systems
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Collusion-Free Protocols in the Mediated Model
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
On anonymity in an electronic society: A survey of anonymous communication systems
ACM Computing Surveys (CSUR)
Remote Electronic Voting with Revocable Anonymity
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Survey on anonymous communications in computer networks
Computer Communications
Attacking unlinkability: the importance of context
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
True trustworthy elections: remote electronic voting using trusted computing
ATC'11 Proceedings of the 8th international conference on Autonomic and trusted computing
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Work-focused analysis and design
Cognition, Technology and Work - Special Issue on Human-automation Coagency
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Coercion-resistant electronic elections
Towards Trustworthy Elections
The vector-ballot approach for online voting procedures
Towards Trustworthy Elections
An analysis of parallel mixing with attacker-controlled inputs
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
The norwegian internet voting protocol
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Trivitas: voters directly verifying votes
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
A secure mix network with an efficient validity verification mechanism
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Review: An overview of anonymity technology usage
Computer Communications
Scaling privacy guarantees in code-verification elections
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Mosaic: a secure and practical remote voting system
International Journal of Autonomic Computing
Hi-index | 0.00 |
In order to design an exceptionally efficient mix network, both asymptotically and in real terms, we develop the notion of almost entirely correct mixing, and propose a new mix network that is almost entirely correct. In our new mix, the real cost of proving correctness is orders of magnitude faster than all other mix nets. The trade-off is that our mix only guarantees "almost entirely correct" mixing, i.e it guarantees that the mix network processed correctly all inputs with high (but not overwhelming) probability. We use a new technique for verifying correctness. This new technique consists of computing the product of a random subset of the inputs to a mix server, then require the mix server to produce a subset of the outputs of equal product. Our new mix net is of particular value for electronic voting, where a guarantee of almost entirely correct mixing may well be sufficient to announce instantly the result of a large election. The correctness of the result can later be verified beyond a doubt using any one of a number of much slower proofs of perfect-correctness, without having to mix the ballots again.