Key-escrow free multi-signature scheme using bilinear pairings

2015 ◽  
Vol 7 (1) ◽  
Author(s):  
Manik Lal Das
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Basic Scheme ◽  
Signature Schemes ◽  
Key Escrow ◽  
Private Key ◽  
Secure Channel

AbstractWe present a multi-signature scheme based on bilinear pairings. The scheme is key escrow-free and does not require any secure channel for private key issuance to users. We use a binding-blinding technique to avoid the key escrow problem and to eliminate a secure channel requirement for the key issuance stage. The basic scheme is extended to sequential and parallel multi-signature schemes. We show that the basic scheme and multi-signature schemes are secure against adaptive chosen message attacks under standard assumptions.

Certificateless Short Signature Scheme from Bilinear Pairings

2013 ◽  
Vol 380-384 ◽  
pp. 2435-2438 ◽  
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.

ID-Based Deniable Ring Signature with Constant-Size Signature

2011 ◽  
Vol 255-260 ◽  
pp. 2192-2196
Author(s):  
Cheng Yu Hu ◽  
Peng Tao Liu
Keyword(s):  
Bilinear Pairings ◽  
The Other ◽  
Ring Size ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Constant Size ◽  
Identity Based ◽  
Verification Process

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.

scholarly journals Analysis of the complexity of attacks on multivariate cryptographic transformations using algebraic field structure

Radiotekhnika ◽  
2021 ◽  
pp. 59-65
Author(s):  
S.O. Kandiy ◽  
G.A. Maleeva
Keyword(s):  
Comprehensive Analysis ◽  
Field Structure ◽  
Quantum Computers ◽  
Signature Scheme ◽  
Algebraic Field ◽  
Signature Schemes ◽  
Electronic Signature ◽  
World Community ◽  
Private Key ◽  
Standardization Process

In recent years, interest in cryptosystems based on multidimensional quadratic transformations (MQ transformations) has grown significantly. This is primarily due to the NIST PQC competition [1] and the need for practical electronic signature schemes that are resistant to attacks on quantum computers. Despite the fact that the world community has done a lot of work on cryptanalysis of the presented schemes, many issues need further clarification. NIST specialists are very cautious about the standardization process and urge cryptologists [4] in the next 3 years to conduct a comprehensive analysis of the finalists of the NIST PQC competition before their standardization. One of the finalists is the Rainbow electronic signature scheme [2]. It is a generalization of the UOV (Unbalanced Oil and Vinegar) scheme [3]. Recently, another generalization of this scheme – LUOV (Lifted UOV) [5] was found to attack [6], which in polynomial time is able to recover completely the private key. The peculiarity of this attack is the use of the algebraic structure of the field over which the MQ transformation is given. This line of attack has emerged recently and it is still unclear whether it is possible to use the field structure in the Rainbow scheme. The aim of this work is to systematize the techniques used in attacks using the algebraic field structure for UOV-based cryptosystems and to analyze the obstacles for their generalization to the Rainbow scheme.

scholarly journals A Novel Anonymous Proxy Signature Scheme

2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Jue-Sam Chou
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Random Numbers ◽  
Signature Scheme ◽  
Signature Schemes

Recently, several studies about proxy signature schemes have been conducted. In 2009, Yu et al. proposed an anonymous proxy signature scheme attempting to protect the proxy signer's privacy from outsiders. They claimed that their scheme can make the proxy signer anonymous. However, based on our research, we determined that this was not the case and the proxy signer's privacy was not anonymous. Hence, in this paper, we propose a new anonymous proxy signature scheme that truly makes the proxy signer anonymous while making it more secure and efficient when compared with Yu et al.'s scheme. Our proxy signature scheme consists of two contributions. First, we mainly use random numbers and bilinear pairings to attain the anonymous property. Secondly, we increase the security and efficiency of our proxy in the design.

Applied-Information Technology in Certificateless Proxy Signature Scheme without Bilinear Pairings

2014 ◽  
Vol 685 ◽  
pp. 532-535
Author(s):  
Su Li Wang ◽  
Jun Yao Ye
Keyword(s):  
Information Technology ◽  
Finite Field ◽  
Discrete Logarithm ◽  
Bilinear Pairings ◽  
Proxy Signature ◽  
Hard Problem ◽  
Signature Scheme ◽  
Certificateless Cryptography ◽  
Key Escrow ◽  
The Hard Problem

This paper researches on the existing certificateless proxy signature scheme, there is almost no certificateless proxy signature scheme based on discrete logarithm up till now. Combining the knowledge of discrete logarithm over finite field and the advantages of certificateless cryptography, this paper proposes an efficient certificateless proxy signature scheme based on the discrete logarithm without bilinear pairings. To avoid the key escrow problem in the id-based cryptosystem and the saving certificate problem in the traditional public cryptography, meet the good properties of the proxy signature, such as unforgery, dependence of the proxy keys, distinguish of the proxy signature and anti-abuse. The scheme does not use the bilinear pairings, and based on the hard problem of discrete logarithm in the finite field, given the proof and discussion of the validity and security of the scheme.

A Provably Secure Certificate-Based Signature Scheme with Bilinear Pairings

2010 ◽  
Vol 439-440 ◽  
pp. 1271-1276 ◽  
Author(s):  
Jian Hong Zhang ◽  
Hua Chen ◽  
Yi Xian Yang
Keyword(s):  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Third Party ◽  
Maintenance Cost ◽  
Signature Scheme ◽  
Key Escrow ◽  
Identity Based ◽  
Provably Secure

Traditional public key cryptosystem (PKC) requires high maintenance cost for certificate management. Although, identity based cryptosystem (IBC) reduces the overhead of management, it suffers from the drawback of key escrow. Certificate-based cryptosystem solves certificate revocation problem and eliminate third party queries in the traditional PKI. In addition, it also solves the inherent key escrow problem in the IBC. In this paper, we proposed an efficient certificate-based signature and the result shows that the scheme is provable secure against two game attacks of certificate-based signature in the random oracle model. The security is closely related to the difficulty of solving the discrete logarithm problem.

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