Nymble: Preventing Misbehaving Customers in Anonymizing Communities
Keywords:
anonym zing networks, blacklisting, symmetric cryptography, Tor, pseudonym, nymble ticket, Anonymous authentication, backward unlinkability, revocation auditability.Abstract
The approach of anonym zing systems guaranteed that clients could get to web administrations with complete privacy maintaining a strategic distance from any conceivable impediment. This game plan where arrangement of switches structure a system, conceal the client's IP address from the server. However misbehaviour of few malpractitioners has left this framework with a proviso where clients make utilization of this obscurity to mutilate mainstream sites. Executives who can't for all intents and purposes obstruct a client utilizing IP location are compelled to close all conceivable hubs that prompt way out. Along these lines deny access to both carrying on and non-behaving users out and out. Thus wind up blocking clients with no bargain to their obscurity. Subsequently we propose a framework which is undogmatic with diverse servers. In this way we go for giving the chairman the privilege to obstruct the malevolent client without blocking the obscurity of the rest.
References
[1] Stefan Brands. Untraceable off-line cash in wallets with observers (extended abstract). In Douglas R. Stinson, editor, CRYPTO, volume 773 of LNCS, pages 302–318. Springer, 1993.
[2] Mihir Bellare, Haixia Shi, and Chong Zhang. Foundations of group signatures: The case ofdynamic groups. In Alfred Menezes, editor, CT-RSA, volume 3376 of LNCS, pages 136–153.Springer, 2005.
[3] Giuseppe Ateniese, Jan Camenisch, Marc Joye, and Gene Tsudik.A practical and provably secure coalition-resistant group signature scheme. In Mihir Bellare, editor, CRYPTO, volume1880 of LNCS, pages 255–270. Springer, 2000.
[4] Mihir Bellare, Daniele Micciancio, and Bogdan Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions.In Eli Biham, editor, EUROCRYPT, volume 2656 of LNCS, pages 614–629. Springer, 2003.
[5] Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, and MiraMeyerovich. How to win the clonewars: efficient periodic n-times anonymous authentication. InAri Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati, editors, ACM Conferenceon Computer and Communications Security, pages 201–210. ACM, 2006.
[6] Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya.Compact e-cash. In RonaldCramer, editor, EUROCRYPT, volume 3494 of LNCS, pages 302–321. Springer, 2005.
[7] Paul F. Syverson, Stuart G. Stubblebine, and David M. Goldschlag.Unlinkable serial transactions.In Rafael Hirschfeld, editor, Financial Cryptography, volume 1318 of LNCS, pages39–56.Springer, 1997.
[8] Isamu Teranishi, Jun Furukawa, and Kazue Sako.k-times anonymous authentication. In Pil Joong Lee, editor, ASIACRYPT, volume 3329 of LNCS, pages 308–322.Springer, 2004.
[9] Jan Camenisch and Anna Lysyanskaya.An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Birgit Pfitzmann, editor, EUROCRYPT, volume2045 of LNCS, pages 93–118. Springer, 2001.
[10] David Chaum. Blind signatures for untraceable payments. In CRYPTO, pages 199–203, 1982.LNCS, pages 246–264. Springer, 1990.
[11] Patrick P. Tsang, Apu Kapadia, and Sean W. Smith.Anonymous IP-address blocking in torwith trusted computing (work-in-progress). In The Second Workshop on Advances in TrustedComputing (WATC ’06 Fall), November 2006.
[12] Ronald L. Rivest, Adi Shamir, and Yael Tauman. How to leak a secret. In Colin Boyd, editor,ASIACRYPT, volume 2248 of LNCS, pages 552– 565. Springer, 2001.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Under this license, authors retain ownership of the copyright for their articles. By submitting to the International Journal of Advanced Research in Science, Management, and Technology (IJARSMT), authors grant the journal the right of first publication. Users are free to share, copy, and redistribute the material in any medium or format, and to adapt, remix, transform, and build upon the material for any purpose, including commercially, provided that appropriate credit is given to the original author(s) and the journal, a link to the license is provided, and any changes made are indicated.
