메뉴 건너뛰기




Volumn 40, Issue 6, 2010, Pages 682-689

Secure collaborative social networks

Author keywords

Privacy; security; social networks

Indexed keywords

CONSTRUCTION PROCESS; DATA COLLECTION; MATHEMATICAL ANALYSIS; NETWORK PROBLEMS; PRIVACY; PRIVACY PRESERVING; SECURITY; SOCIAL NETWORKS;

EID: 77958151338     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2010.2050879     Document Type: Article
Times cited : (24)

References (24)
  • 1
    • 20444434710 scopus 로고    scopus 로고
    • How to search a social network
    • L. Adamic and E. Adar, "How to search a social network," Soc. Netw., vol.27, no.3, pp. 187-203, 2005.
    • (2005) Soc. Netw. , vol.27 , Issue.3 , pp. 187-203
    • Adamic, L.1    Adar, E.2
  • 3
    • 77958154086 scopus 로고    scopus 로고
    • Privacy preserving grapevines: Capturing social network interactions using delegatable anonymous credentials
    • Georgia Inst. Technol., Arlington, VA, Tech. Rep. GT-CS- 09-12
    • V. Balasubramaniyan, Y. Lee, and M. Ahamad, "Privacy preserving grapevines: Capturing social network interactions using delegatable anonymous credentials," School Comput. Sci., Georgia Inst. Technol., Arlington, VA, Tech. Rep. GT-CS-09-12, 2009.
    • (2009) School Comput. Sci.
    • Balasubramaniyan, V.1    Lee, Y.2    Ahamad, M.3
  • 4
    • 45849131271 scopus 로고    scopus 로고
    • Privacy-preserving social networks
    • presented at the , Busan, Korea Apr. 24-26
    • G. Blosser and J. Zhan, "Privacy-preserving social networks," presented at the IEEE Int. Conf. Inf. Secur. Assur. (ISA), Busan, Korea, Apr. 24-26, 2008.
    • (2008) IEEE Int. Conf. Inf. Secur. Assur. (ISA)
    • Blosser, G.1    Zhan, J.2
  • 5
    • 0022145479 scopus 로고
    • Security without identification
    • Oct.
    • D. Chaum, "Security without identification," Commun. ACM, vol.28, no.10, pp. 1030-1044, Oct. 1985.
    • (1985) Commun. ACM , vol.28 , Issue.10 , pp. 1030-1044
    • Chaum, D.1
  • 10
    • 85050160774 scopus 로고
    • Probabilistic encryption and how to play mental poker keeping secret all partial information
    • San Francisco, CA
    • S. Goldwasser and S. Micali, "Probabilistic encryption and how to play mental poker keeping secret all partial information," in Proc. Annu. ACM Symp. Theory Comput. Arch., San Francisco, CA, 1982, pp. 365-377.
    • (1982) Proc. Annu. ACM Symp. Theory Comput. Arch. , pp. 365-377
    • Goldwasser, S.1    Micali, S.2
  • 12
    • 41849128290 scopus 로고    scopus 로고
    • Anonymizing social networks
    • Univ. Massachusetts, Amherst,MA, Tech. Rep. 07-19 Mar.
    • M. Hay, G. Miklau, and D. Jensen, "Anonymizing social networks," Dept. Comput. Sci., Univ. Massachusetts, Amherst,MA, Tech. Rep. 07-19, Mar. 2007.
    • (2007) Dept. Comput. Sci.
    • Hay, M.1    Miklau, G.2    Jensen, D.3
  • 14
    • 74049112106 scopus 로고    scopus 로고
    • Privacy preserving in social networks against sensitive edge-disclosure
    • Univ. Kentucky, Lexington, KY, Tech. Rep. CMIDA-HiPSCCS006-08
    • L. Liu, J. Wang, J. Liu, and J. Zhang, "Privacy preserving in social networks against sensitive edge-disclosure," Dept. Comput. Sci., Univ. Kentucky, Lexington, KY, Tech. Rep. CMIDA-HiPSCCS006-08, 2008.
    • (2008) Dept. Comput. Sci.
    • Liu, L.1    Wang, J.2    Liu, J.3    Zhang, J.4
  • 15
    • 67649644344 scopus 로고    scopus 로고
    • On protecting private information in social networks: A proposal
    • B. Luo and D. Lee, "On protecting private information in social networks: A proposal," in Proc. IEEE Int. Conf. Data Eng., 2009, pp. 1603-1606.
    • (2009) Proc. IEEE Int. Conf. Data Eng. , pp. 1603-1606
    • Luo, B.1    Lee, D.2
  • 17
    • 84942550998 scopus 로고    scopus 로고
    • Public-key cryptosystems based on composite degree residuosity classes
    • Prague, Czech Republic
    • P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Proc. Adv. Cryptography (EUROCRYPT), Prague, Czech Republic, 1999, pp. 223-238.
    • (1999) Proc. Adv. Cryptography (EUROCRYPT) , pp. 223-238
    • Paillier, P.1
  • 18
    • 0005301490 scopus 로고
    • On data banks and privacy homomorphisms
    • R. A. DeMillo et al., Eds. San Francisco, CA: Academic
    • R. A. DeMillo, R. Rivest, L. Adleman, and M. Dertouzos, "On data banks and privacy homomorphisms," in Proc. Foundations Secure Comput. R. A. DeMillo et al., Eds. San Francisco, CA: Academic, 1978, pp. 169-179.
    • (1978) Proc. Foundations Secure Comput. , pp. 169-179
    • Demillo, R.A.1    Rivest, R.2    Adleman, L.3    Dertouzos, M.4
  • 19
    • 46749097224 scopus 로고    scopus 로고
    • Measuring topological anonymity in social networks
    • presented at the , SiliconValley, CA, Nov. 2-4
    • L. Singh and J. Zhan, "Measuring topological anonymity in social networks," presented at the IEEE Int. Conf.Granular Comput., SiliconValley, CA, Nov. 2-4, 2007.
    • (2007) IEEE Int. Conf.Granular Comput.
    • Singh, L.1    Zhan, J.2
  • 20
    • 34250696941 scopus 로고    scopus 로고
    • Privacy protection in social network data disclosure based on granular computing
    • presented at the Vancouver, BC, Canada Jul. 16-21
    • D. Wang, C. Liau, and T. Hsu, "Privacy protection in social network data disclosure based on granular computing," presented at the IEEE Int. Conf. Fuzzy Syst., Vancouver, BC, Canada, Jul. 16-21, 2006.
    • (2006) IEEE Int. Conf. Fuzzy Syst.
    • Wang, D.1    Liau, C.2    Hsu, T.3
  • 24
    • 52649120205 scopus 로고    scopus 로고
    • Preserving privacy in social networks against neighborhood attacks
    • presented at the , Canćuun, Méexico Apr. 7-12
    • B. Zhou and J. Pei, "Preserving privacy in social networks against neighborhood attacks," presented at the 24th Int. Conf. Data Eng. (ICDE), Canćuun, Méexico, Apr. 7-12, 2008.
    • (2008) 24th Int. Conf. Data Eng. (ICDE)
    • Zhou, B.1    Pei, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.