Distributing the power of a government to enhance the privacy of voters
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Practical multi-candidate election system
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
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial 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
Multi-authority secret-ballot elections with linear work
Multi-authority secret-ballot elections with linear work
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Impossibility of Obfuscation with Auxiliary Input
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th 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
Flaws in some robust optimistic mix-nets
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An adaptively secure mix-net without erasures
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
Casting votes in the auditorium
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
A Commitment-Consistent Proof of a Shuffle
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Efficient and secure protocols for privacy-preserving set operations
ACM Transactions on Information and System Security (TISSEC)
On strong simulation and composable point obfuscation
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient fuzzy matching and intersection on private datasets
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Simulatable adaptive oblivious transfer with statistical receiver's privacy
ProvSec'11 Proceedings of the 5th international conference on Provable security
Obfuscation of hyperplane membership
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Secure obfuscation for encrypted signatures
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Functional re-encryption and collusion-resistant obfuscation
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Cooperative private searching in clouds
Journal of Parallel and Distributed Computing
Efficiently shuffling in public
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
How to fix two RSA-based PVSS schemes: exploration and solution
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the (im)possibility of projecting property in prime-order setting
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Black-box obfuscation for d-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We show how to obfuscate a secret shuffle of ciphertexts: shuffling becomes a public operation. Given a trusted party that samples and obfuscates a shuffle before any ciphertexts are received, this reduces the problem of constructing a mix-net to verifiable joint decryption. We construct public-key obfuscations of a decryption shuffle based on the Boneh-Goh-Nissim (BGN) cryptosystem and a re-encryption shuffle based on the Paillier cryptosystem. Both allow efficient distributed verifiable decryption. Finally, we give a distributed protocol for sampling and obfuscating each of the above shuffles and show how it can be used in a trivial way to construct a universally composable mix-net. Our constructions are practical when the number of senders N is small, yet large enough to handle a number of practical cases, e.g. N = 350 in the BGN case and N = 2000 in the Paillier case.