메뉴 건너뛰기




Volumn , Issue , 2008, Pages 18-32

Anonymous networking with minimum latency in multihop networks

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; INFORMATION THEORY; MIXING; OPTIMIZATION; PACKET NETWORKS; PHOTOELECTRIC RELAYS; SCHEDULING; TRANSMISSIONS;

EID: 50249168829     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2008.18     Document Type: Conference Paper
Times cited : (27)

References (26)
  • 1
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses and digital pseudonyms
    • February
    • D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, vol. 24, pp. 84-88, February 1981.
    • (1981) Communications of the ACM , vol.24 , pp. 84-88
    • Chaum, D.1
  • 2
    • 1642367651 scopus 로고
    • Mixmaster and Remailer Attacks,
    • L. Cottrell, "Mixmaster and Remailer Attacks," tech. rep., 1994.
    • (1994) tech. rep
    • Cottrell, L.1
  • 3
    • 84860028109 scopus 로고    scopus 로고
    • Generalizing mixes
    • Proceedings of Privacy Enhancing Technologies Workshop PET 2003, Springer-Verlag, April
    • C. Díaz and A. Serjantov, "Generalizing mixes," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2003), Springer-Verlag, LNCS 2760, April 2003.
    • (2003) LNCS , vol.2760
    • Díaz, C.1    Serjantov, A.2
  • 8
    • 84957800033 scopus 로고    scopus 로고
    • Towards measuring anonymity
    • Proceedings of Privacy Enhancing Technologies Workshop PET 2002, R. Dingledine and P. Syverson, eds, Springer-Verlag, April
    • C. Díaz, S. Seys, J. Claessens, and B. Preneel, "Towards measuring anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
    • (2002) LNCS , vol.2482
    • Díaz, C.1    Seys, S.2    Claessens, J.3    Preneel, B.4
  • 9
    • 84957802536 scopus 로고    scopus 로고
    • Towards an information theoretic metric for anonymity
    • Proceedings of Privacy Enhancing Technologies Workshop PET 2002, R. Dingledine and P. Syverson, eds, Springer-Verlag, April
    • A. Serjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
    • (2002) LNCS , vol.2482
    • Serjantov, A.1    Danezis, G.2
  • 11
    • 0016562514 scopus 로고
    • The wiretap channel
    • A.Wyner, "The wiretap channel," Bell Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
    • (1975) Bell Syst. Tech. J , vol.54 , pp. 1355-1387
    • Wyner, A.1
  • 12
    • 0017973511 scopus 로고
    • Broadcast channels with confidential messages
    • May
    • I. Csiszár and J. Korner, "Broadcast channels with confidential messages," IEEE Trans. on Information Theory, vol. 24, pp. 339-348, May 1978.
    • (1978) IEEE Trans. on Information Theory , vol.24 , pp. 339-348
    • Csiszár, I.1    Korner, J.2
  • 13
    • 45249083605 scopus 로고    scopus 로고
    • Anonymous Networking amidst Eavesdroppers
    • to appear Special Issue on Information-Thoeretic Security
    • P. Venkitasubramaniam, T. He, and L. Tong, "Anonymous Networking amidst Eavesdroppers," to appear IEEE Transactions on Information Theory: Special Issue on Information-Thoeretic Security, 2008.
    • (2008) IEEE Transactions on Information Theory
    • Venkitasubramaniam, P.1    He, T.2    Tong, L.3
  • 16
    • 50249129266 scopus 로고    scopus 로고
    • Reliable MIX Cascade Networks through Reputation, Financial Cryptography. Springer-Verlag
    • R. Dingledine and P. Syverson, "Reliable MIX Cascade Networks through Reputation," Financial Cryptography. Springer-Verlag, LNCS, vol. 2357, 2002.
    • (2002) LNCS , vol.2357
    • Dingledine, R.1    Syverson, P.2
  • 20
    • 0023861309 scopus 로고
    • The dining cryptographers problem : Unconditional sender and recipient untraceability
    • D. Chaum, "The dining cryptographers problem : Unconditional sender and recipient untraceability," Journal of Cryptography, vol. 1, no. 1, pp. 65-75, 1988.
    • (1988) Journal of Cryptography , vol.1 , Issue.1 , pp. 65-75
    • Chaum, D.1
  • 23
    • 0015376113 scopus 로고
    • Computation of Channel Capacity and Rate-Distortion Functions
    • July
    • R. Blahut, "Computation of Channel Capacity and Rate-Distortion Functions," IEEE Trans. Infor. Theory, vol. IT-18, July 1972.
    • (1972) IEEE Trans. Infor. Theory , vol.IT-18
    • Blahut, R.1
  • 25
    • 50249131380 scopus 로고    scopus 로고
    • Detecting Information Flows: Fundamental Limits and Optimal Algorithms
    • submitted to IEEE Trans. on Information Theory
    • T. He and L. Tong, "Detecting Information Flows: Fundamental Limits and Optimal Algorithms." submitted to IEEE Trans. on Information Theory, 2007.
    • (2007)
    • He, T.1    Tong, L.2


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