Digital Signature Schemes Based on Multiple Hard Problems

Digital Signature Schemes Based on Multiple Hard Problems


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 4,396

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

Digital signature scheme (DSS) can be divided into two categories; ordinary signature (OSS) and function-based signature (FBS). OSS enables a legal signer to sign an electronic message digitally and allows the owner of the message or signature verifier to check the validity of the resultant signature whereas FBS provides the ordinary signature with some added or extra properties and supports many applications in electronic-based business such as e-cash or payments systems, electronic voting and contract signing. In this book, we study cryptographic algorithms or protocols of both OSS and FBS that permits for electronic messages to be signed in such a way that the produced signature is hard to forge, easy to authenticate and impossible to repudiate. Most of the existing digital signature schemes were designed based on a single cryptographic assumption (hard problem) like factoring problem (FP), discrete logarithm problem (DLP), quadratic residue problem (QRP), or elliptic curve discrete logarithm problem (ECDLP). Such schemes offer higher level of security than that schemes based on a single cryptographic assumption .

Product Specifications
SKU :COC99318
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-08-18
0 Review(s)