Secure Digital Signature Scheme against Chosen Message Attacks
Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 9)Publication Date: 2014-09-05
Authors : Maheshkumar Zilla; K. Raghavendra Rao;
Page : 1475-1480
Keywords : Cryptography; digital signatures; factoring; chosen-message attacks; authentication; trap-door permutations; randomization;
Abstract
Digital signature scheme based on the computational difficulty of integer factorization. The scheme possesses secure against an adaptive chosen-message attack: Receiver who receives signatures for messages of his choice (where each message may be chosen in a way that depends on the signatures of previously chosen messages) cannot later forge the signature. This is surprising, since the properties of having forgery being equivalent to factoring and being invulnerable to an adaptive chosen-message attack were considered in the folklore to be contradictory. More commonly, we show how to construct a signature scheme with such properties based on the existence of a claw-free pair of permutations a potentially weaker assumption than the intractability of integer factorization. The new scheme is potentially realistic: signing and verifying signatures are practically fast, and signatures are compact.
Other Latest Articles
- Structural Performance of Self Compacting Fibre Reinforced Concrete
- Organizing User Search Histories on User Precedence Based Search with Security
- Problems Faced by Women in the Educational Institutions of Bijapur
- Stakes as Aggregation and Detection Tools for Control of Termites at Three Different Stations in Lahore, Pakistan
- An Aerial View of Hierarchical Energy Efficient Protocols in Wireless Body Sensor Networks
Last modified: 2021-06-30 21:07:44