Professional Documents
Culture Documents
Volume: 5 Issue: 9 81 – 83
_______________________________________________________________________________________________
1
R. Ravikumar, 2 J. Ramesh Kumar
1
Asst.professor, Dept.of.Computer Science, Tamil University, Thanjavur-613010
2
Research Scholar, Dept.of.Computer Science, Tamil University, Thanjavur-613010
Abstract: If a user wants to connect to a server has to provide his credentials where as some of the user (avoids to enter their original
credentials) connect through anonymizing network such tor browser. 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 advent of anonymizing networks
assured that users could access internet services with complete privacy avoiding any possible hindrance. IP was being shown everywhere, To
advertisers and other places, even from SPAM who compromised users identity. Anonymizing networks such as Tor allow users to access
Internet services privately by using a series of routers to hide the client’s IP address from the server. In order to allow users to access Internet
services privately, anonymizing networks like Tor uses a series of routers to hide the client’s IP address from the server. Anonymizing networks
such as Tor allow users to access Internet services privately by using a series of routers to hide the client’s IP address from the server.
Keywords: Nymble, anonymizing networks, symmetric cryptography, anonymizing networks, privacy, Nymble revocation.
__________________________________________________*****_________________________________________________
REFERENCE
[1] C. Cornelius, A. Kapadia, P.P. Tsang, and S.W. Smith,
“Nymble: Blocking Misbehaving Users in Anonymizing
Networks,” Technical Report TR2008-637, Dartmouth
College, Computer Science, Dec. 2008.
[2] G. Ateniese, D.X. Song, and G. Tsudik, “Quasi-Efficient
Revocation in 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] M. Bellare and P. Rogaway, “Random Oracles Are
Practical: A Paradigm for Designing Efficient Protocols,”
Proc. First ACM Conf. Computer and Comm. Security,
pp. 62-73, 1993.
[6] D. Boneh and H. Shacham. Group Signatures with
Verifier-Local Revocation. In ACM Conference on
Computer and Communications Security, pages 168–
177. ACM, 2004.
[7] S. Brands. Untraceable Off-line Cash in Wallets with
Observers (Extended Abstract). In CRYPTO, LNCS 773,
pages 302–318. Springer, 1993.
[8] E. Bresson and J. Stern. Efficient Revocation in Group
Signatures. In Public Key Cryptography, LNCS 1992,
pages 190–206. Springer, 2001.
[9] J. Camenisch and A. Lysyanskaya. An Efficient System
for Nontransferable Anonymous Credentials with
Optional Anonymity Revocation. In EUROCRYPT,
LNCS 2045, pages 93–118. Springer, 2001.
83
IJRITCC | September 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________