The notion of security for probabilistic cryptosystems
SIAM Journal on Computing - Special issue on cryptography
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
SAC '98 Proceedings of the Selected Areas in Cryptography
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme
ASIACRYPT '96 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
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
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
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
Efficient zero-knowledge argument for correctness of a shuffle
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Hi-index | 0.00 |
We introduce a definition of a re-encryption mix-center, and a definition of security for such a mix-center. Then we prove that any semantically secure public key system, which allows re-encryption, can be used to construct a secure mix-center.