Welcome to the InfoSci Platform
Reference Hub1
Digital Signature Schemes Based on Two Hard Problems

Digital Signature Schemes Based on Two Hard Problems

A. B. Nimbalkar, C. G. Desai
Copyright: © 2017 |Pages: 28
ISBN13: 9781522521549|ISBN10: 1522521542|EISBN13: 9781522521556
DOI: 10.4018/978-1-5225-2154-9.ch007
Cite Chapter Cite Chapter

MLA

Nimbalkar, A. B., and C. G. Desai. "Digital Signature Schemes Based on Two Hard Problems." Detecting and Mitigating Robotic Cyber Security Risks, edited by Raghavendra Kumar, et al., IGI Global, 2017, pp. 98-125. https://doi.org/10.4018/978-1-5225-2154-9.ch007

APA

Nimbalkar, A. B. & Desai, C. G. (2017). Digital Signature Schemes Based on Two Hard Problems. In R. Kumar, P. Pattnaik, & P. Pandey (Eds.), Detecting and Mitigating Robotic Cyber Security Risks (pp. 98-125). IGI Global. https://doi.org/10.4018/978-1-5225-2154-9.ch007

Chicago

Nimbalkar, A. B., and C. G. Desai. "Digital Signature Schemes Based on Two Hard Problems." In Detecting and Mitigating Robotic Cyber Security Risks, edited by Raghavendra Kumar, Prasant Kumar Pattnaik, and Priyanka Pandey, 98-125. Hershey, PA: IGI Global, 2017. https://doi.org/10.4018/978-1-5225-2154-9.ch007

Export Reference

Mendeley
Favorite

Abstract

This chapter takes a critical review of the digital signature schemes which are based on two hard problems. The analytical study begins with the Harn (1994) scheme and He-Kiesler (1994) scheme. Shao's 1998 and 2002 schemes have been studied. Wei-Hua He (2001) and Shimin Wei (2004, 2007) schemes are analyzed further in the research work. Attacks on Shimin Wei's (2004, 2007) schemes are critically studied and drawbacks have been noted so as to design better schemes than these. Then we continue our analysis work by studying Ismail, Thate, and Ahmad's (2008) scheme and Swati Verma's (2012) signature scheme.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.