IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 11    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 11,November 2012
Blocking Misbehaving Users in Anonymizing Networks
Full Text(PDF, )  PP.108-114  
Author(s)
Rajkumar Rathod Banoth , Chandra chary sreeramoj, Dr. G. Narsimha
KEYWORDS
anonymizing networks, misbehaving users, blacklisting
ABSTRACT
Internet services can be accessed privately through anonymizing networks like Tor. A set of routers are used to achieve this in order to hide the identity of client from server. The users of such networks often indulge into malicious activities and cause
References
[1] G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, “A Practicaland Provably Secure Coalition-Resistant Group Signature,Scheme,” Proc. Ann. Int’l Cryptology Conf. (CRYPTO), Springer,pp. 255-270, 2000.

[2] G. Ateniese, D.X. Song, and G. Tsudik, “Quasi-Efficient Revocationin Group Signatures,” Proc. Conf. Financial Cryptography,Springer, pp. 183-197, 2002.

[3] M. Bellare, H. Shi, and C. Zhang, “Foundations of GroupSignatures: The Case of Dynamic Groups,” Proc. Cryptographer’sTrack at RSA Conf. (CT-RSA), Springer, pp. 136-153, 2005.

[4] D. Boneh and H. Shacham, “Group Signatures with Verifier-Local Revocation,” Proc. ACM Conf. Computer and Comm. Security,pp. 168-177, 2004.

[5] E. Bresson and J. Stern, “Efficient Revocation in Group Signatures,”Proc. Conf. Public Key Cryptography, Springer, pp. 190-206,2001.

[6] J. Camenisch and A. Lysyanskaya, “An Efficient System for Non-Transferable Anonymous Credentials with Optional AnonymityRevocation,” Proc. Int’l Conf. Theory and Application of CryptographicTechniques (EUROCRYPT), Springer, pp. 93-118, 2001.

[7] J. Camenisch and A. Lysyanskaya, “Dynamic Accumulators andApplication to Efficient Revocation of Anonymous Credentials,”Proc. Ann. Int’l Cryptology Conf. (CRYPTO), Springer, pp. 61-76,2002.

[8] J. Camenisch and A. Lysyanskaya, “Signature Schemes andAnonymous Credentials from Bilinear Maps,” Proc. Ann. Int’lCryptology Conf. (CRYPTO), Springer, pp. 56-72, 2004.

[9] D. Chaum, “Blind Signatures for Untraceable Payments,” Proc.Ann. Int’l Cryptology Conf. (CRYPTO), pp. 199-203, 1982.

[10] D. Chaum, “Showing Credentials without Identification Transfeering Signatures between Unconditionally Unlinkable Pseudonyms,”Proc. Int’l Conf. Cryptology (AUSCRYPT), Springer,pp. 246-264, 1990.

[11] D. Chaum and E. van Heyst, “Group Signatures,” Proc. Int’l Conf.Theory and Application of Cryptographic Techniques (EUROCRYPT), pp. 257-265, 1991.

[12] I. Damga°rd, “Payment Systems and Credential Mechanisms withProvable Security Against Abuse by Individuals,” Proc. Ann. Int’lCryptology Conf. (CRYPTO), Springer, pp. 328-335, 1988.

[13] R. Dingledine, N. Mathewson, and P. Syverson, “Tor: The Second-Generation Onion Router,” Proc. Usenix Security Symp., pp. 303-320, Aug. 2004.

[14] J.R. Douceur, “The Sybil Attack,” Proc. Int’l Workshop on Peer-to-Peer Systems (IPTPS), Springer, pp. 251-260, 2002.

[15] J.E. Holt and K.E. Seamons, “Nym: Practical Pseudonymity forAnonymous Networks,” Internet Security Research Lab TechnicalReport 2006-4, Brigham Young Univ., June 2006.

[16] A. Kiayias, Y. Tsiounis, and M. Yung, “Traceable Signatures,”Proc. Int’l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT), Springer, pp. 571-589, 2004.

[17] A. Lysyanskaya, R.L. Rivest, A. Sahai, and S. Wolf, “PseudonymSystems,” Proc. Conf. Selected Areas in Cryptography, Springer,pp. 184-199, 1999.

[18] T. Nakanishi and N. Funabiki, “Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from BilinearMaps,” Proc. Int’l Conf. Theory and Application of Cryptology andInformation Security (ASIACRYPT), Springer, pp. 533-548, 2005.268 IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 8, NO. 2, MARCH-APRIL 2011

[19] L. Nguyen, “Accumulators from Bilinear Pairings and Applications,”Proc. Cryptographer’s Track at RSA Conf. (CT-RSA), Springer,pp. 275-292, 2005.

[20] I. Teranishi, J. Furukawa, and K. Sako, “k-Times AnonymousAuthentication (Extended Abstract),” Proc. Int’l Conf. Theory andApplication of Cryptology and Information Security (ASIACRYPT),Springer, pp. 308-322, 2004.

Untitled Page