Results 151 to 160 of about 156,809 (179)
Some of the next articles are maybe not open access.
Revocable ID-based Signature Scheme with Batch Verifications
2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2012Signature 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 +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, 2006Mapping 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
Concurrent-secure anonymous fingerprinting scheme supporting batch verification
2011 IEEE International Conference on Computer Science and Automation Engineering, 2011Anonymous fingerprinting schemes are a cryptographic method for enforcing copyright protection. To date, because of certain obstacles that stand in the way of design, few desirable anonymous fingerprinting schemes based on group signature have been proposed, except for Camenisch's work in ASIACRYPT 2000.
openaire +1 more source
Batch ZK Proof and Verification of OR Logic
2009When multiple knowledge statements linked with "OR" logic have to be proved and verified, the existing solution is the proof technique by Cramer et al , in which multiple proof and verification protocols are performed in parallel. It is pointed out in this paper that the highly strong soundness in Cramer et al's solution is only theoretically valuable ...
Kun Peng, Feng Bao
openaire +1 more source
A (Corrected) DAA Scheme Using Batch Proof and Verification
2012Direct anonymous attestation (DAA) is a cryptographic primitive for providing anonymous signatures, and is a part of trusted computing technology from the Trusted Computing Group (TCG). DAA offers a nice balance between user authentication and privacy.
Ernie Brickell, Liqun Chen, Jiangtao Li
openaire +1 more source
Messages Classification and Dynamic Batch Verification Scheme for VANETs
IEEE Transactions on Mobile Computing, 2021Huei-Wen Ferng +2 more
exaly
A DAA Scheme Using Batch Proof and Verification
2010Direct anonymous attestation (DAA) is an attractive cryptographic primitive, that is not only because it provides a balance between user authentication and privacy in an elegant way, but also because it is a part of the trusted computing technology from the Trusted Computing Group (TCG).
openaire +1 more source
Efficient Small-Batch Verification and Identification Scheme With Invalid Signatures in VANETs
IEEE Transactions on Vehicular Technology, 2021Ming Yuan, Baocang Wang
exaly
Journal of Information Security and Applications, 2021
Yanli Ren, Xingliang Yuan, Xinpeng Zhang
exaly
Yanli Ren, Xingliang Yuan, Xinpeng Zhang
exaly

