Applications of secure electronic voting to automated privacy-preserving troubleshooting

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Applications of secure electronic voting to automated privacy-preserving troubleshooting

Full text

Pdf (238 KB)

Source

Conference on Computer and Communications Security archive
Proceedings of the 12th ACM conference on Computer and communications security table of contents

Alexandria, VA, USA

SESSION: Privacy and anonymity table of contents

Pages: 68 - 80

Year of Publication: 2005

ISBN:1-59593-226-7

Authors

Qiang Huang	Princeton University, Princeton, NJ
David Jao	Microsoft Research
Helen J. Wang	Microsoft Research

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 76, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	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/1102120.1102132 What is a DOI?

ABSTRACT

Recent work [27, 15] introduced a novel peer-to-peer application that leverages content sharing and aggregation among the peers to diagnose misconfigurations on a desktop PC. This application poses interesting challenges in preserving privacy of user configuration data and in maintaining integrity of troubleshooting results. In this paper, we provide a much more rigorous cryptographic and yet practical solution for preserving privacy, and we investigate and analyze solutions for ensuring integrity.

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.

	1	Rakesh Agrawal , Ramakrishnan Srikant, Privacy-preserving data mining, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.439-450, May 15-18, 2000, Dallas, Texas, United States
	2	Josh Daniel Cohen Benaloh, Verifiable secret-ballot elections, 1987
	3	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]
	4	John Canny, Collaborative Filtering with Privacy, Proceedings of the 2002 IEEE Symposium on Security and Privacy, p.45, May 12-15, 2002
	5	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]
	6	David Chaum , Torben P. Pedersen, Wallet Databases with Observers, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.89-105, August 16-20, 1992
	7	Ian Clarke , Oskar Sandberg , Brandon Wiley , Theodore W. Hong, Freenet: a distributed anonymous information storage and retrieval system, International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability, p.46-66, January 2001, Berkeley, California, United States
	8	Lillie Coney , Joseph L. Hall , Poorvi L. Vora , David Wagner, Towards a privacy measurement criterion for voting systems, Proceedings of the 2005 national conference on Digital government research, May 15-18, 2005, Atlanta, Georgia
	9	R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology --- Eurocrypt '97, LNCS 1233, pp. 103--118, 1997.
	10	Ronald Cramer , Ivan Damgård , Berry Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.174-187, August 21-25, 1994
	11	Amos Fiat , Adi Shamir, How to prove yourself: practical solutions to identification and signature problems, Proceedings on Advances in cryptology---CRYPTO '86, p.186-194, January 1987, Santa Barbara, California, United States
	12	Michael J. Freedman , Emil Sit , Josh Cates , Robert Morris, Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer, Revised Papers from the First International Workshop on Peer-to-Peer Systems, p.121-129, March 07-08, 2002
	13	Atsushi Fujioka , Tatsuaki Okamoto , Kazuo Ohta, A Practical Secret Voting Scheme for Large Scale Elections, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.244-251, December 13-16, 1992
	14	David Goldschlag , Michael Reed , Paul Syverson, Onion routing, Communications of the ACM, v.42 n.2, p.39-41, Feb. 1999 [doi>10.1145/293411.293443]
	15	Q. Huang, H. J. Wang, and N. Borisov. Privacy-Preserving Friends Troubleshooting Network. ISOC NDSS 2005, San Diego, CA.
	16	Markus Jakobsson , Ari Juels , Ronald L. Rivest, Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking, Proceedings of the 11th USENIX Security Symposium, p.339-353, August 05-09, 2002
	17	Jonathan Katz , Steven Myers , Rafail Ostrovsky, Cryptographic Counters and Applications to Electronic Voting, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.78-92, May 06-10, 2001
	18	L. Kissner and D. Song. Privacy-Preserving Set Operations. In Advances in Cryptology --- Crypto 2005, LNCS 3621, 2005.
	19	N. Koblitz. Elliptic curve cryptosystems. Math. Comp. 48 (1987), pp. 203--209.
	20	A. Lenstra and E. Verheul. Selecting Cryptographic Key Sizes. J. Cryptology 14 (2001), no. 4, pp. 255-293.
	21	T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology --- Eurocrypt '91, LNCS 547, pp. 522-526, 1991.
	22	Bartosz Przydatek , Dawn Song , Adrian Perrig, SIA: secure information aggregation in sensor networks, Proceedings of the 1st international conference on Embedded networked sensor systems, November 05-07, 2003, Los Angeles, California, USA [doi>10.1145/958491.958521]
	23	Michael K. Reiter , Aviel D. Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security (TISSEC), v.1 n.1, p.66-92, Nov. 1998 [doi>10.1145/290163.290168]
	24	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]
	25	C. E. Shannon. A Mathematical Theory Of Communication. Bell System Tech. J. 27 (1948), pp. 379-423, 623-656.
	26	David Wagner, Resilient aggregation in sensor networks, Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, October 25-25, 2004, Washington DC, USA [doi>10.1145/1029102.1029116]
	27	H. J. Wang, Y. C. Hu, C. Yuan, Z. Zhang, and Y. M. Wang. Friends Troubleshooting Network: Towards Privacy-Preserving, Automatic Troubleshooting. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
	28	H. J. Wang, J. Platt, Y. Chen, R. Zhang, and Y. M. Wang. Automatic Misconfiguration Troubleshooting with PeerPressure. In Proceedings of OSDI 2004.