Some Remarks on Universal Re-encryption and A Novel Practical Anonymous Tunnel

  • Tianbo Lu
  • Binxing Fang
  • Yuzhong Sun
  • Li Guo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3619)


In 2004 Golle, Jakobsson, Juels and Syverson presented a new encryption scheme called the universal re-encryption [GJJS04] for mixnets [Cha81] which was extended by Gomulkiewicz et al. [GKK04]. We discover that this scheme and its extension both are insecure against a chosen ciphertext attack proposed by Pfitzmann in 1994 [Pfi94]. Another drawback of them is low efficiency for anonymous communications due to their long ciphertexts, i.e., four times the size of plaintext. Accordingly, we devise a novel universal and efficient anonymous tunnel, rWonGoo, for circuit-based low-latency communications in large scale peer-to-peer environments to dramatically decrease possibility to suffer from the attack [Pfi94]. The basic idea behind rWonGoo is to provide anonymity with re-encryption and random forwarding, obtaining practicality, correctness and efficiency in encryption in the way differing from the layered encryption systems [Cha81] that can be difficult to achieve correctness of tunnels.


Side Information Malicious Node Replay Attack Node Versus Probability Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Cha81]
    Chaum, D.: Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM 24(2), 84–88 (1981)CrossRefGoogle Scholar
  2. [DDM03]
    Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a Type III Anonymous Remailer Protocol. In: Proceedings of the 2003 IEEE Symposium on Security and Privacy (May 2003)Google Scholar
  3. [DMS04]
    Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second-Generation Onion Router. In: Proceedings of the 13th USENIX Security Symposium (2004)Google Scholar
  4. [Fai04]
    Fairbrother, P.: An Improved Construction for Universal Re-encryption. In: Proceedings of Privacy Enhancing Technologies. Springer, Heidelberg (2004)Google Scholar
  5. [FS01]
    Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. [GJJS04]
    Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 163–178. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. [GKK04]
    Gomułkiewicz, M., Klonowski, M., Kutyłowski, M.: Onions Based on Universal Re-Encryption - Anonymous Communication Immune Against Repetitive Attack. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 400–410. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. [JJ01]
    Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: Principles of Distributed Computing (PODC 2001), August 2001, pp. 284–292 (2001)Google Scholar
  9. [KS95]
    Kilian, J., Sako, K.: Receipt-free MIX-type voting scheme - a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)Google Scholar
  10. [MCPS03]
    Möller, U., Cottrell, L., Palfrader, P., Sassaman, L.: Mixmaster Protocol - Version 2. Draft (July 2003)Google Scholar
  11. [MH96]
    Michels, M., Horster, P.: Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163. Springer, Heidelberg (1996)Google Scholar
  12. [Nef01]
    Neff, A.: A verifiable secret shuffle and its application to e-voting. In: Proceedings of ACM CCS 2001, pp. 116–125 (2001)Google Scholar
  13. [Pfi94]
    Pfitzmann, B.: Breaking efficient anonymous channel. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 332–340. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  14. [PIK93]
    Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 248–259. Springer, Heidelberg (1994)Google Scholar
  15. [RP02]
    Rennhard, M., Plattner, B.: Introducing MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection. In: The Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2002) (November 2002)Google Scholar
  16. [RR98]
    Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tianbo Lu
    • 1
    • 2
  • Binxing Fang
    • 1
    • 2
  • Yuzhong Sun
    • 1
    • 2
  • Li Guo
    • 1
    • 2
  1. 1.Software Division, Institute of Computing TechnologyChinese Academy of SciencesBeijingP.R. China
  2. 2.Graduate School of Chinese Academy of SciencesBeijingP.R. China

Personalised recommendations