메뉴 건너뛰기




Volumn , Issue , 2008, Pages 633-639

Identifying proxy nodes in a tor anonymization circuit

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; AVAILABLE BANDWIDTHS; COMPROMISED NODES; EFFECTIVE MECHANISMS; END USERS; ENTRY POINTS; ESTIMATION TECHNIQUES; INTERNET LINKS; NETWORK EDGES; NETWORK LOCATIONS; PROXY NODES;

EID: 60349122307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2008.93     Document Type: Conference Paper
Times cited : (27)

References (27)
  • 1
    • 3042699909 scopus 로고    scopus 로고
    • Measuring Anonymity: The Disclosure Attack
    • November/December
    • D. Agrawal and D. Kesdogan. Measuring Anonymity: The Disclosure Attack. IEEE Security & Privacy, 1(6):27-34, November/December 2003.
    • (2003) IEEE Security & Privacy , vol.1 , Issue.6 , pp. 27-34
    • Agrawal, D.1    Kesdogan, D.2
  • 3
    • 14844331039 scopus 로고    scopus 로고
    • th ACM Conference on Computer and Communications Security (CCS), pages 110-120, October 2004.
    • th ACM Conference on Computer and Communications Security (CCS), pages 110-120, October 2004.
  • 4
    • 60349126188 scopus 로고    scopus 로고
    • S. Chakravarty, A. Stavrou, and A. D. Keromytis. Approximating a Global Passive Adversary Against Tor. Computer Science Department Technical Report cucs-038-08, Columbia University, August 2008.
    • S. Chakravarty, A. Stavrou, and A. D. Keromytis. Approximating a Global Passive Adversary Against Tor. Computer Science Department Technical Report cucs-038-08, Columbia University, August 2008.
  • 5
    • 0023861309 scopus 로고
    • The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
    • D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1(1):65-75, 1988.
    • (1988) Journal of Cryptology , vol.1 , Issue.1 , pp. 65-75
    • Chaum, D.1
  • 6
    • 0019532104 scopus 로고
    • Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms
    • February
    • D. L. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communincations of the ACM, 24(2):84-90, February 1981.
    • (1981) Communincations of the ACM , vol.24 , Issue.2 , pp. 84-90
    • Chaum, D.L.1
  • 7
    • 0019532104 scopus 로고
    • Untraceable Electronic Mail, Return Addresses, and Digital Psuedonyms
    • D. L. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Psuedonyms. Communications of the ACM, 1981.
    • (1981) Communications of the ACM
    • Chaum, D.L.1
  • 8
    • 85084161366 scopus 로고    scopus 로고
    • th USENIX Security Symposium, pages 303-319, August 2004.
    • th USENIX Security Symposium, pages 303-319, August 2004.
  • 9
    • 60349124185 scopus 로고    scopus 로고
    • C. Dovrolis and R. Prasad. Pathrate. http: //www.cc.gatech.edu/fac/ Constantinos. Dovrolis/pathrate.tar.gz, 2004.
    • C. Dovrolis and R. Prasad. Pathrate. http: //www.cc.gatech.edu/fac/ Constantinos. Dovrolis/pathrate.tar.gz, 2004.
  • 10
    • 0000655181 scopus 로고    scopus 로고
    • Using pathchar to Estimate Internet Link Characteristics
    • August
    • A. B. Downey. Using pathchar to Estimate Internet Link Characteristics. In Proceedings of ACM SIGCOMM, August 1999.
    • (1999) Proceedings of ACM SIGCOMM
    • Downey, A.B.1
  • 11
    • 0005063385 scopus 로고    scopus 로고
    • Onion Routing for Anonymous and Private Internet Connections
    • D. Goldschlag, M. Reed, and P. Syverson. Onion Routing for Anonymous and Private Internet Connections. Communications of the ACM, 43(2):39-41, 1999.
    • (1999) Communications of the ACM , vol.43 , Issue.2 , pp. 39-41
    • Goldschlag, D.1    Reed, M.2    Syverson, P.3
  • 14
    • 60349084506 scopus 로고    scopus 로고
    • V. Jacobson. PATHCHAR. http://www.caida.org/ tools/utilities/others/ pathchar/, 1997.
    • V. Jacobson. PATHCHAR. http://www.caida.org/ tools/utilities/others/ pathchar/, 1997.
  • 15
    • 0003729959 scopus 로고    scopus 로고
    • Congestion Control in Computer Networks
    • TR-654, September 1991
    • S. Keshav. Congestion Control in Computer Networks. UC Berkely Technical Report TR-654, September 1991.
    • UC Berkely Technical Report
    • Keshav, S.1
  • 18
    • 34250818849 scopus 로고    scopus 로고
    • PlanetLab. http://www.planet-lab.org/.
    • PlanetLab
  • 20
    • 84937555407 scopus 로고    scopus 로고
    • Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
    • Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, Springer-Verlag, July
    • J.-F. Raymond. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pages 10-29. Springer-Verlag, LNCS 2009, July 2000.
    • (2000) LNCS , pp. 10-29
    • Raymond, J.-F.1
  • 22
    • 27944452198 scopus 로고    scopus 로고
    • Passive Attack Analysis for Connection-Based Anonymity Systems
    • October
    • A. Serjantov and P. Sewell. Passive Attack Analysis for Connection-Based Anonymity Systems. In Proceedings of ESORICS, October 2003.
    • (2003) Proceedings of ESORICS
    • Serjantov, A.1    Sewell, P.2
  • 23
    • 60349116688 scopus 로고    scopus 로고
    • Sprobe: Another tool for measuring bottleneck bandwidth
    • Stefan, Saroiu, and Krishna. Sprobe: Another tool for measuring bottleneck bandwidth. In Proceedings of InfoComm 2002, 2002.
    • (2002) Proceedings of InfoComm 2002
    • Stefan, S.1    Krishna2
  • 25
    • 60349106288 scopus 로고    scopus 로고
    • A. Tirumala, F. Qin, J. Dugan, J. Feguson, and K. Gibbs. IPERF. http://dast.nlanr.net/projects/Iperf/, 1997.
    • A. Tirumala, F. Qin, J. Dugan, J. Feguson, and K. Gibbs. IPERF. http://dast.nlanr.net/projects/Iperf/, 1997.
  • 26
    • 0011653195 scopus 로고
    • Unconditional Sender and Recipient Untraceability in Spite of Active Attacks
    • April
    • M. Waidner. Unconditional Sender and Recipient Untraceability in Spite of Active Attacks. In Proceedings of EUROCRYPT, pages 302-319, April 1989.
    • (1989) Proceedings of EUROCRYPT , pp. 302-319
    • Waidner, M.1
  • 27
    • 2442556704 scopus 로고    scopus 로고
    • th ACM Conference on Computer and Communications Security (CCS),pages 20-29, October 2003.
    • th ACM Conference on Computer and Communications Security (CCS),pages 20-29, October 2003.


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