Collaborative, privacy-preserving data aggregation at scale

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

Volumn 6205 LNCS, Issue , 2010, Pages 56-74

  Applebaum, Benny ^a   Ringberg, Haakon ^b   Freedman, Michael J ^b   Caesar, Matthew ^c   Rexford, Jennifer ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c UIUC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESOURCES; CRYPTOGRAPHIC PROTOCOLS; DATA AGGREGATION; EVALUATION FUNCTION; IP ADDRESSS; MALICIOUS ATTACK; PRACTICAL SOLUTIONS; PRIVACY PRESERVING; PROTOTYPE IMPLEMENTATIONS;

CRYPTOGRAPHY; INTERNET PROTOCOLS; SOFTWARE PROTOTYPING;

DATA PRIVACY;

EID: 77955452807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14527-8_4     Document Type: Conference Paper

References (42)

1. Alexa the Web Information Company (2010), http://www.alexa.com/
2. Allman, M., Blanton, E., Paxson, V., Shenker, S.: Fighting coordinated attackers with crossorganizational information sharing. In: HotNets (November 2006)
3. Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: A system for secure multi-party computation. In: CCS (October 2008)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC (1988)
5. Bogetoft, P., Christensen, D. L., Damgard, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325-343. Springer, Heidelberg (2009)
6. Burrows, M.: The Chubby lock service for loosely-coupled distributed systems. In: OSDI (November 2006)
7. Chaum, D., Crépeau, C., Damgård, I. B.: Multiparty unconditionally secure protocols. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 462-462. Springer, Heidelberg (1988)
8. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. J. ACM 45 (6) (November 1998)
9. Cramer, R., Damgård, I.: On the amortized complexity of zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 177-191. Springer, Heidelberg (2009)
10. Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 125-142. Springer, Heidelberg (2009)
11. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: USENIX Technical (August 2004)
12. Douceur, J. R.: The Sybil attack. In: Druschel, P., Kaashoek, M. F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)
13. Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Comm. ACM 39 (5) (1996)
14. Franklin, M. K., Reiter, M. K.: Fair exchange with a semi-trusted third party (extended abstract). In: CCS (April 1997)
15. Freedman, M. J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303-324. Springer, Heidelberg (2005)
16. Freedman, M. J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J. L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
17. Friend-of-a-Friend Project (2009), http://www.foaf-project.org/
18. Garriss, S., Kaminsky, M., Freedman, M. J., Karp, B., Mazières, D., Yu, H.: Re: Reliable email. In: NSDI (May 2006)
19. Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)
20. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game (extended abstract). In: STOC (May 1987)
21. Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS 28 (1984)
22. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Computing 18 (1989)
23. Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155-175. Springer, Heidelberg (2008)
24. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
25. Jung, J., Sit, E., Balakrishnan, H., Morris, R.: DNS performance and the effectiveness of caching. IEEE/ACM Trans. Networking 10 (5) (October 2002)
26. Kissner, L., Song, D.: Privacy preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241-257. Springer, Heidelberg (2005)
27. Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 36. Springer, Heidelberg (2000)
28. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: A secure two-party computation system. In: USENIX Security (August 2004)
29. Mao, Z., Sekar, V., Spatscheck, O., van der Merwe, J., Vasudevan, R.: Analyzing large DDoS attacks using multiple data sources. In: SIGCOMM LSAD (September 2006)
30. Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC (May 1999)
31. Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 573. Springer, Heidelberg (1999)
32. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA (January 2001)
33. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudorandom functions. In: FOCS (October 1997)
34. Poole, L., Pai, V. S.: ConfiDNS: Leveraging scale and history to improve DNS security. In: WORLDS (November 2006)
35. Privacy Rights Clearinghouse. A chronology of data breaches (January 2009), http://www.privacyrights.org/ar/ChronDataBreaches.htm
36. Rabin, M.: How to exchange secrets by oblivious transfer. Tech. Rep. TR-81, Harvard Aiken Computation Lab. (1981)
37. Rajab, M. A., Zarfoss, J., Monrose, F., Terzis, A.: My botnet is bigger than yours (maybe, better than yours) : Why size estimates remain challenging. In: HotBots (April 2007)
38. Ramachandran, A., Feamster, N.: Understanding the network-level behavior of spammers. In: SIGCOMM (September 2006)
39. Ringberg, H., Soule, A., and Caesar, M. Evaluating the potential of collaborative anomaly detection (2008) (manuscript)
40. Schechter, S., Jung, J., Stockwell, W., McLain, C.: Inoculating SSH against address harvesting. In: NDSS (Feburary 2006)
41. Wendlandt, D., Andersen, D. G., Perrig, A.: Perspectives: Improving SSH-style host authentication with multi-path probing. In: USENIX Technical (June 2008)
42. Yao, A. C.: Protocols for secure computations. In: FOCS (November 1982)