메뉴 건너뛰기




Volumn 3621 LNCS, Issue , 2006, Pages 169-187

A formal treatment of onion routing

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC SECURITY ANALYSIS; ONION ROUTING; PRIVACY-PROTECTING PROTOCOLS; UNIVERSALLY COMPOSABLE FRAMEWORK;

EID: 33745174191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (92)

References (23)
  • 1
    • 35048854169 scopus 로고    scopus 로고
    • A general composition theorem for secure reactive systems
    • TCC 2004
    • M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In TCC 2004, vol. 2951 of LNCS, pp. 336-354.
    • LNCS , vol.2951 , pp. 336-354
    • Backes, M.1    Pfitzmann, B.2    Waidner, M.3
  • 2
    • 84937549115 scopus 로고    scopus 로고
    • The disadvantages of free MIX routes and how to overcome them
    • Proceedings of Designing Privacy Enhancing Technologies, Springer-Verlag, July
    • O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free MIX routes and how to overcome them. In Proceedings of Designing Privacy Enhancing Technologies, vol. 2009 of LNCS, pp. 30-45. Springer-Verlag, July 2000.
    • (2000) LNCS , vol.2009 , pp. 30-45
    • Berthold, O.1    Pfitzmann, A.2    Standtke, R.3
  • 3
    • 35248847060 scopus 로고    scopus 로고
    • Practical verifiable encryption and decryption of discrete logarithms
    • LNCS
    • J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Advances in Cryptology - CRYPTO 2003, LNCS, 2003.
    • (2003) Advances in Cryptology - CRYPTO 2003
    • Camenisch, J.1    Shoup, V.2
  • 5
    • 35248897599 scopus 로고    scopus 로고
    • A forward-secure public-key encryption scheme
    • EUROCRYPT 2003, Springer Verlag
    • R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In EUROCRYPT 2003, vol. 2656 of LNCS, pp. 255-271. Springer Verlag, 2003.
    • (2003) LNCS , vol.2656 , pp. 255-271
    • Canetti, R.1    Halevi, S.2    Katz, J.3
  • 6
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • Feb.
    • D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, Feb. 1981.
    • (1981) Communications of the ACM , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 7
    • 0022145479 scopus 로고
    • Security without identification: Transaction systems to make big brother obsolete
    • Oct.
    • D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, Oct. 1985.
    • (1985) Communications of the ACM , vol.28 , Issue.10 , pp. 1030-1044
    • Chaum, D.1
  • 8
    • 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:65-75, 1988.
    • (1988) Journal of Cryptology , vol.1 , pp. 65-75
    • Chaum, D.1
  • 12
    • 0005063385 scopus 로고    scopus 로고
    • Onion routing for anonymous and private internet connections
    • Feb.
    • D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Onion routing for anonymous and private internet connections. Comm. of the ACM, 42(2):84-88, Feb. 1999.
    • (1999) Comm. of the ACM , vol.42 , Issue.2 , pp. 84-88
    • Goldschlag, D.M.1    Reed, M.G.2    Syverson, P.F.3
  • 14
    • 35248900308 scopus 로고    scopus 로고
    • Limits of anonymity in open environments
    • Information Hiding 2003, Springer
    • D. Kesdogan, D. Agrawal, and S. Penz. Limits of anonymity in open environments. In Information Hiding 2003, vol. 2578 of LNCS, pp. 53-69. Springer, 2003.
    • (2003) LNCS , vol.2578 , pp. 53-69
    • Kesdogan, D.1    Agrawal, D.2    Penz, S.3
  • 15
    • 0023984964 scopus 로고
    • How to construct pseudorandom permutations and pseudorandom functions
    • Apr.
    • M. Luby and C. Rackoff. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing, 17(2):373-386, Apr. 1988.
    • (1988) SIAM J. Computing , vol.17 , Issue.2 , pp. 373-386
    • Luby, M.1    Rackoff, C.2
  • 16
    • 35248844472 scopus 로고    scopus 로고
    • Provably secure public-key encryption for length-preserving Chaumian mixes
    • Springer
    • B. Möller. Provably secure public-key encryption for length-preserving Chaumian mixes. In Cryptographer's Track - RSA 2003, pp. 244-262. Springer, 2003.
    • (2003) Cryptographer's Track - RSA 2003 , pp. 244-262
    • Möller, B.1
  • 17
    • 0034823388 scopus 로고    scopus 로고
    • A model for asynchronous reactive systems and its application to secure message transmission
    • IEEE Computer Society Press
    • B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Research in Security and Privacy, pp. 184-200. IEEE Computer Society Press, 2001.
    • (2001) IEEE Symposium on Research in Security and Privacy , pp. 184-200
    • Pfitzmann, B.1    Waidner, M.2
  • 21
    • 84888872516 scopus 로고    scopus 로고
    • Securing threshold cryptosystems against chosen ciphertext attack
    • EUROCRYPT '98, Springer
    • V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In EUROCRYPT '98, vol. 1403 of LNCS. Springer, 1998.
    • (1998) LNCS , vol.1403
    • Shoup, V.1    Gennaro, R.2
  • 22
    • 35048873776 scopus 로고    scopus 로고
    • A universally composable mix-net
    • Theory of Cryptography Conference, Springer
    • D. Wikström. A universally composable mix-net. In Theory of Cryptography Conference, vol. 2951 of LNCS, pp. 317-335. Springer, 2004.
    • (2004) LNCS , vol.2951 , pp. 317-335
    • Wikström, D.1
  • 23
    • 34250785454 scopus 로고    scopus 로고
    • On flow correlation attacks and countermeasures in mix networks
    • Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao. On flow correlation attacks and countermeasures in mix networks. In PET, 2004.
    • (2004) PET
    • Zhu, Y.1    Fu, X.2    Graham, B.3    Bettati, R.4    Zhao, W.5


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