Exploiting trust-based social networks for distributed protection of sensitive data

IEEE Transactions on Information Forensics and Security

Volumn 6, Issue 1, 2011, Pages 39-52

  Xu, Shouhuai ^a   Li, Xiaohu ^a   Parker, Timothy Paul ^a   Wang, Xueping ^b  

^a Science Building   (United States)

^b FUDAN UNIVERSITY   (China)

Author keywords

Anonymity; availability; complex system; security; social network; social trust; threshold cryptography

Indexed keywords

ANONYMITY; COMPLEX SYSTEM; SECURITY; SOCIAL NETWORKS; SOCIAL TRUST; THRESHOLD CRYPTOGRAPHY;

CRYPTOGRAPHY; LARGE SCALE SYSTEMS; SOCIAL NETWORKING (ONLINE);

NETWORK SECURITY;

EID: 79951837447     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2010.2093521     Document Type: Article

References (33)

1. R. Albert and A. Barabasi, "Statistical mechanics of complex net-works," Rev. Modern Phys., vol. 74, pp. 47-97, 2002.
2. R. Albert, H. Jeong, and A. Barabasi, "Error and attack tolerance of complex networks," Nature, vol. 406, pp. 378-482, 2000.
3. N. Alon, "Spectral techniques in graph algorithms," in Proc. LATIN'98, 1998, pp. 206-215. (Pubitemid 128056278)
4. I. Clarke, O. Sandberg, B. Wiley, and T. Hong, "Freenet: A distributed anonymous information storage and retrieval system," Lecture Notes in Computer Science, vol. 2009, pp. 46-66, 2001. (Pubitemid 33241787)
5. J. Douceur, "The sybil attack," in Proc. First Int. Workshop on Peer-toPeer Systems (IPTPS'01), 2002, pp. 251-260.
6. B. Ford, J. Strauss, C. Lesniewski-Laas, S. Rhea, F. Kaashoek, and R. Morris, "Persistent personal names for globally connected mobile devices," in Proc. 7th Symp. Operating Systems Design and Implementation (OSDI'06), 2006, pp. 233-248.
7. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, "Robust threshold dss signatures," in Proc. EUROCRYPT'96, 1996, pp. 354-371 (Pubitemid 126071079)
8. O.Goldreich, The Foundations of Cryptography. Cambridge,U.K.: Cambridge Univ. Press, 2001, vol. 1.
9. S. Goldwasser, S. Micali, and R. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks," SIAMJ. Computing, vol. 17, no. 2, pp. 281-308, Apr. 1988.
10. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, "Proactive public key and signature schemes," in Proc. ACM Conf. Computerand Communications Security, 1997,pp. 100-110.
11. KDL, Computer Science Bibliography and Citation Network [Online]. Available: http://kdl.cs.umass.edu/data/index.html
12. M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard, "A cooperative internet backup scheme," in Proc. USENIX Annual Technical Conf. (ATC'03), 2003, pp. 29-41.
13. P. Mac Kenzie and M. Reiter, "Networked cryptographic devices resilient to capture," in Proc. IEEE Symp. Security and Privacy, 2001, pp. 12-25. (Pubitemid 32882623)
14. P. Mac Kenzieand M. Reiter,"Two-party generation of dsasignatures," inProc CRYPTO2001, 2001, pp. 137-154, Springer-Verlag.
15. K. Martin, J. Pieprzyk, R. Safavi-Naini, H. Wang, and P. Wild, "Threshold macs," in Proc. 5th Int. Conf. Information Security and Cryptology (ICISC'02), 2002, pp. 237-252, Springer. (Pubitemid 36316803)
16. A. Mislove, M. Marcon, P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Proc. Internet Meas. Comf., 2007, pp. 29-42.
17. A. Mislove, A. Post, P. Druschel, and K. Gummadi, "Ostra: Leveraging trust to thwart unwanted communication," in Proc. 5th USENIXSymp. Networked Systems Design and Implementation (NSDI'08), 2008, pp. 15-30.
18. Digital Signature Standard, FIPS Publication 186, National Institute of Standards and Technology (NIST), May 19, 1994.
19. A. Nicolosi, M. Krohn, Y. Dodis, and D. Mazières, "Proactive twoparty signatures for user authentication," in Proc. Network and Distributed System Security (NDSS'03), San Diego, CA, 2003.
20. B. Popescu, B. Crispo, and A. Tanenbaum, "Safe and private data sharing with turtle: Friends team-up and beat the system," in Proc. Security Protocols Workshop, 2004, pp. 213-220.
21. T. Rabin, "A simplified approach to threshold and proactive RSA," in Proc. CRYPTO'98, 1998, pp. 89-104, Springer. (Pubitemid 128118999)
22. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol. 21, no. 2, pp. 120-126, 1978. (Pubitemid 8591219)
23. S. Ross, Stochastic Processes, ser. Wiley Series in Probability and Mathematical Statistics. Hoboken, NJ: Wiley, 1996.
24. C. P. Schnorr, "Efficient signature generation by smart cards," J. Cryptology, vol. 4, pp. 161-174, 1991.
25. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, pp. 612-613, Nov. 1979.
26. D. Stutzbach and R. Rejaie, "Understanding churn in peer-to-peer networks," in Proc. 6th ACM SIGCOMM Conf. Internet Measurement (IMC'06), 2006, pp. 189-202. (Pubitemid 47165601)
27. TCG [Online]. Available: https://www.trustedcomputinggroup.org/
28. S. Xu, X. Li, and P. Parker, "Exploiting social networks for threshold signing: Attack-resilience vs. availability," in Proc. ACMSymp. Information, Computerand Communications Security(ASIACCS'08),2008, pp. 325-336.
29. S. Xu and R. Sandhu, "Two efficient and provably secure schemes for server-assisted threshold signatures," in Proc. Topics in Cryptology (CT-RSA 2003), 2003, pp. 355-372.
30. S. Xu and M. Yung, "Socialclouds: Concept, security architecture and some mechanisms," in Proc. First Int. Conf. Trusted Systems (INTRUST'09), 2009, pp. 104-128.
31. B. Yee, "Using Secure Coprocessors," Ph.D. thesis, Carnegie Mellon Univ., Pittsburgh, PA, 1994.
32. H. Yu, P. Gibbons, M. Kaminsky, and F. Xiao, "Sybillimit: A nearoptimal social network defense against sybil attacks," in Proc. IEEE Symp. Security and Privacy, 2008, pp. 3-17.
33. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman, "Sybilguard: Defending against sybil attacks via social networks," in Proc. ACMSIGCOMM 2006, 2006, pp. 267-278. (Pubitemid 44623733)