Security Model for Certificateless Aggregate Signature Schemes

2008 ◽  
Author(s):  
Lei Zhang ◽  
Futai Zhang
Keyword(s):  
Security Model ◽  
Signature Schemes ◽  
Aggregate Signature

scholarly journals A Survey on Proxy Re-Signature Schemes for Translating One Type of Signature to Another

2021 ◽  
Vol 21 (3) ◽  
pp. 24-49
Author(s):  
Shilpa Chaudhari ◽  
R. Aparna ◽  
Archana Rane
Keyword(s):  
Digital Signature ◽  
Research Work ◽  
Research Interest ◽  
Security Model ◽  
Signature Schemes ◽  
Related Research ◽  
Considerable Research ◽  
Group Signatures ◽  
Published Research ◽  
Model Environment

Abstract Proxy Re-Signature (PRS) complements well-established digital signature service. Blaze-Bleumer-Strauss discussed PRS in 1998 for translating a signature on a message from Alice into a signature from Bob on the same message at semi-trusted proxy which does not learn any signing-key and cannot produce new valid signature on new message for Alice or Bob. PRS has been largely ignored since then but it has spurred considerable research interest recently for sharing web-certificates, forming weak-group signatures, and authenticating network path. This article provides a survey summarizing and organizing PRS-related research by developing eight-dimensional taxonomy reflecting the directional feature, re-transformation capability, re-signature key location, delegatee involvement, proxy re-signing rights, duration-based revocation rights, security model environment, and cryptographic approach. Even though multi-dimensional categorization is proposed here, we categorize the substantial published research work based on the eighth dimension. We give a clear perspective on this research from last two-decades since the first PRS-protocol was proposed.

Nonce-Based Key Agreement Protocol Against Bad Randomness

2019 ◽  
Vol 30 (04) ◽  
pp. 619-633
Author(s):  
Burong Kang ◽  
Xinyu Meng ◽  
Lei Zhang ◽  
Yinxia Sun
Keyword(s):  
Digital Signature ◽  
Key Agreement ◽  
Public Key ◽  
Security Model ◽  
Public Key Encryption ◽  
Signature Schemes ◽  
Key Agreement Protocol ◽  
Agreement Protocols

Most of the existing cryptographic schemes, e.g., key agreement protocol, call for good randomness. Otherwise, the security of these cryptographic schemes cannot be fully guaranteed. Nonce-based cryptosystem is recently introduced to improve the security of public key encryption and digital signature schemes by ensuring security when randomness fails. In this paper, we first investigate the security of key agreement protocols when randomness fails. Then we define the security model for nonce-based key agreement protocols and propose a nonce-based key agreement protocol that protects against bad randomness. The new protocol is proven to be secure in our proposed security model.

Notes on the security of certificateless aggregate signature schemes

2014 ◽  
Vol 287 ◽  
pp. 32-37 ◽  
Author(s):  
Futai Zhang ◽  
Limin Shen ◽  
Ge Wu
Keyword(s):  
Signature Schemes ◽  
Aggregate Signature

An Efficient and Secure Certificateless Aggregate Signature From Bilinear Maps

2021 ◽  
pp. 927-946
Author(s):  
Pankaj Kumar ◽  
Vishnu Sharma ◽  
Gaurav Sharma ◽  
Tarunpreet Bhatia
Keyword(s):  
Information Security ◽  
Mathematical Proof ◽  
Performance Comparison ◽  
Signature Scheme ◽  
Bilinear Maps ◽  
Security Attacks ◽  
Signature Schemes ◽  
Key Escrow ◽  
Aggregate Signature ◽  
Certificateless Signature

Certificateless signature schemes are a very intriguing aspect in information security because of its capability of removing the well-known key escrow problem predominately in ID-based cryptography. He et al. proposed an efficient certificateless aggregate signature scheme and proved that their scheme is secure against all possible types of security attacks. However, the authors still managed to find loopholes in the form of insecurities against ‘honest but curious' and ‘malicious but passive' attacks during cryptanalysis of He et al.'s scheme. The authors propose an efficient certificateless aggregate signature scheme which fills the security gaps in He et al.'s scheme and demonstrate the security in their scheme via a mathematical proof, and reinforce the fact that their scheme is much more efficient in a thorough performance comparison of their scheme against the previous schemes.

Sign in / Sign up

Export Citation Format

Share Document