Distributing the power of a government to enhance the privacy of voters

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributing the power of a government to enhance the privacy of voters

Full text

Pdf (846 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the fifth annual ACM symposium on Principles of distributed computing table of contents

Calgary, Alberta, Canada

Pages: 52 - 62

Year of Publication: 1986

ISBN:0-89791-198-9

Authors

Josh C Benaloh	Yale University
Moti Yung	Columbia University

Sponsor

SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 16, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/10590.10595 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Bro85	Andrei Z. Broder, A provably secure polynomial approximation scheme for the distributed lottery problem (extended abstract), Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.136-148, August 1985, Minaki, Ontario, Canada [doi>10.1145/323596.323608]
	Cha81	David L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, v.24 n.2, p.84-90, Feb. 1981 [doi>10.1145/358549.358563]
	CGMA85	Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults." Proc. 26 th IEEE Syrup. on Foundations of Computer Science, Portland, OR (Oct. 1985), 383-395.
	CoFi85	Cohen, J. and Fischer, M. "A Robust and Verifiable Cryptographically Secure Election Scheme." Proc. 26 th IEEE Syrup. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372-382.
	Coh86a	Cohen, J. "Improving Privacy in Cryptographic Elections." TR-454, Yale University, Department of Computer Science, New Haven, CT (Feb. 1986).
	Coh86b	Cohen, J. "Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols." TR-471, Yale University, Department of Computer Science, New Haven, CT (Apr. 1986).
	DLM82	Richard A. DeMillo , Nancy A. Lynch , Michael J. Merritt, Cryptographic protocols, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.383-400, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802214]
	FeMi85	Feldman, P. and Micali, S. "Byzantine Agreement in Constant Expected Time (and Trusting No One)." Proc. 26 th IEEE Syrup. on Foundations of Computer Science, Portland, OR (Oct. 1985), 267-276.
	GHY85	Galil, Z., Haber, S., and Yung, M. "A Private Interactive Test of a Boolean Predicate and Minimum- Knowledge Public-Key Cryptosystems." Proc. 26 th IEEE Syrup. on Foundations of Computer Science, Portland, OR (Oct. 1985), 360-371.
	GoMi84	Goldwasser, S. and Micali, S. "Probabilistic Encryption." J. Comput. System Sci. 28, (1984), 270-299.
	GMR85	S Goldwasser , S Micali , C Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.291-304, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22178]
	LMR83	Luby, M., Micali, S., and Raekoff, C. "How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically- Biased Coin." Proc. 24 th IEEE Syrup. on Foundations of Computer Science, Tucson, AZ (Nov. 1983), 11-21.
	Mer83	Michael John Merritt, Cryptographic protocols, 1983
	Rab79	M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
	Rab83	Rabin, M. "Transaction Protection by Beacons." J. Comp. Sys. Sci. 27, 2 (Oct. 1983), 256-267.
	Yao82	Yao, A. "Protocols for Secure Computations." Proc. 23 rd IEEE Syrup. on Foundations of Computer Science, Chicago, IL (Nov. 1982), 160-164.

CITED BY 11

	C. Andrew Neff, A verifiable secret shuffle and its application to e-voting, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
	Josh Benaloh , Dwight Tuinstra, Receipt-free secret-ballot elections (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.544-553, May 23-25, 1994, Montreal, Quebec, Canada
	Ming-Deh A. Huang , Shang-Hua Teng, Secure and verifiable schemes for election and general distributed computing problems, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.182-196, August 15-17, 1988, Toronto, Ontario, Canada
	Rosario Gennaro, Achieving independence efficiently and securely, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, p.130-136, August 20-23, 1995, Ottowa, Ontario, Canada
	David Naccache , Jacques Stern, A new public key cryptosystem based on higher residues, Proceedings of the 5th ACM conference on Computer and communications security, p.59-66, November 02-05, 1998, San Francisco, California, United States
	Berry Schoenmakers, Compensating for a lack of transparency, Proceedings of the tenth conference on Computers, freedom and privacy: challenging the assumptions, p.231-233, April 04-07, 2000, Toronto, Ontario, Canada
	Alejandro Hevia , Marcos Kiwi, Electronic jury voting protocols, Theoretical Computer Science, v.321 n.1, p.73-94, June 16, 2004
	Qiang Huang , David Jao , Helen J. Wang, Applications of secure electronic voting to automated privacy-preserving troubleshooting, Proceedings of the 12th ACM conference on Computer and communications security, November 07-11, 2005, Alexandria, VA, USA
	Ben Adida , Ronald L. Rivest, Scratch & vote: self-contained paper-based cryptographic voting, Proceedings of the 5th ACM workshop on Privacy in electronic society, October 30-30, 2006, Alexandria, Virginia, USA
	Daniel Sandler , Dan S. Wallach, Casting votes in the auditorium, Proceedings of the USENIX/Accurate Electronic Voting Technology on USENIX/Accurate Electronic Voting Technology Workshop, p.4-4, August 06, 2007, Boston, MA
	Zhe Xia , Steve A. Schneider , James Heather , Jacques Traoré, Analysis, improvement and simplification of Prêt à voter with Paillier encryption, Proceedings of the conference on Electronic voting technology, p.1-15, July 28-29, 2008, San Jose, CA