Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/14777
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKittur A.S.
dc.contributor.authorKauthale S.
dc.contributor.authorPais A.R.
dc.date.accessioned2021-05-05T10:15:46Z-
dc.date.available2021-05-05T10:15:46Z-
dc.date.issued2020
dc.identifier.citationISEA-ISAP 2020 - Proceedings of the 3rd ISEA International Conference on Security and Privacy 2020 , Vol. , , p. 63 - 70en_US
dc.identifier.urihttps://doi.org/10.1109/ISEA-ISAP49340.2020.235002
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14777-
dc.description.abstractVerifying multiple digital signatures in a batch to reduce verification time and computation has caught the interest of many researchers since many years. There are various batch verification schemes proposed for various popular digital signature algorithms such as DSS, RSA, ECDSA and other signature schemes. If there are any bad signatures in the given batch of signatures, then the batch verification test fails but the test does not indicate the location of the bad signature. In literature, there are very few efficient schemes, which locate the index of the bad signature/s in the given batch. These existing schemes perform poorly when the bad signature/s count is unknown or when the entire batch of signatures is faulty. To overcome these disadvantages, we propose a new Low-Density Parity-Check (LDPC) based verification scheme to locate the index of the bad signature/s. Our proposed scheme outperforms the other bad signature identification schemes. The comparative analysis of our scheme with the other schemes is provided. The primary advantage of the scheme is, it removes all the transmission errors in the received batch of signatures. © 2020 IEEE.en_US
dc.titleA LDPC codes based Authentication Schemeen_US
dc.typeConference Paperen_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.