메뉴 건너뛰기




Volumn , Issue , 2012, Pages 325-336

Defending against large-scale crawls in online social networks

Author keywords

Network based Sybil defense; Social networks; Sybil attacks

Indexed keywords

BLACK MARKET; BROWSING PATTERNS; FACEBOOK; NETWORK-BASED; ONLINE SOCIAL NETWORKS; PERSONAL INFORMATION; RATE LIMITING; REAL WORLD DATA; SOCIAL NETWORKS; SYBIL ATTACK; USER PROFILE;

EID: 84871989753     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2413176.2413214     Document Type: Conference Paper
Times cited : (22)

References (54)
  • 13
    • 0000891810 scopus 로고
    • An algorithm for the solution of the max-flow problem with the polynomial estimation
    • E. A. Dinic. An algorithm for the solution of the max-flow problem with the polynomial estimation. Doklady Akademii Nauk SSSR, 1970.
    • (1970) Doklady Akademii Nauk SSSR
    • Dinic, E.A.1
  • 39
    • 84871997527 scopus 로고    scopus 로고
    • Renren. http://www.renren.com.
  • 46
    • 84871639928 scopus 로고    scopus 로고
    • Twitter rate limiting. https://dev.twitter.com/docs/rate-limiting- faq#measurement.
    • Twitter Rate Limiting


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