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
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
Distributed Algorithms
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Targeted Advertising ... And Privacy Too
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th 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
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Millimix: Mixing in Small Batches
Millimix: Mixing in Small Batches
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th 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
Almost entirely correct mixing with applications to voting
Proceedings of the 9th ACM conference on Computer and communications security
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
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Proceedings of the 11th ACM conference on Computer and communications security
Proceedings of the 11th ACM conference on Computer and communications security
Batch zero-knowledge proof and verification and its applications
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the 9th workshop on Multimedia & security
Approach to designing bribery-free and coercion-free electronic voting scheme
Journal of Systems and Software
Deterring voluntary trace disclosure in re-encryption mix-networks
ACM Transactions on Information and System Security (TISSEC)
Survey on anonymous communications in computer networks
Computer Communications
Flaws in some robust optimistic mix-nets
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
A length-flexible threshold cryptosystem with applications
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Fault tolerant and distributed broadcast encryption
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
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
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
Building reliable mix networks with fair exchange
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Some remarks on universal re-encryption and a novel practical anonymous tunnel
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Onions based on universal re-encryption – anonymous communication immune against repetitive attack
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Prêt à voter with re-encryption mixes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
An efficient publicly verifiable mix-net for long inputs
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Mix-Network with stronger security
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
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
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
| Hi-index | 0.00 |
We present a mix network that achieves efficient integration of public-key and symmetric-key operations. This hybrid mix network is capable of natural processing of arbitrarily long input elements, and is fast in both practical and asymptotic senses. While the overhead in the size of input elements is linear in the number of mix servers, it is quite small in practice. In contrast to previous hybrid constructions, ours has optimal robustness, that is, robustness against any minority coalition of malicious servers.