A Verifiable Ring Signature Scheme Based on Multivariate Public-Key Cryptosystem

2013 ◽  
Vol 380-384 ◽  
pp. 1899-1902
Author(s):  
Ling Ling Wang
Keyword(s):  
Public Key ◽  
Quantum Computers ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Multivariate Public Key

Most existing verifiable ring signature schemes are based on traditional PKCs, which cannot resist future attacks of quantum computers. Fortunately, the MQ-problem based Multivariate Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a construction of verifiable ring signature based on MPKC, which has the properties of consistent, unforgery, signer-anonymity and verifiability.

A New Multivariate-Based Ring Signature Scheme

2013 ◽  
Vol 347-350 ◽  
pp. 2688-2692 ◽  
Author(s):  
Ling Ling Wang
Keyword(s):  
Discrete Logarithm ◽  
Public Key ◽  
Quantum Computers ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature

Most of the existing ring signature schemes are based on traditional cryptography, such as RSA and discrete logarithm. Unfortunately these schemes would be broken if quantum computers emerge. The MQ-problem based Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a new ring signature scheme based on MPKC, which has the properties of consistent, unforgery, signer-anonymity.

scholarly journals An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow

Cryptography ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 8 ◽  
Author(s):  
Le Luyen
Keyword(s):  
Quantum Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes.

scholarly journals Post quantum proxy signature scheme based on the multivariate public key cryptographic signature

2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091477
Author(s):  
Jiahui Chen ◽  
Jie Ling ◽  
Jianting Ning ◽  
Emmanouil Panaousis ◽  
George Loukas ◽  
...  
Keyword(s):  
General Scheme ◽  
Proxy Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Security Proof ◽  
Quantum Proxy Signature ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key ◽  
Chosen Message Attack

Proxy signature is a very useful technique which allows the original signer to delegate the signing capability to a proxy signer to perform the signing operation. It finds wide applications especially in the distributed environment where the entities such as the wireless sensors are short of computational power and needed to be convinced to the authenticity of the server. Due to less proxy signature schemes in the post-quantum cryptography aspect, in this article, we investigate the proxy signature in the post-quantum setting so that it can resist against the potential attacks from the quantum adversaries. A general multivariate public key cryptographic proxy scheme based on a multivariate public key cryptographic signature scheme is proposed, and a heuristic security proof is given for our general construction. We show that the construction can reach Existential Unforgeability under an Adaptive Chosen Message Attack with Proxy Key Exposure assuming that the underlying signature is Existential Unforgeability under an Adaptive Chosen Message Attack. We then use our general scheme to construct practical proxy signature schemes for three well-known and promising multivariate public key cryptographic signature schemes. We implement our schemes and compare with several previous constructions to show our efficiency advantage, which further indicates the potential application prospect in the distributed network environment.

scholarly journals Ring signature scheme based on multivariate public key cryptosystems

2011 ◽  
Vol 62 (10) ◽  
pp. 3973-3979 ◽  
Author(s):  
Shangping Wang ◽  
Rui Ma ◽  
Yaling Zhang ◽  
Xiaofeng Wang
Keyword(s):  
Public Key ◽  
Signature Scheme ◽  
Ring Signature ◽  
Public Key Cryptosystems ◽  
Multivariate Public Key

A Multivariate Blind Ring Signature Scheme

2019 ◽  
Vol 63 (8) ◽  
pp. 1194-1202 ◽  
Author(s):  
Dung Hoang Duong ◽  
Willy Susilo ◽  
Ha Thanh Nguyen Tran
Keyword(s):  
Real Life ◽  
Public Key Cryptography ◽  
The Other ◽  
Public Key ◽  
Signature Scheme ◽  
Ring Signature ◽  
Ring Signatures ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key ◽  
First Time

Abstract Blind signatures are an important and useful tool in designing digital cash schemes and electronic voting protocols. Ring signatures on the other hand provide the anonymity of the signer within the ring of users. In order to fit to some real-life applications, it is useful to combine both protocols to create a blind ring signature scheme, which utilizes all of their features. In this paper, we propose, for the first time, a post-quantum blind ring signature scheme. Our scheme is constructed based on multivariate public key cryptography, which is one of the main candidates for post-quantum cryptography.

scholarly journals Quantum Attacks on Bitcoin, and How to Protect Against Them

Ledger ◽  
2018 ◽  
Vol 3 ◽  
Author(s):  
Divesh Aggarwal ◽  
Gavin Brennen ◽  
Troy Lee ◽  
Miklos Santha ◽  
Marco Tomamichel
Keyword(s):  
At Risk ◽  
Quantum Computer ◽  
Alternative Proof ◽  
Quantum Computers ◽  
Signature Scheme ◽  
Area At Risk ◽  
Signature Schemes ◽  
Near Term ◽  
Financial Transactions ◽  
Large Quantum

The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk is cryptocurrencies, a market currently worth over 100 billion USD. We investigate the risk posed to Bitcoin, and other cryptocurrencies, by attacks using quantum computers. We find that the proof-of-work used by Bitcoin is relatively resistant to substantial speedup by quantum computers in the next 10 years, mainly because specialized ASIC miners are extremely fast compared to the estimated clock speed of near-term quantum computers. On the other hand, the elliptic curve signature scheme used by Bitcoin is much more at risk, and could be completely broken by a quantum computer as early as 2027, by the most optimistic estimates. We analyze an alternative proof-of-work called Momentum, based on finding collisions in a hash function, that is even more resistant to speedup by a quantum computer. We also review the available post-quantum signature schemes to see which one would best meet the security and efficiency requirements of blockchain applications.

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.

Sign in / Sign up

Export Citation Format

Share Document