Do i know you? - Efficient and privacy-preserving common friend-finder protocols and applications

ACM International Conference Proceeding Series

Volumn , Issue , 2013, Pages 159-168

  Nagy, Marcin ^a   De Cristofaro, Emiliano ^b   Dmitrienko, Alexandra ^c   Asokan, N ^a,d   Sadeghi, Ahmad Reza ^e  

^a AALTO UNIVERSITY   (Finland)

^b PARC (A Xerox Company)   (United States)

^c CASED ^*  (Germany)

^d UNIVERSITY OF HELSINKI   (Finland)

^e DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Access control; Privacy enhancing technologies; Social networks

Indexed keywords

ACCESS CONTROL DECISIONS; COMMUNICATION OVERHEADS; EXPERIMENTAL EVALUATION; GENERIC CONSTRUCTION; ONLINE SOCIAL NETWORKS (OSNS); PRIVACY ENHANCING TECHNOLOGIES; PRIVACY PRESERVING; SOCIAL RELATIONSHIPS;

ACCESS CONTROL; DATA PRIVACY; ONLINE SYSTEMS; SECURITY SYSTEMS; SOCIAL NETWORKING (ONLINE);

APPLICATION PROGRAMS;

EID: 84893320391     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2523649.2523668     Document Type: Conference Paper

References (53)

1. Bandwagon. http://bandwagon.io.
2. Sidecar - My ride is your ride. http://side.cr/.
3. Zoosk. http://zoosk.com.
4. AGRAWAL, R., EVFIMIEVSKI, A., and SRIKANT, R. Information sharing across private databases. In SIGMOD (2003).
5. ASOKAN, N., DMITRIENKO, A., NAGY, M., RESHETOVA, E., SADEGHI, A.-R., SCHNEIDER, T., AND STELLE, S. Crowdshare: Secure mobile resource sharing. In ACNS (2013).
6. BALFANZ, D., DURFEE, G., SHANKAR, N., SMETTERS, D. K., STADDON, J., and WONG, H.-C. Secret Handshakes from Pairing-Based Key Agreements. In S&P (2003).
7. BELLARE, M. New proofs for NMAC and HMAC: Security without collision-resistance. In CRYPTO (2006).
8. BELLARE, M., NAMPREMPRE, C., POINTCHEVAL, D., and SEMANKO, M. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. Journal of Cryptology 16, 3 (2003).
9. BELLOVIN, S. M., and CHESWICK, W. R. Privacy-Enhanced Searches Using Encrypted Bloom Filters. Tech. Rep. CUCS-034-07, Columbia University and AT&T, 2004. https://mice.cs.columbia.edu/getTechreport.php?techreportID=483.
10. BLOOM, B. H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 7 (1970).
11. CAMENISCH, J., and ZAVERUCHA, G. Private intersection of certified sets. In Financial Cryptography (2009).
12. CARTER, H., AMRUTKAR, C., DACOSTA, I., and TRAYNOR, P. For your phone only: custom protocols for efficient secure function evaluation on mobile devices. Security and Communication Networks (2013).
13. DANEZIS, G., and MITTAL, P. Sybilinfer: Detecting Sybil Nodes using Social Networks. In NDSS (2009).
14. DE CRISTOFARO, E., GASTI, P., and TSUDIK, G. Fast and Private Computation of Cardinality of Set Intersection and Union. In CANS (2012).
15. DE CRISTOFARO, E., KIM, J., and TSUDIK, G. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In ASIACRYPT (2010).
16. DE CRISTOFARO, E., MANULIS, M., and POETTERING, B. Private Discovery of Common Social Contacts. In ACNS (2011).
17. DE CRISTOFARO, E., and TSUDIK, G. Practical Private Set Intersection Protocols with Linear Complexity. In Financial Cryptography (2010).
18. DE CRISTOFARO, E., and TSUDIK, G. Experimenting with Fast Private Set Intersection. In TRUST (2012).
19. DONG, W., DAVE, V., QIU, L., and ZHANG, Y. Secure friend discovery in mobile social networks. In INFOCOM (2011).
20. EPPSTEIN, D., and GOODRICH., M. T., and BALDI, P. Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. http://arxiv.org/abs/1107.3593, 2011.
21. FISCHLIN, M., PINKAS, B., SADEGHI, A.-R., SCHNEIDER, T., and VISCONTI, I. Secure Set Intersection with Untrusted Hardware Tokens. In CT-RSA (2011).
22. FORT, M., and FREILING., F. C., PENSO, L. D., BENENSON, Z., and KESDOGAN, D. TrustedPals: Secure Multiparty Computation Implemented with Smart Cards. In ESORICS (2006).
23. FREEDMAN, M. J., NISSIM, K., and PINKAS, B. Efficient Private Matching and Set Intersection. In EUROCRYPT (2004).
24. HARDT, D. The OAuth 2.0 authorization framework. RFC 6749, RFC Editor, 2012.
25. HAZAY, C., and LINDELL, Y. Constructions of truly practical secure protocols using standard smartcards. In CCS (2008).
26. HAZAY, C., and LINDELL, Y. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In TCC (2008).
27. HOHENBERGER, S., and WEIS, S. Honest-Verifier Private Disjointness Testing Without Random Oracles. In PETS (2006).
28. HUANG, Y., CHAPMAN, E., and EVANS, D. Privacy-preserving applications on smartphones. In HotSec (2011).
29. HUANG, Y., EVANS, D., and KATZ, J. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? In NDSS (2012).
30. ILIEV, A., and SMITH, S. More Efficient Secure Function Evaluation Using Tiny Trusted Third Parties. Tech. Rep. TR2005-551, Dartmouth College, 2005.
31. IOANNIDIS, I., GRAMA, A., and ATALLAH, M. A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. In ICPP (2002).
32. JARECKI, S., and LIU, X. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. In TCC (2009).
33. JARECKI, S., and LIU, X. Fast Secure Computation of Set Intersection. In SCN (2010).
34. JÄRVINEN, K., KOLESNIKOV, V., SADEGHI, A.-R., and SCHNEIDER, T. Embedded SFE: Offloading Server and Network Using Hardware Tokens. In Financial Cryptography (2010).
35. JOHNSON, A., SYVERSON, P., DINGLEDINE, R., and MATHEWSON, N. Trust-based anonymous communication: Adversary models and routing algorithms. In CCS (2011).
36. KERSCHBAUM, F. Public-key encrypted bloom filters with applications to supply chain integrity. In CODASPY (2011).
37. KISSNER, L., and SONG, D. X. Privacy-Preserving Set Operations. In CRYPTO (2005).
38. KOSTIAINEN, K., RESHETOVA, E., EKBERG, J.-E., and ASOKAN, N. Old, new, borrowed, blue - a perspective on the evolution of mobile platform security architectures. In CODASPY (2011).
39. LI, M., CAO, N., YU, S., and LOU, W. FindU: Privacy-preserving personal profile matching in mobile social networks. In INFOCOM (2011).
40. MANULIS, M., PINKAS, B., and POETTERING, B. Privacy-Preserving Group Discovery with Linear Complexity. In ACNS (2010).
41. MITTAL, P., WRIGHT, M., and BORISOV, N. Pisces: Anonymous Communication Using Social Networks. In NDSS (2013).
42. MOHAISEN, A., TRAN, H., CHANDRA, A., and KIM, Y. Trustworthy distributed computing on social networks. In ASIACCS (2013).
43. NAGY, M., ASOKAN, N., and OTT, J. PeerShare: A System Secure Distribution of Sensitive Data Among Social Contacts. In NordSec (2013).
44. NIST. http://www.nsa.gov/ia/-files/nist-routines.pdf.
45. NORCIE, G., DE CRISTOFARO, E., and BELLOTTI, V. Bootstrapping Trust in Online Dating: Social Verification of Online Dating Profiles. In USEC (2013).
46. RANTALA, E., KARPPANEN, A., GRANLUND, S., and SAROLAHTI, P. Modeling energy efficiency in wireless Internet communication. In MobiHeld (2009).
47. RECORDON, D., and REED, D. OpenID 2.0: a platform for user-centric identity management. In DIM (2006).
48. TANENBAUM ET AL., A. S. Using Sparse Capabilities in a Distributed Operating System. In ICDCS (1986).
49. THIAGARAJAN, N., AGGARWAL, G., NICOARA, A., BONEH, D., and SINGH, J. P. Who killed my battery?: Analyzing mobile browser energy consumption. In WWW (2012).
50. VON ARB, M., BADER, M., KUHN, M., and WATTENHOFER, R. VENETA: Serverless friend-of-friend detection in mobile social networking. In WiMob (2008).
51. YAO, A. C. How to Generate and Exchange Secrets. In FOCS (1986), pp. 162-167.
52. ZHANG, L., and LI, X.-Y. Message in a Sealed Bottle: Privacy Preserving Friending in Social Networks. http://arxiv.org/abs/1207.7199, 2012.
53. ZHANG, R., ZHANG, Y., SUN, J., and YAN, G. Fine-grained private matching for proximity-based mobile social networking. In INFOCOM (2012).