메뉴 건너뛰기




Volumn 3381, Issue , 2005, Pages 229-238

Anonymous communication with on-line and off-line onion encoding

Author keywords

Anonymous communication; Onion; Universal re encryption

Indexed keywords

COMPUTER ARCHITECTURE; CRYPTOGRAPHY; ENCODING (SYMBOLS); PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

EID: 24144437120     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_26     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 2
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, CACM 24(2) (1981), 84-88
    • (1981) CACM , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 3
    • 0023861309 scopus 로고
    • The dining cryptographers problem: Unconditional sender and recipient untraceability
    • Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology 1.1 (1988), 65-75
    • (1988) Journal of Cryptology 1.1 , pp. 65-75
    • Chaum, D.1
  • 5
    • 24944546872 scopus 로고    scopus 로고
    • An improved construction for universal re-encryption
    • LNCS, Springer-Verlag
    • Fairbrother, P.: An Improved Construction for Universal Re-encryption, Privacy Enhancing Technologies'2004, LNCS, Springer-Verlag.
    • Privacy Enhancing Technologies'2004
    • Fairbrother, P.1
  • 6
    • 0002992068 scopus 로고    scopus 로고
    • Joint encryption and message-efficient secure computation
    • Frankling, M., Haber, S.: Joint Encryption and Message-Efficient Secure Computation, Journal of Cryptology 9.4 (1996), 217-232.
    • (1996) Journal of Cryptology 9.4 , pp. 217-232
    • Frankling, M.1    Haber, S.2
  • 7
    • 84955557456 scopus 로고    scopus 로고
    • Hiding routing information
    • Information Hiding '1996, Springer-Verlag
    • Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding Routing Information. Information Hiding '1996, LNCS 1174, Springer-Verlag, 137-150.
    • LNCS , vol.1174 , pp. 137-150
    • Goldschlag, D.M.1    Reed, M.G.2    Syverson, P.F.3
  • 11
    • 35048849599 scopus 로고    scopus 로고
    • Provable unlinkability against traffic analysis already after ο(log(n)) steps!
    • Information Security Conference (ISC)'2004, Springer-Verlag
    • Gomulłkiewicz, M., Klonowski, M., Kutylowski, M.: Provable Unlinkability Against Traffic Analysis already after ο(log(n)) Steps!, Information Security Conference (ISC)'2004, LNCS 3225, Springer-Verlag, 354-366.
    • LNCS , vol.3225 , pp. 354-366
    • Gomulłkiewicz, M.1    Klonowski, M.2    Kutylowski, M.3
  • 13
    • 84890010554 scopus 로고    scopus 로고
    • Stop-and-go-MIXes providing probabilistic anonymity in an open system
    • Information Hiding '98, Springer-Verlag
    • Kesdogan D., Egner J., Büschkes R.: Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System, Information Hiding '98, LNCS 1525, Springer-Verlag, 83-98.
    • LNCS , vol.1525 , pp. 83-98
    • Kesdogan, D.1    Egner, J.2    Büschkes, R.3
  • 14
    • 0027224328 scopus 로고
    • Cryptographic defense against traffic analysis
    • Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis, ACM STOC25 (1993), 672-681.
    • (1993) ACM STOC25 , pp. 672-681
    • Rackoff, C.1    Simon, D.R.2


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