Some remarks on universal re-encryption and a novel practical anonymous tunnel

Lecture Notes in Computer Science

Volumn 3619, Issue , 2005, Pages 853-862

  Lu, Tianbo ^a   Fang, Binxing ^a   Sun, Yuzhong ^a   Guo, Li ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; SECURITY OF DATA;

ANONYMOUS COMMUNICATION; LOW-LATENCY COMMUNICATION; RE-ENCRYPTION;

CRYPTOGRAPHY;

EID: 26444586033     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534310_90     Document Type: Conference Paper

References (16)

1. [Cha81] D. Chaum. Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM., 24(2):84-88, February 1981.
2. [DDM03] G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, May 2003.
3. [DMS04] R. Dingledine, N. Mathewson, and P. Syverson. Tor: The Second-Generation Onion Router. In Proceedings of the 13th USENIX Security Symposium, 2004.
4. [Fai04] P. Fairbrother. An Improved Construction for Universal Re-encryption. In Proceedings of Privacy Enhancing Technologies, 2004. Springer-Verlag.
5. [FS01] J. Furukawa and K. Sako. An Efficient Scheme for Proving a Shuffle. In Proceedings of Crypto '01, pages 368-387, 2001. Springer-Verlag.
6. [GJJS04] P. Golle, M. Jakobsson, A. Juels, and P. Syverson. Universal re-encryption for mixnets. In Proceedings of CT-RSA 2004, February 2004. Springer-Verlag.
7. [GKK04] M. Gomulkiewicz, M. Klonowski, and M. Kutylowski. Onions Based on Universal Re-Encryption - Anonymous Communication Immune Against Repetitive Attack. In Proceedings of Workshop on Information Security Applications (WISA'2004), 2004. Springer-Verlag.
8. [JJ01] M. Jakobsson and A. Juels. An optimally robust hybrid mix network. In Principles of Distributed Computing (PODC 2001), pages 284-292, August 2001.
9. [KS95] J. Kilian and K. Sako. Receipt-free MIX-type voting scheme - a practical solution to the implementation of a voting booth. In Proceedings of Advances in Cryptology - Eurocrypt'95, May 1995. Springer-Verlag.
10. [MCPS03] U. Möller, L. Cottrell, P. Palfrader, and L. Sassaman. Mixmaster Protocol - Version 2. Draft, July 2003.
11. [MH96] M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In Proceedings of Advances in Cryptology - Asiacrypt'96, November 1996. Springer-Verlag.
12. [NefOl] A. Neff, A verifiable secret shuffle and its application to e-voting. In Proceedings of ACM CCS '01, pages 116-125, 2001.
13. [Pfi94] B. Pfitzmann. Breaking efficient anonymous channel. In Proceedings of Advances in Cryptology - Eurocrypt'94, May 1994. Springer-Verlag.
14. [PIK93] C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Proceedings of Eurocrypt'93, LNCS 765, pages 248-259, 1994. Springer-Verlag.
15. [RP02] M. Rennhard and B. Plattner. 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'02), November 2002.
16. [RR98] M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, 1(1): 66-92, November 1998.