메뉴 건너뛰기




Volumn 35, Issue 1, 2012, Pages 62-74

Privacy-enhanced social-network routing

Author keywords

Opportunistic networks; Privacy; Social networks; Social network routing

Indexed keywords

COMPLEMENTARY METHODS; DELIVERY COSTS; MOBILE NODES; OPPORTUNISTIC NETWORKS; PRIVACY CONCERNS; PRIVACY RISKS; REAL-WORLD DATASETS; ROUTE MESSAGES; ROUTING DECISIONS; ROUTING PERFORMANCE; SOCIAL NETWORKS; SOCIAL-NETWORK ROUTING; STORE-AND-FORWARD ARCHITECTURE; THREAT ANALYSIS;

EID: 81255142215     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2010.11.003     Document Type: Article
Times cited : (41)

References (38)
  • 4
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic Routing for Partially-Connected Ad Hoc Networks
    • Duke University (Apr. 2000)
    • A. Vahdat, D. Becker, Epidemic Routing for Partially-Connected Ad Hoc Networks, Tech. Rep. CS-200006, Duke University (Apr. 2000). URL http://issg.cs.duke.edu/epidemic/epidemic.pdf
    • Tech. Rep. CS-200006
    • Vahdat, A.1    Becker, D.2
  • 15
    • 72949107570 scopus 로고    scopus 로고
    • The concept of opportunistic networks and their research challenges in privacy and security
    • doi:10.1007/978-0-387-71058-7-5 Springer US, Boston, MA, USA Chapter 5
    • L. Lilien, Z.H. Kamal, V. Bhuse, and A. Gupta The concept of opportunistic networks and their research challenges in privacy and security Mobile and Wireless Network Security and Privacy 2007 Springer US, Boston, MA, USA 85 117 Chapter 5, doi:10.1007/978-0-387-71058-7-5
    • (2007) Mobile and Wireless Network Security and Privacy , pp. 85-117
    • Lilien, L.1    Kamal, Z.H.2    Bhuse, V.3    Gupta, A.4
  • 20
    • 77955660918 scopus 로고    scopus 로고
    • 10.1016/j.comnet.2009.11.003
    • A. Viejo, and J. Castell-Roca Computer Networks 54 9 2010 1343 1357 10.1016/j.comnet.2009.11.003
    • (2010) Computer Networks , vol.54 , Issue.9 , pp. 1343-1357
    • Viejo, A.1    Castell-Roca, J.2
  • 28
    • 0014814325 scopus 로고
    • 10.1145/362686.362692
    • B.H. Bloom Communications of the ACM 13 7 1970 422 426 10.1145/362686.362692
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 29
    • 35248858454 scopus 로고    scopus 로고
    • Making a faster cryptanalytic time-memory trade-off
    • Springer Berlin, Germany URL
    • P. Oechslin Making a faster cryptanalytic time-memory trade-off Proceedings of Advances in Cryptology (CRYPTO 2003) 2003 Springer Berlin, Germany 617 630 URL http://www.springerlink.com/content/U9GXWD29P2TNX3WL
    • (2003) Proceedings of Advances in Cryptology (CRYPTO 2003) , pp. 617-630
    • Oechslin, P.1


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