Results 251 to 260 of about 154,933 (276)

Finding Invalid Signatures in Pairing-Based Batches

2007
This paper describes efficient methods for finding invalid digital signatures after a batch verification has failed. We present an improvement to the basic binary "divide-and-conquer" method, which can identify an invalid signature in half the time. We also present new, efficient methods for finding invalid signatures in some pairing-based batches with
Laurie Law, Brian J. Matt
openaire   +1 more source

Efficient Self-certified Signatures with Batch Verification

2012
To eliminate the need of public-key certificates from Public Key Infrastructure (PKI) and the problem of key escrow in identity-based cryptography, the concept of self-certified public key was put forth by Girault. In this paper, we propose an efficient and novel self-certified signature scheme, which requires only one modular multiplication in signing
Li, Nan, Mu, Yi, Susilo, Willy
openaire   +1 more source

Revocable ID-based Signature Scheme with Batch Verifications

2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2012
Signature scheme is one of important primitives in modern cryptography, which may offer functionalities of user identification, non-repudiation, and message authentication. With the advent of identity (ID)-based public key system (IDPKS) with bilinear pairings, many cryptographic schemes and protocols based on the IDPKS system have been proposed ...
Tsu-Yang Wu, Tung-Tso Tsai, Yuh-Min Tseng   +2 more
openaire   +1 more source

An efficient identity-based signature scheme with batch verifications

Proceedings of the 1st international conference on Scalable information systems - InfoScale '06, 2006
Mapping messages or a user's identity into a point on elliptic curves is required by many pairing-based cryptographic schemes. In most of pairing-based schemes, this requirement is realized by a special hash function, MapToPoint function. However, the efficiency of the MapToPoint function is much lower than the general hash functions. In this paper, we
Shi Cui, Pu Duan, Choong Wah Chan
openaire   +1 more source

Two Simple Batch Verifying Multiple Digital Signatures

2001
In this article, we propose two types of multiple digital signatures for batch verification. our schemes not only efficient to reduce computation of verifying these signatures, but also secure to detect forged multiple digital signatures.
Hwang Min-Shiang, Lee Cheng-Chi, Tang Yuan-Liang   +2 more
openaire   +1 more source

Efficient Batch Post-quantum Signatures with Crystals Dilithium

Digital signatures ensure authenticity and secure communication. They are used to verify the integrity and authenticity of signed documents and are widely utilized in various fields such as information technologies, finance, education, and law. They are crucial in securing servers against cyberattacks and authenticating connections between clients and ...
Türe, Nazlı Deniz, Cenk, Murat
openaire   +2 more sources

Batch verifying multiple DSA-type digital signatures

Computer Networks, 2001
Abstract To improve the efficiency of digital signature algorithm (DSA)-type signature scheme, Naccache et al. proposed the concept of batch verifying multiple signatures. This paper shows that the interactive batch verifying protocol proposed by Naccache et al. is not secure.
openaire   +1 more source

A New Batch Verifying Scheme for Identifying Illegal Signatures

Journal of Computer Science and Technology, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Beware the Batch Signature

Home Healthcare Now, 2018
Kyle, Clark, Andrew, George, Mike, Ruggio   +2 more
openaire   +2 more sources

Authenticated Batch-signature for Multicasting

Proceedings of the International Conference on Computer Applications — Computer Applications - I, 2010
Shrividhya P., Aarthy T.
openaire   +1 more source