메뉴 건너뛰기




Volumn 2, Issue 1-2, 2007, Pages 11-26

Adaptive trust-based anonymous network

Author keywords

anonymity; decentralised networks; trust and reputation

Indexed keywords


EID: 42649122222     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2007.012820     Document Type: Article
Times cited : (10)

References (23)
  • 3
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • ACM
    • Chaum, D. (1981) ‘Untraceable electronic mail, return addresses, and digital pseudonyms’, ACM Communications, Vol. 24, No. 2, pp.84–88.
    • (1981) Communications , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 8
    • 84874800178 scopus 로고
    • A public key cryptosystem and a signature scheme based on discrete logarithms
    • ElGamal, T. (1985) ‘A public key cryptosystem and a signature scheme based on discrete logarithms’, IEEE Transaction on Information Theory, Vol. 31, pp.469–472.
    • (1985) IEEE Transaction on Information Theory , vol.31 , pp. 469-472
    • ElGamal, T.1
  • 10
    • 0005063385 scopus 로고    scopus 로고
    • Onion routing for anonymous and private internet connections
    • Goldschlag, D., Reed, M. and Syverson, P. (1999) ‘Onion routing for anonymous and private internet connections’, Communication of the ACM, Vol. 42, No. 2, pp.39–41.
    • (1999) Communication of the ACM , vol.42 , Issue.2 , pp. 39-41
    • Goldschlag, D.1    Reed, M.2    Syverson, P.3
  • 12
    • 84952965283 scopus 로고    scopus 로고
    • A brief history of anon.penet.fi: the legendary anonymous remailer
    • Helmers, S. (2005) ‘A brief history of anon.penet.fi: the legendary anonymous remailer’, Computer-Mediated Communication Magazine, Available at: http://www. december.com/cmc/mag/1997/sep/helmers.html.
    • (2005) Computer-Mediated Communication Magazine
    • Helmers, S.1
  • 14
    • 1642264592 scopus 로고    scopus 로고
    • Additive increase multiplicative decrease – fast convergence (AIMD-FC)
    • Lahanas, A. and Tsaoussidis, V. (2002) ‘Additive increase multiplicative decrease – fast convergence (AIMD-FC)’, Proceedings of Networks 2002, pp.511–522.
    • (2002) Proceedings of Networks 2002 , pp. 511-522
    • Lahanas, A.1    Tsaoussidis, V.2


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