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
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th 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
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
How to Prevent Buying of Votes in Computer Elections
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Receipt-Free Electronic Voting Schemes for Large Scale Elections
Proceedings of the 5th International Workshop on Security Protocols
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual 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
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
You can prove so many things in zero-knowledge
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
| Hi-index | 0.00 |
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the "market" for monetary influence in political campaigns. To realize their proposal, we propose new cryptographic protocols for commital deniable proofs and deniable payment schemes.