Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Batch exponentiation: a fast DLP-based signature generation strategy
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
On some computational problems in finite Abelian groups
Mathematics of Computation
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Improved Digital Signature Suitable for Batch Verification
IEEE Transactions on Computers
Batch Verification with Applications to Cryptography and Checking
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
On the Security of RSA Screening
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Identification of Bad Signatures in Batches
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Computing discrete logarithms with the parallelized kangaroo method
Discrete Applied Mathematics - Special issue on the 2000 com2MaC workshop on cryptography
Resource requirements for the application of addition chains in modulo exponentiation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
The paper addresses batch verification to reduce large computational cost when many digital signatures are verified together, and then presents bad signature identification in the batch verification of signatures too when there is one bad signature in the batch. Our method, EBV (Exponent Based Verifier), can verify a batch of signatures and identify a bad signature using one modular exponentiation and $2n+3\sqrt{n}/2$ modular multiplications where n is the number of signatures in the batch instances. Simulation results also show the proposed method reduces considerably the number of modular multiplications compared with the existing methods