Google Scholar

##plugins.themes.academic_pro.article.sidebar##

Published
Feb 18, 2015
Download
PDF
Statistic
Read Counter : 28 Download : 14

Downloads

Download data is not yet available.

##plugins.themes.academic_pro.article.main##

Abstract

We present a new protocol for electronic cash which is designed to function on hardware with limited computing power. The scheme has provable security properties and low computational requirements, but it still gives a fair amount of privacy. Another feature of the system is that there is no master secret that could be used for counterfeiting money if stolen.  We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the signers as leaves. For a signer that is a leaf of the sub tree of a group manager, the group manager learns which of its children that (perhaps indirectly) manages the signer.

Keywords: electronic cash; security properties; counterfeiting ; computational; hierarchical

##plugins.themes.academic_pro.article.details##

Author Biography

Dr Daruri Venugopal, Siddhartha Institute Of Technology And Science Narapally, Ghatkesar, R.R. Dist

M. Tech; Ph.D; Ph.D (Post.Doc.)

Professor in Dept. of Computer Science & Engineering

 

 

How to Cite
Venugopal, D. D. (2015). Network Security Cryptographic Protocols and Lattice Problems. International Journal of Emerging Trends in Science and Technology, 2(02). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/500

References

1. M. Ajtai. Generating hard instances of lattice problems. In 28th ACM Symposium on the Theory of Computing (STOC), pages 99–108. ACM Press, 1996.
2. M. Ajtai. The shortest vector problem in ℓ2 is NP-hard for randomized reductions. In 30th ACM Symposium on the Theory of Computing (STOC), pages 10–19. ACM Press, 1998.
3. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology – CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages255–270. Springer Verlag, 2000.
4. G. Ateniese and G. Tsudik. Some open issues and directions in group signatures. In Financial Cryptography ’99, volume 1648 of Lecture Notes in Computer Science, pages 196–211. Springer Verlag, 1999.
5. L. Babai. Trading group theory for randomness. In 17th ACM Symposium onthe Theory of Computing (STOC), pages 421–429. ACM Press, 1985.

Print References
6. EMVCo. EMV2000 Integrated Circuit Card Specifications for Payment Systems, December 2000. Available fromhttp:// www.emvco.com (September203).
7. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero-knowledgeproofs under general assumptions. SIAM Journal of comp. 29(1):1–28,1999.