Applications of secure electronic voting to automated privacy-preserving troubleshooting

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2005, Pages 68-80

  Huang, Qiang ^a   Jao, David ^b   Wang, Helen J ^b  

^a PRINCETON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Automatic Troubleshooting; Homomorphic Encryption; Integrity; Privacy; Zero Knowledge Proof

Indexed keywords

DATA PROCESSING; DISTRIBUTED DATABASE SYSTEMS; PERSONAL COMPUTERS; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

AUTOMATIC TROUBLESHOOTING; HOMOMORPHIC ENCRYPTION; INTEGRITY; PRIVACY; TROUBLESHOOTING; ZERO KNOWLEDGE PROOF;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 33745790656     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102120.1102132     Document Type: Conference Paper

References (28)

1. R. Agrawal and R. Srikant. Privacy Preserving Data Mining. In Proceedings of SIGMOD, 2000.
2. J. Benaloh, Verifiable Secret Ballot Elections. Ph.D thesis, Yale University, 1987.
3. J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. In Proc. 5th ACM Symposium on Principles of Distributed Computing (PODC '86), pp. 52-62, New York, 1986.
4. J. Canny. Collaborative Filtering with Privacy. In IEEE Security and Privacy, 2002.
5. D. Chaum. Untraceable electronic mail, return addesses, and digital pseudonyms. Communications of the ACM, 24(2), pp. 84-88, 1981.
6. D. Chaum and T. Pedersen. Wallet databases with observers. In Advances in Cryptology - Crypto '92, LNCS 740, pp. 89-105, 1993.
7. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proc. International Workshop on Design Issues in Anonymity and Unobservability, 2001.
8. L. Coney, J. L. Hall, P. L. Vora, D. Wagner. Towards a Privacy Measurement Criterion for Voting Systems. Poster Paper, National Conference on Digital Government Research, May 2005.
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. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - Crypto '94, LNCS 839, pp. 174-187, 1994.
11. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - Crypto '86, LNCS 283, pp. 186-194, 1987.
12. M. J. Freedman, E. Sit, J. Gates, and R. Morris. Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer. In IPTPS, 2002.
13. T. Fujioka, T. Okamoto, and K. Ohta. A Practical Secret Voting Scheme for Large Scale Elections. In Proceedings of Auscrypt, Dec. 1992.
14. D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Onion Routing for Anonymous and Private Internet Connections. In CACM, Feb 1999.
15. Q. Huang, H. J. Wang, and N. Borisov. Privacy-Preserving Friends Troubleshooting Network. ISOC NDSS 2005, San Diego, CA.
16. M. Jakobsson, A. Juels, and R. Rivest. Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In Proceedings of the 11th USENIX Security Symposium, pp. 339-353, 2004.
17. J. Katz, S. Myers, and R. Ostrovsky. Cryptographic Counters and Applications to Electronic Voting. In Advances in Cryptology -Eurocrypt 2001, LNCS 2045, pp. 78-92, 2001.
18. L. Kissner and D. Song. Privacy-Preserving Set Operations. In Advances in Cryptology - Crypto 2005, LNCS 3821, 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. B. Przydatek, D. Song, and A. Perrig. SIA: Secure Information Aggregation in Sensor Networks. In Proceedings of ACM SenSys, Nov 2003.
23. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. In ACM Transactions on Information and System Security, Nov 1998.
24. A. Shamir. How to share a secret. Comm. ACM 22 (1979), no. 11, pp. 612-613.
25. C. E. Shannon. A Mathematical Theory Of Communication. Bell System Tech. J. 27 (1948), pp. 379-423, 623-656.
26. D. Wagner. Resilient Aggregation in Sensor Networks. In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN '04), Oct. 2004.
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.