Results 231 to 240 of about 154,933 (276)
Some of the next articles are maybe not open access.

Batch quantum multi-proxy signature

Optical and Quantum Electronics, 2018
A batch quantum multi-proxy signature scheme is proposed, in which the original signatory distributes his signing right to multiple proxy signatories, and these proxy signatories can sign multiple messages. The proxy signatories generate some single particles, and the original signatory uses the quantum-controlled-not to transmit the signing ...
Huawang Qin   +2 more
openaire   +3 more sources

Batch proxy quantum blind signature scheme

Science China Information Sciences, 2011
Motivated by proxy signature and blind signature for the secure communications, the batch signature is proposed to create a novel quantum cryptosystem. It is based on three-dimensional two-particle-entangled quantum system which is used to distribute the quantum keys and create strings of quantum-trits (qutrits) for messages. All of the messages, which
JinJing Shi   +4 more
openaire   +3 more sources

Improved digital signature suitable for batch verification

IEEE Transactions on Computers, 1995
Summary: A improved digital signature is developed based on the famous Schnorr or Brickell-McCurley schemes. It is shown that both the new scheme and the previous two originals rely on the same security assumptions. The novel feature of this proposed signature is that it can be verified in a batch manner and the improved efficiency is approximately ...
Yen, Sung-Ming, Laih, Chi-Sung
openaire   +3 more sources

Cryptanalysis of a Batch Proxy Quantum Blind Signature Scheme

International Journal of Theoretical Physics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cai, Xiao-Qiu   +2 more
openaire   +3 more sources

Performance study of online batch-based digital signature schemes

Journal of Network and Computer Applications, 2010
A digital signature is an important type of authentication in a public-key (or asymmetric) cryptographic system, and it is widely used in many digital government applications. We, however, note that the performance of an Internet server computing digital signatures online is limited by the high cost of modular arithmetic.
Cheng-Fu Chou   +2 more
openaire   +3 more sources

Batch RSA signature scheme

Journal of Shanghai Jiaotong University (Science), 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Bao-Jun, Zhou, Yi, Wang, Wei-Nong
openaire   +1 more source

A BATCH VERIFICATION FOR MULTIPLE PROXY SIGNATURE

Parallel Processing Letters, 2011
In this article, we proposed a batch verification scheme for multiple proxy signatures to reduce the proxy signature verification time. The proposed scheme is not only efficient because it does not verify each individual proxy signature separately, but also secure because it can detect forged multiple proxy signatures without failure.
Tzeng, Shiang-Feng   +2 more
openaire   +2 more sources

Batch Verification of EdDSA Signatures

2014
In AfricaCrypt 2012 and ACNS 2014, several algorithms are proposed for the batch verification of ECDSA signatures. In this paper, we make a comparative study of these methods for the Edwards curve digital signature algorithm (EdDSA). We describe the adaptation of Algorithms N, N′, S2′ and SP for EdDSA signatures.
Sabyasachi Karati, Abhijit Das
openaire   +1 more source

Detecting invalid digital signatures in batches

2017 IEEE Conference on Dependable and Secure Computing, 2017
We show that invalid signatures generated by attackers may be complex, and these signatures are difficult to detect. The detecting method which is widely used now may not detect such invalid signatures with a small probability. In this paper, we use cover-free families to certainly detect them when the number of invalid signatures is small enough.
D. J. Guan   +3 more
openaire   +1 more source

Batch Verification of ECDSA Signatures

2012
In this paper, we study several algorithms for batch verification of ECDSA signatures. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. We also propose two new and efficient algorithms which replace square-root computations by symbolic manipulations.
Sabyasachi Karati   +5 more
openaire   +1 more source

Home - About - Disclaimer - Privacy