scholarly journals DiLizium: A Two-Party Lattice-Based Signature Scheme

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 989
Author(s):  
Jelizaveta Vakarjuk ◽  
Nikita Snetkov ◽  
Jan Willemson
Keyword(s):  
Quantum Signature ◽  
Public Key ◽  
Full Detail ◽  
Design Rationale ◽  
Signature Scheme ◽  
Future Studies ◽  
The Public ◽  
Security Proof ◽  
Learning With Errors ◽  
Performance Estimates

In this paper, we propose DiLizium: a new lattice-based two-party signature scheme. Our scheme is constructed from a variant of the Crystals-Dilithium post-quantum signature scheme. This allows for more efficient two-party implementation compared with the original but still derives its post-quantum security directly from the Module Learning With Errors and Module Short Integer Solution problems. We discuss our design rationale, describe the protocol in full detail, and provide performance estimates and a comparison with previous schemes. We also provide a security proof for the two-party signature computation protocol against a classical adversary. Extending this proof to a quantum adversary is subject to future studies. However, our scheme is secure against a quantum attacker who has access to just the public key and not the two-party signature creation protocol.

scholarly journals A novel method for developing post-quantum cryptoschemes and a practical signature algorithm

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Nikolay Andreevich Moldovyan ◽  
Dmitriy Nikolaevich Moldovyan
Keyword(s):  
Digital Signature ◽  
Practical Purpose ◽  
Multiplicative Group ◽  
Quantum Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Associative Algebras ◽  
Content Type ◽  
The Public ◽  
Public Keys

PurposeThe practical purpose of this research is to propose a candidate for post-quantum signature standard that is free of significant drawback of the finalists of the NIST world competition, which consists in the large size of the signature and the public key. The practical purpose is to propose a fundamentally new method for development of algebraic digital signature algorithms.Design/methodology/approachThe proposed method is distinguished by the use of two different finite commutative associative algebras as a single algebraic support of the digital signature scheme and setting two different verification equation for a single signature. A single public key is computed as the first and the second public keys, elements of which are computed exponentiating two different generators of cyclic groups in each of the algebras.FindingsAdditionally, a scalar multiplication by a private integer is performed as final step of calculation of every element of the public key. The same powers and the same scalar values are used to compute the first and the second public keys by the same mathematic formulas. Due to such design, the said generators are kept in secret, providing resistance to quantum attacks. Two new finite commutative associative algebras, multiplicative group of which possesses four-dimensional cyclicity, have been proposed as a suitable algebraic support.Originality/valueThe introduced method is novel and includes new techniques for designing algebraic signature schemes that resist quantum attacks. On its base, a new practical post-quantum signature scheme with relatively small size of signature and public key is developed.

scholarly journals Candidate for practical post-quantum signature scheme

2020 ◽  
Vol 16 (4) ◽  
pp. 455-461
Author(s):  
Nikolay A. Moldovyan ◽  
◽  
Alexandr A. Moldovyan ◽  
Keyword(s):  
Discrete Logarithm ◽  
Quantum Signature ◽  
Public Key ◽  
Signature Verification ◽  
Signature Scheme ◽  
The Public ◽  
Cyclic Groups ◽  
Commutative Associative Algebra ◽  
Computational Intractability ◽  
New Criterion

A new criterion of post-quantum security is used to design a practical signature scheme based on the computational complexity of the hidden discrete logarithm problem. A 4-dimensional finite non-commutative associative algebra is applied as algebraic support of the cryptoscheme. The criterion is formulated as computational intractability of the task of constructing a periodic function containing a period depending on the discrete logarithm value. To meet the criterion, the hidden commutative group possessing the 2-dimensional cyclicity is exploited in the developed signature scheme. The public-key elements are computed depending on two vectors that are generators of two different cyclic groups contained in the hidden group. When computing the public key two types of masking operations are used: i) possessing the property of mutual commutativity with the exponentiation operation and ii) being free of such property. The signature represents two integers and one vector S used as a multiplier in the verification equation. To prevent attacks using the value S as a fitting element the signature verification equation is doubled.

A Mobile Coalition Key-Evolving Digital Signature Scheme for Wireless/Mobile Networks

2011 ◽  
pp. 285-311
Author(s):  
Quanxing Zhang ◽  
Chwan-Hwa Wu ◽  
J. David Irwin
Keyword(s):  
Mobile Networks ◽  
Digital Signature ◽  
Mobile Ip ◽  
Public Key ◽  
Signature Scheme ◽  
The Public ◽  
New States ◽  
Dynamic Path ◽  
The Individual ◽  
Digital Signature Scheme

A scheme is proposed in this chapter to apply a secure digital signature scheme in a mobile-IP environment and treats the three entities in a dynamic path as either foreign agents (FA), home agents (HA) or mobile agents (MA), such that a coalition is formed containing each of the individual agents. Each agent has a pair of keys: one private and one public. The private key is evolving with time, and the public key is signed by a certification authority (CA). All the private keys of the three agents in the coalition are needed to sign a signature. Furthermore, all the messages are signed and verified. The signature is verified against a public key, computed as the product of the public keys of all three agents, and readily generated when a new dynamic path is formed. In addition, the key-evolving scheme prevents an adversary from forging past signatures under any circumstances. As a result of the schemes’ proactive refresh capability, an adversary must simultaneously compromise each MA, FA and HA in order to forge future signatures. When a new dynamic path is formed or private keys evolve to new states, an interactive, proactive synchronization scheme is employed among the agents. Thus, the loss of a mobile device, or its information, will cause minimal information damage.

scholarly journals Provably Secure Lattice-Based Self-Certified Signature Scheme

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Qiang Yang ◽  
Daofeng Li
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Communication Overhead ◽  
Small Integer ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Security Technologies

Digital signatures are crucial network security technologies. However, in traditional public key signature schemes, the certificate management is complicated and the schemes are vulnerable to public key replacement attacks. In order to solve the problems, in this paper, we propose a self-certified signature scheme over lattice. Using the self-certified public key, our scheme allows a user to certify the public key without an extra certificate. It can reduce the communication overhead and computational cost of the signature scheme. Moreover, the lattice helps prevent quantum computing attacks. Then, based on the small integer solution problem, our scheme is provable secure in the random oracle model. Furthermore, compared with the previous self-certified signature schemes, our scheme is more secure.

Public-key quantum signature based on phase shift operation

2020 ◽  
Vol 34 (06) ◽  
pp. 2050084
Author(s):  
Huawang Qin ◽  
Hao Xu ◽  
Wallace K. S. Tang
Keyword(s):  
Phase Shift ◽  
Quantum State ◽  
Quantum Signature ◽  
Public Key ◽  
Unitary Operation ◽  
Bell Measurement ◽  
The Public ◽  
Private Key

A public-key quantum signature (QS) scheme is proposed, in which the phase shift is the private key and the quantum state after the phase shift operation is the public key. The signatory uses the private key to encode the quantum state, and uses the Bell measurement to generate the signature. The receiver performs the unitary operation according to the signature, and then compares the quantum state with the public key to verify the signature. Our scheme does not need a trusted arbitrator, and the signature can be verified by the receiver publicly. Compared to the existing arbitrated QS scheme, our scheme will be more practical.

Key Replacement Attack on Two Certificateless Signature Schemes without Random Oracles

2010 ◽  
Vol 439-440 ◽  
pp. 1606-1611 ◽  
Author(s):  
Qi Xia ◽  
Chun Xiang Xu ◽  
Yong Yu
Keyword(s):  
Standard Model ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Random Oracles ◽  
The Standard Model ◽  
Replacement Attack ◽  
Certificateless Signature

Liu et al. proposed the first certificateless signature scheme without random oracles in 2007. However, Xiong et al. showed that Liu et al.'s scheme is insecure against a malicious-but-passive KGC attack and proposed an improved scheme. In ISA 2009, Yuan et al. also proposed a new certificateless signature scheme without random oracles. Although they claimed that the two schemes are secure in the standard model, this paper shows that both Xiong et al.'s improved scheme and Yuan et al.'s new scheme are vulnerable to key replacement attack, where an adversary, obtaining a signature on a message and replacing the public key of a signer, can forge valid signatures on the same message under the replaced public key. We also give the corresponding modifications of the two schemes to resist key replacement attack.

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.

Security Analysis and the Improvement of Multi-Proxy Multi-Signature Scheme

2014 ◽  
Vol 513-517 ◽  
pp. 1680-1683
Author(s):  
Xing Hua Zhang
Keyword(s):  
Security Analysis ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Efficient Scheme ◽  
Delegation Of Powers

Many original signers can put a delegation of powers to many proxy signers, it is a representation of all the original signers to generate a plurality of proxy signers in the multi-proxy multi-signature scheme. It is analyzed to the existing multi-proxy multi-signature schemes in this paper , the verification equation is improved. A new secure and efficient scheme is proposed. The security analysis shows that the verification equations of the new scheme is more safe. The new scheme can resist the public-key substitution attack, can resist the coalition attack.

A Provably Secure Certificateless Proxy Signature Scheme Against Malicious-But-Passive KGC Attacks

2019 ◽  
Vol 63 (8) ◽  
pp. 1139-1147
Author(s):  
Wenjie Yang ◽  
Jian Weng ◽  
Xinyi Huang ◽  
Anjia Yang
Keyword(s):  
Standard Model ◽  
Proxy Signature ◽  
Public Key ◽  
Key Generation ◽  
Signature Scheme ◽  
Interesting Problem ◽  
System Parameters ◽  
Security Proof ◽  
The Standard Model ◽  
Provably Secure

Abstract In certificateless proxy signature (CLPS), the key generation center is responsible for initializing the system parameters and can obtain the opportunity to adaptively set some trapdoors in them when wanting to launch some attacks. Until now, how to withstand the malicious-but-passive key generation center (MKGC) attacks in CLPS is still an interesting problem. In this paper, we focus on the challenging issue and introduce a CLPS scheme provably secure in the standard model. To the best of our knowledge, we are the first to demonstrate its security under MKGC attacks by adopting the technology of embedding the classic difficulty problems into the target entity public key rather than the system parameters during the security proof process.

Sign in / Sign up

Export Citation Format

Share Document