메뉴 건너뛰기




Volumn , Issue , 2006, Pages 59-62

Measuring relationship anonymity in mix networks

Author keywords

anonymity; mix networks; privacy

Indexed keywords

ANONYMITY; CONVENTIONAL METHODS; FORMAL DEFINITION; HIGH PROBABILITY; INFORMATION-THEORETIC METRICS; MIX NETWORKS; ROUTE SELECTION ALGORITHMS; SENDER ANONYMITY;

EID: 84885205648     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1179601.1179611     Document Type: Conference Paper
Times cited : (37)

References (10)
  • 1
    • 84937549115 scopus 로고    scopus 로고
    • The disadvantages of free MIX routes and how to overcome them
    • Proc. Workshop on Design Issues in Anonymity and Unobservability (2000)
    • BERTHOLD, O., PFITZMANN, A., AND STANDTKE, R. The disadvantages of free MIX routes and how to overcome them. In Proc. Workshop on Design Issues in Anonymity and Unobservability (2000), vol. 2009 of LNCS, pp. 30-45.
    • LNCS , vol.2009 , pp. 30-45
    • Berthold, O.1    Pfitzmann, A.2    Standtke, R.3
  • 2
    • 0032670943 scopus 로고    scopus 로고
    • Web caching and Zipf-like distributions: Evidence and implications
    • BRESLAU, L., CAO, P., FAN, L., PHILLIPS, G., AND SHENKER, S. Web caching and Zipf-like distributions: evidence and implications. In Proc. INFOCOM (Volume 1) (1999), pp. 126-134.
    • (1999) Proc. INFOCOM , vol.1 , pp. 126-134
    • Breslau, L.1    Cao, P.2    Fan, L.3    Phillips, G.4    Shenker, S.5
  • 3
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • CHAUM, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (1981), 84-88.
    • (1981) Communications of the ACM , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 4
    • 84957800033 scopus 로고    scopus 로고
    • Towards measuring anonymity
    • Proc. 2nd International Workshop on Privacy-Enhancing Technologies (2002)
    • DÍAZ, C., SEYS, S., CLAESSENS, J., AND PRENEEL, B. Towards measuring anonymity. In Proc. 2nd International Workshop on Privacy-Enhancing Technologies (2002), vol. 2482 of LNCS, pp. 54-68.
    • LNCS , vol.2482 , pp. 54-68
    • Díaz, C.1    Seys, S.2    Claessens, J.3    Preneel, B.4
  • 5
    • 84947287486 scopus 로고    scopus 로고
    • A reputation system to increase MIX-net reliability
    • Proc. 4th International Workshop on Information Hiding (2001)
    • DINGLEDINE, R., FREEDMAN, M., HOPWOOD, D., AND MOLNAR, D. A reputation system to increase MIX-net reliability. In Proc. 4th International Workshop on Information Hiding (2001), vol. 2137 of LNCS, pp. 126-141.
    • LNCS , vol.2137 , pp. 126-141
    • Dingledine, R.1    Freedman, M.2    Hopwood, D.3    Molnar, D.4
  • 6
    • 24344487256 scopus 로고    scopus 로고
    • Synchronous batching: From cascades to free routes
    • Proc. 4th International Workshop on Privacy-Enhancing Technologies (2004)
    • DINGLEDINE, R., SHMATIKOV, V., AND SYVERSON, P. Synchronous batching: from cascades to free routes. In Proc. 4th International Workshop on Privacy-Enhancing Technologies (2004), vol. 3424 of LNCS, pp. 186-206.
    • LNCS , vol.3424 , pp. 186-206
    • Dingledine, R.1    Shmatikov, V.2    Syverson, P.3
  • 9
    • 84957802536 scopus 로고    scopus 로고
    • Towards an information theoretic metric for anonymity
    • Proc. 2nd International Workshop on Privacy-Enhancing Technologies (2002)
    • SERJANTOV, A., AND DANEZIS, G. Towards an information theoretic metric for anonymity. In Proc. 2nd International Workshop on Privacy-Enhancing Technologies (2002), vol. 2482 of LNCS, pp. 41-53.
    • LNCS , vol.2482 , pp. 41-53
    • Serjantov, A.1    Danezis, G.2


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