Receipt-free secret-ballot elections (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Receipt-free secret-ballot elections (extended abstract)

Full text

Pdf (1.09 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing table of contents

Montreal, Quebec, Canada

Pages: 544 - 553

Year of Publication: 1994

ISBN:0-89791-663-8

Authors

Josh Benaloh	Clarkson University
Dwight Tuinstra	Clarkson University

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 65, Citation Count: 27

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/195058.195407 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.

	Arro63	Arrow, K. Social Choice and Individual Values. John Wiley and Sons, New York (1963).
	Baba85	L Babai, Trading group theory for randomness, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.421-429, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22192]
	Beav89	Donald Beaver, Multiparty protocols tolerating half faulty processors, Proceedings on Advances in cryptology, p.560-572, July 1989, Santa Barbara, California, United States
	Beav91	Donald Beaver, Foundations of Secure Interactive Computing, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.377-391, August 11-15, 1991
	BeGo89	Beaver, D. and Goldwasser, $. "Multiparty Computation with Faulty Majority." Proc. 30th IEEE Syrup. on Foundations of Computer Science, Research Triangle Park, NC (Oct.-Nov. 1989), 468-473.
	Bena86a	Josh Cohen Benaloh, Cryptographic capsules: a disjunctive primitive for interactive protocols, Proceedings on Advances in cryptology---CRYPTO '86, p.213-222, January 1987, Santa Barbara, California, United States
	Bena86b	Josh Cohen Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret, Proceedings on Advances in cryptology---CRYPTO '86, p.251-260, January 1987, Santa Barbara, California, United States
	Bena87	Josh Daniel Cohen Benaloh, Verifiable secret-ballot elections, 1987
	Bena94	Benaloh, J. "Dense Probabilistic Encryption." Proc. SAC '9# - Workshop on Selected Areas of Cryptography, Kingston, ON (May 1994).
	BeYu86	Josh C Benaloh , Moti Yung, Distributing the power of a government to enhance the privacy of voters, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.52-62, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10595]
	BFKR90	Donald Beaver , Joan Feigenbaum , Joe Kilian , Phillip Rogaway, Security with Low Communication Overhead, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.62-76, August 11-15, 1990
	BGW88	Michael Ben-Or , Shafi Goldwasser , Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.1-10, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62213]
	BIBe89	J. Bar-Ilan , D. Beaver, Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.201-209, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72995]
	CaRa93	Ran Canetti , Tal Rabin, Fast asynchronous Byzantine agreement with optimal resilience, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.42-51, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167105]
	CCD88	David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62214]
	CGMA85	Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults." Proc. 26th IEEE Syrup. on Foundations of Computer Science, Portlazld, OR (Oct. 1985), 383-395.
	Chau81	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]
	Chau86	Chaum, D. "Elections with Unconditionally Secret-Ballots and Disruption Equivalent to Breaking RSA." unpublished manuscript (1986).
	CoFi85	Cohen, J. and Fischer, M. "A Robust and Verifiable Cryptographically Secure Election Scheme." Proc. 26th IEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372-382.
	Cohe86	Cohen, J. "Improving Privacy in Cryptographic Elections." TR-454, Yale University, Department of Computer Science, New Haven, CT (Feb. 1986).
	DiHe76	Diifie# W. and Hellman, M. "New Directions in Cryptography." IEEE Trans. on Information Theory 22, 6, (Nov. 1976), 644-654.
	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]
	GaMo93	Juan A. Garay , Yoram Moses, Fully polynomial Byzantine agreement in t + 1 rounds, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.31-41, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167101]
	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]
	GMW87	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States [doi>10.1145/28395.28420]
	GoMi84	Goldwasser# S. mid Micali, S. "Probabilistic Encryption." J. Comp. Sys. Sci. 28, (1984), 270-299.
	Kran86	Evangelos Kranakis, Primality and cryptography, John Wiley & Sons, Inc., New York, NY, 1986
	Merr83	Michael John Merritt, Cryptographic protocols, 1983
	Rabi83	Rabin# M. "Transaction Protection by Beacons." J. Comp. Sys. Sci. 27, 2 (Oct. 1983), 256-267.
	RaBO89	T. Rabin , M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.73-85, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73014]
	RAD78	Rivest, R., Adleman, L., and Dertouzos# M. "On Data Banks and Privacy Homomorphisms." Foundations of Secure Computation, ed. by R. A. DeMillo, et. al. Academic Press, New York, (1978), 169- 179.
	RSA78	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
	Sham79	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	Stra80	Strain, P. Topics in the Theory of Voting. Birkh~user, Boston, (1980).
	Yao82	Yao, A. "Protocols for Secure Computations." Proc. 23rd IEEE Syrup. on Foundations of Computer Science, Chicago, IL (Nov. 1982), 160-164.

CITED BY 27

	Olivier Baudron , Pierre-Alain Fouque , David Pointcheval , Jacques Stern , Guillaume Poupard, Practical multi-candidate election system, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.274-283, August 2001, Newport, Rhode Island, United States
	Shafi Goldwasser, Multi party computations: past and present, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.1-6, August 21-24, 1997, Santa Barbara, California, United States
	Johan Håstad , Jakob Jonsson , Ari Juels , Moti Yung, Funkspiel schemes: an alternative to conventional tamper resistance, Proceedings of the 7th ACM conference on Computer and communications security, p.125-133, November 01-04, 2000, Athens, Greece
	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
	Hung-Yu Chien , Jinn-Ke Jan , Yuh-Min Tseng, Cryptanalysis on Mu--Varadharajan's e-voting schemes, Applied Mathematics and Computation, v.139 n.2-3, p.525-530, 15 July 2003
	Chun-I Fan , Chin-Laung Lei, An unlinkably divisible and intention attachable ticket scheme for runoff elections, Journal of Network and Computer Applications, v.25 n.2, p.93-107, April 2002
	Alejandro Hevia , Marcos Kiwi, Electronic jury voting protocols, Theoretical Computer Science, v.321 n.1, p.73-94, June 16, 2004
	Changjie Wang , Ho-fung Leung, A secure voter-resolved approval voting protocol over internet, Proceedings of the 7th international conference on Electronic commerce, August 15-17, 2005, Xi'an, China
	Ari Juels , Dario Catalano , Markus Jakobsson, Coercion-resistant electronic elections, Proceedings of the 2005 ACM workshop on Privacy in the electronic society, November 07-07, 2005, Alexandria, VA, USA
	Véronique Cortier , Michael Rusinowitch , Eugen Zǎlinescu, A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.12-22, July 11-13, 2005, Lisbon, Portugal
	Lorrie Faith Cranor, Electronic voting: computerized polls may save money, protect privacy, Crossroads, v.2 n.4, p.12-16, Apr. 1996
	M. Burmester , E. Magkos , V. Chrissikopoulos, Uncoercible e-Bidding Games, Electronic Commerce Research, v.4 n.1-2, p.113-125, January-April 2004
	Josh Benaloh, Simple verifiable elections, Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop, p.5-5, August 01, 2006, Vancouver, B.C., Canada
	S. Mauw , J. Verschuren , E. P. de Vink, Data Anonymity in the FOO Voting Scheme, Electronic Notes in Theoretical Computer Science (ENTCS), 168, p.5-28, February, 2007
	José Luis Salazar , Joan Josep Piles , José Ruíz , José María Moreno-Jiménez, E-cognocracy and its voting process, Computer Standards & Interfaces, v.30 n.3, p.124-131, March, 2008
	A. Baskar , R. Ramanujam , S. P. Suresh, Knowledge-based modelling of voting protocols, Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge, June 25-27, 2007, Brussels, Belgium
	Josh Benaloh, Ballot casting assurance via voter-initiated poll station auditing, Proceedings of the USENIX/Accurate Electronic Voting Technology on USENIX/Accurate Electronic Voting Technology Workshop, p.14-14, August 06, 2007, Boston, MA
	Ben Riva , Amnon Ta-Shma, Bare-handed electronic voting with pre-processing, Proceedings of the USENIX/Accurate Electronic Voting Technology on USENIX/Accurate Electronic Voting Technology Workshop, p.15-15, August 06, 2007, Boston, MA
	André Zúquete , Filipe Almeida, Verifiable anonymous vote submission, Proceedings of the 2008 ACM symposium on Applied computing, March 16-20, 2008, Fortaleza, Ceara, Brazil
	Maryam Rajabzadeh Asaar , Javad Mohajeri , Mahmoud Salmasizadeh, Another security improvement over the Lin et al.'s electronic-voting scheme, International Journal of Electronic Security and Digital Forensics, v.1 n.4, p.413-422, November 2008
	Josh Benaloh, Administrative and public verifiability: can we have both?, Proceedings of the conference on Electronic voting technology, p.1-10, July 28-29, 2008, San Jose, CA
	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
	Tal Moran , Moni Naor, Split-ballot voting: everlasting privacy with distributed trust, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
	Hugo Jonker , Sjouke Mauw , Jun Pang, A formal framework for quantifying voter-controlled privacy, Journal of Algorithms, v.64 n.2-3, p.89-105, April, 2009
	Sharil Tumin , Sylvia Encheva, Web-based election system for small scale to medium scale academic societies, Proceedings of the 9th WSEAS international conference on Distance learning and web engineering, p.48-53, September 03-05, 2009, Budapest, Hungary
	Stéphanie Delaune , Steve Kremer , Mark Ryan, Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, v.17 n.4, p.435-487, December 2009
	Xuhua Ding , Gene Tsudik , Shouhuai Xu, Leak-free mediated group signatures, Journal of Computer Security, v.17 n.4, p.489-514, December 2009