scholarly journals Digital signature schemes with strong existential unforgeability

F1000Research ◽  
2021 ◽  
Vol 10 ◽  
pp. 931
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Digital Signature ◽  
Research Community ◽  
Security Model ◽  
Signature Schemes ◽  
Future Directions ◽  
Future Design ◽  
Design Considerations ◽  
Identity Based ◽  
Chosen Message Attack ◽  
Security Notion

Digital signature schemes (DSS) are ubiquitously used for public authentication in the infrastructure of the internet, in addition to their use as a cryptographic tool to construct even more sophisticated schemes such as those that are identity-based. The security of DSS is analyzed through the existential unforgeability under chosen message attack (EUF-CMA) experiment which promises unforgeability of signatures on new messages even when the attacker has access to an arbitrary set of messages and their corresponding signatures. However, the EUF-CMA model does not account for attacks such as an attacker forging a different signature on an existing message, even though the attack could be devastating in the real world and constitutes a severe breach of the security system. Nonetheless, most of the DSS are not analyzed in this security model, which possibly makes them vulnerable to such an attack. In contrast, a better security notion known as strong EUF-CMA (sEUF-CMA) is designed to be resistant to such attacks. This review aims to identify DSS in the literature that are secure in the sEUF-CMA model. In addition, the article discusses the challenges and future directions of DSS. In our review, we consider the security of existing DSS that fit our criterion in the sEUF-CMA model; our criterion is simple as we only require the DSS to be at least secure against the minimum of existential forgery. Our findings are categorized into two classes: the direct and indirect classes of sEUF-CMA. The former is inherently sEUF-CMA without any modification while the latter requires some transformation. Our comprehensive  review contributes to the security and cryptographic research community by discussing the efficiency and security of DSS that are sEUF-CMA, which aids in selecting robust DSS in future design considerations.

scholarly journals A Fully Adaptively Secure Threshold Signature Scheme Based on Dual-Form Signatures Technology

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yuanju Gan
Keyword(s):  
Digital Signature ◽  
Vector Spaces ◽  
Signature Scheme ◽  
Threshold Signature ◽  
Signature Schemes ◽  
Dual Form ◽  
The Standard Model ◽  
Chosen Message Attack ◽  
Security Notion ◽  
Attack Models

In t , n threshold signature schemes, any subset of t participants out of n can produce a valid signature, but any fewer than t participants cannot. Meanwhile, a threshold signature scheme should remain robust and unforgeable against up to t − 1 corrupted participants. This nonforgeability property is that even an adversary breaking into up to t − 1 participants should be unable to generate signatures on its own. Existential unforgeability against adaptive chosen message attacks is widely considered as a standard security notion for digital signature, and threshold signature should also follow this accordingly. However, there are two special attack models in a threshold signature scheme: one is the static corruption attack and the other is the adaptive corruption attack. Since the adaptive corruption model appears to better capture real threats, designing and proving threshold signature schemes secure in the adaptive corruption model has been focused on in recent years. If a threshold signature is secure under adaptive chosen message attack and adaptive corruption attack, we say it is fully adaptively secure. In this paper, based on the dual pairing vector spaces technology, we construct a threshold signature scheme and use Gerbush et al.’s dual-form signatures technology to prove our scheme, which is fully adaptively secure in the standard model, and then compare it to other schemes in terms of the efficiency and computation.

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.

scholarly journals The Implementation Results of Identity-Based Hashing Algorithm for Iot

2019 ◽  
Vol 8 (11) ◽  
pp. 4249-4252
Keyword(s):  
Digital Signature ◽  
Public Key Cryptography ◽  
Public Key ◽  
Light Weight ◽  
Mobile Environment ◽  
Signature Schemes ◽  
Iot Security ◽  
Identity Based ◽  
Hashing Algorithm ◽  
Constrained Devices

Nonrepudiation in Mobile environment is a major challenge in the area of IoT security. Public-key-based Digital Signature schemes are common and their computational requirements and complexities do not support constrained devices. This paper presents the design and implementation results of light weight nonrepudiation architecture based on public key cryptography and Elliptic Curve addition to reduce the overhead of processing and communication

Identity-Based Proxy Signcryption Schemes

2013 ◽  
Vol 380-384 ◽  
pp. 2605-2608
Author(s):  
Jian Wu
Keyword(s):  
Digital Signature ◽  
Computational Cost ◽  
Proxy Signature ◽  
Single Step ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based Encryption ◽  
Encryption Schemes ◽  
Identity Based ◽  
Digital Signature Scheme

Identity-based encryption and signature schemes that allow any pair of users to communicate securely and to verify each other's signatures without verifying certificate. A signcryption is a primitive that provides the properties of both digital signatures and encryption schemes in a way that is more efficient than signing and encrypting separately. Proxy signature schemes are a variation of ordinary digital signature scheme that allow a proxy signer to sign messages on behalf of the original singer which proxy signcryption simultaneously fulfill both the functions of signature and encryption in a single step with a lower computational cost than that required by the traditional signature-then-encryption. In this paper, we present identity-based proxy signcryption schemes with lower efficient..

Post-quantum digital signature schemes: setting a hidden group with two-dimensional cyclicity

2020 ◽  
Vol 4 ◽  
pp. 75-82
Author(s):  
D.Yu. Guryanov ◽  
◽  
D.N. Moldovyan ◽  
A. A. Moldovyan ◽  
Keyword(s):  
Associative Algebra ◽  
Digital Signature ◽  
Quantum Signature ◽  
Commutative Group ◽  
Two Dimensional ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Fixed Element ◽  
Commutative Associative Algebra ◽  
Quantum Digital Signature

For the construction of post-quantum digital signature schemes that satisfy the strengthened criterion of resistance to quantum attacks, an algebraic carrier is proposed that allows one to define a hidden commutative group with two-dimensional cyclicity. Formulas are obtained that describe the set of elements that are permutable with a given fixed element. A post-quantum signature scheme based on the considered finite non-commutative associative algebra is described.

Sign in / Sign up

Export Citation Format

Share Document