Practical Short Signature Batch Verification

2011 ◽

Vol 55-57 ◽

pp. 1605-1608

Author(s):

Fan Yu Kong ◽

Jia Yu

Keyword(s):

Digital Signature ◽

Public Key ◽

Signature Scheme ◽

Batch Verification ◽

Malicious Adversary ◽

Short Signature ◽

Digital Signature Scheme

At IWSEC 2008, F. Guo et al. proposed an efficient short signature scheme with batch verification based on C. Gentry’s scheme. In this paper, we firstly propose the key substitution attack on F. Guo et al.’s digital signature scheme and show that the malicious adversary can forge a valid signature, which can be verified with a substituted public key. Secondly, we prove that F. Guo et al.’s scheme is malleable and the attacker can produce a new valid signature on the message if he/she has known some valid signatures on the same message.

Download Full-text

Efficient batch verification of online/offline short signature for a multi-signer setting

Wuhan University Journal of Natural Sciences ◽

10.1007/s11859-011-0785-0 ◽

2011 ◽

Vol 16 (6) ◽

pp. 481-486

Author(s):

Zhide Chen ◽

Yilian Zhang ◽

Li Xu ◽

Fuchun Guo

Keyword(s):

Batch Verification ◽

Short Signature

Download Full-text

Randomized Batch Verification of Standard ECDSA Signatures

Security, Privacy, and Applied Cryptography Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-12060-7_16 ◽

2014 ◽

pp. 237-255 ◽

Cited By ~ 3

Author(s):

Sabyasachi Karati ◽

Abhijit Das ◽

Dipanwita Roychoudhury

Keyword(s):

Batch Verification

Download Full-text

A Novel Approach for Robust Perceptual Image Hashing

Computer and Information Science ◽

10.5539/cis.v14n3p38 ◽

2021 ◽

Vol 14 (3) ◽

pp. 38

Author(s):

Azhar Hadmi ◽

Awatif Rouijel

Keyword(s):

Side Information ◽

Main Idea ◽

Jpeg Compression ◽

Image Hashing ◽

Novel Approach ◽

Perceptual Hash ◽

Short Signature ◽

Robust Image ◽

Tampered Image ◽

The Stability

Perceptual image hashing system generates a short signature called perceptual hash attached to an image before transmission and acts as side information for analyzing the trustworthiness of the received image. In this paper, we propose a novel approach to improve robustness for perceptual image hashing scheme for generating a perceptual hash that should be resistant to content-preserving manipulations, such as JPEG compression and Additive white Gaussian noise (AWGN) also should differentiate the maliciously tampered image and its original version. Our algorithm first constructs a robust image, derived from the original input by analyzing the stability of the extracted features and improving their robustness. From the robust image, which does perceptually resemble the original input, we further extract the final robust features. Next, robust features are suitably quantized allowing the generation of the final perceptual hash using the cryptographic hash function SHA1. The main idea of this paper is to transform the original image into a more robust one that allows the extraction of robust features. Generation of the robust image turns out be quite important since it introduces further robustness to the perceptual image hashing system. The paper can be seen as an attempt to propose a general methodology for more robust perceptual image hashing. The experimental results presented in this paper reveal that the proposed scheme offers good robustness against JPEG compression and Additive white Gaussian noise.

Download Full-text

A Secure and Efficient Scheme with Batch-Verification for Vehicular Ad-Hoc Network

Proceedings of the 2017 2nd International Conference on Electrical, Control and Automation Engineering (ECAE 2017) ◽

10.2991/ecae-17.2018.53 ◽

2018 ◽

Author(s):

Fuyuan Tan ◽

Fei Tang ◽

Wenjun Luo ◽

Zhong Hong

Keyword(s):

Ad Hoc Network ◽

Ad Hoc ◽

Vehicular Ad Hoc Network ◽

Batch Verification ◽

Efficient Scheme

Download Full-text

Certificateless Short Signature Scheme from Bilinear Pairings

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.380-384.2435 ◽

2013 ◽

Vol 380-384 ◽

pp. 2435-2438 ◽

Cited By ~ 2

Author(s):

Shu Rong Feng ◽

Jiao Mo ◽

Hua Zhang ◽

Zheng Ping Jin

Keyword(s):

Bilinear Pairings ◽

Public Key ◽

Security Level ◽

Signature Scheme ◽

Signature Schemes ◽

Short Signature ◽

Certificateless Signature ◽

Provably Secure

Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a super adversary which can obtain the valid signature for the replaced public key. Recently, Fan et al. proposed a certificateless short signature scheme which is very efficient, but we found it is still cannot against super adversary. In this paper, we first analysis their scheme, and then present an improved scheme which can against super adversaries. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.

Download Full-text