Non-interactive zero-sharing with applications to private distributed decision making

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2742, Issue , 2003, Pages 303-320

  Kiayias, Aggelos ^a   Yung, Moti ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b Computer Science ^*  (United States)

Author keywords

Distributed Decision Making; Electronic Voting; Privacy; Proofs of Knowledge; Simultaneous Disclosure; Veto

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; VOTING MACHINES;

DISTRIBUTED DECISION MAKING; ELECTRONIC VOTING; PROOFS OF KNOWLEDGE; SIMULTANEOUS DISCLOSURE; VETO;

DECISION MAKING;

EID: 35048870415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45126-6_22     Document Type: Article

References (22)

1. Donald Beaver, Commodity-Based Cryptography, STOC 1997.
2. Josh Benaloh, Verifiable Secret-Ballot Elections, PhD Thesis, Yale U., 1987.
3. Josh Benaloh and Moti Yung, Distributing the Power of a Government to Enhance the Privacy of Voters, PODC 1986.
4. Josh Benaloh and Dwight Tuinstra, Receipt-Free Secret-Ballot Elections, STOC 1994.
5. Stefan Brands, Rethinking Privacy, Ph.D. thesis, pages 230-231.
6. David Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM 24(2): 84-88, 1981.
7. David Chaum, Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA, EUROCRYPT 1988.
8. David Chaum and Torben P. Pedersen, Wallet Databases with Observers, CRYPTO 1992.
9. Josh D. Cohen (Benaloh) and Michael J. Fischer, A Robust and Verifiable Cryptographically Secure Election Scheme, FOCS 1985.
10. Ronald Cramer, Rosario Gennaro and Berry Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, EUROCRYPT 1997.
11. Ronald Cramer, Ivan Damgård and Berry Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, CRYPTO 1994.
12. Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers and Moti Yung, Multi-Autority Secret-Ballot Elections with Linear Work, EUROCRYPT 1996.
13. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung, On Monotone Formula Closure of SZK, FOCS 1994.
14. Amos Fiat and Adi Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO 1986.
15. Atsushi Fujioka, Tatsuaki Okamoto and Kazuo Ohta: A Practical Secret Voting Scheme for Large Scale Elections, ASIACRYPT 1992.
16. Oded Goldreich, Silvio Micali, Avi Wigderson, How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority, STOC 1987.
17. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, EUROCRYPT 1999.
18. Martin Hirt and Kazue Sako, Efficient Receipt-Free Voting Based on Homomorphic Encryption, EUROCRYPT 2000.
19. Aggelos Kiayias and Moti Yung, Self-Tallying Elections and Perfect Ballot Secrecy, Public-Key Cryptography 2002.
20. Aggelos Kiayias and Moti Yung, Robust verifiable non-interactive zero-sharing: A plug-in utility for enhanced voters' privacy, Chapter 9, Secure Electronic Voting, Ed. D. Gritzalis, Advances in Information Security, Vol. 7, Kluwer Academic Publishers, Boston, 2002, pp. 139-152.
21. Kazue Sako and Joe Kilian, Secure Voting Using Partially Compatible Homomorphisms, CRYPTO 1994.
22. Berry Schoenmakers, A Simple Publicly Verifiable Secret Sharing Scheme and its Applications to Electronic Voting, CRYPTO 1999.