A Novel Post-Quantum Blind Signature for Log System in Blockchain

Xu, Gang; Cao, Yibo; Xu, Shiyuan; Ke, Xiao; Liu, Xin; Chen, Xiu-Bo; Dong, Mianxiong

doi:10.32604/csse.2022.022100

Cited by 20 publications

(12 citation statements)

References 32 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some lattice based aggregate signatures have been proposed in [22,23]. Xu et al proposed a post-quantum blind signature in [24]. Quantum spin states can be used to construct hybrid cryptosystems and other schemes [25][26][27].…”

Section: Related Workmentioning

confidence: 99%

Code-based Sequential Aggregate Signature Scheme

Dou¹,

Xu²,

Yu³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

This paper proposes the first code-based quantum immune sequential aggregate signature (SAS) scheme and proves the security of the proposed scheme in the random oracle model. Aggregate signature (AS) schemes and sequential aggregate signature schemes allow a group of potential signers to sign different messages respectively, and all the signatures of those users on those messages can be aggregated into a single signature such that the size of the aggregate signature is much smaller than the total size of all individual signatures. Because of the aggregation of many signatures into a single short signature, AS and SAS schemes can reduce bandwidth and save storage; moreover, when a SAS is verified, not only the valid but also the order in which each signer signed can be verified. AS and SAS schemes can be applied to traffic control, banking transaction and military applications. Most of the existing AS and SAS schemes are based either on pairing or Rivest-Shamir-Adleman (RSA), and hence, can be broken by Shor's quantum algorithm for Integer Factoring Problem (IFP) and Discrete Logarithm Problem (DLP). There are no quantum algorithms to solve syndrome decoding problems. Hence, code-based cryptography is seen as one of the promising candidates for post-quantum cryptography. This paper shows how to construct quantum immune sequential aggregate signatures based on coding theory. Specifically, we construct our scheme with the first code based signature scheme proposed by Courtois, Finiasz and Sendrier (CFS). Compared to the CFS signature scheme without aggregation, the proposed sequential aggregate signature scheme can save about 90% storage when the number of signers is asymptotically large.

show abstract

Section: Related Workmentioning

confidence: 99%

Code-based Sequential Aggregate Signature Scheme

Dou¹,

Xu²,

Yu³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…) then return 0 else return 1 end if Lemma 4 [14,29,30] For V = {v ∈ R n : ||v|| < t}, b ∈ R n and σ ≥ 11||b||, a procedure will be run by sampling y ← D n σ and outputs Rej(z := y + b, b, σ ). Then the probability of returning 1 in Algorithm 1 is within 1 3 + 2 −100 .…”

Section: Discrete Gaussian Distribution and Rejection Samplingmentioning

confidence: 99%

Policy-Based Group Signature Scheme from Lattice

Tang¹,

Li²,

Ye³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Although the existing group signature schemes from lattice have been optimized for efficiency, the signing abilities of each member in the group are relatively single. It may not be suitable for complex applications. Inspired by the pioneering work of Bellare and Fuchsbauer, we present a primitive called policy-based group signature. In policy-based group signatures, group members can on behalf of the group to sign documents that meet their own policies, and the generated signatures will not leak the identity and policies of the signer. Moreover, the group administrator is allowed to reveal the identity of signer when a controversy occurs. Through the analysis of application scenarios, we concluded that the policy-based group signature needs to meet two essential security properties: simulatability and traceability. And we construct a scheme of policy-based group signature from lattice through techniques such as commitment, zero-knowledge proof, rejection sampling. The security of our scheme is proved to be reduced to the module short integer solution (MSIS) and module learning with errors (MLWE) hard assumptions. Furthermore, we make a performance comparison between our scheme and three lattice-based group signature schemes. The result shows that our scheme has more advantages in storage overhead and the sizes of key and signature are decreased roughly by 83.13%, 46.01%, respectively, compared with other schemes.

show abstract

“…In 2019, Le et al [25] designed the first blind ring signature algorithm based on the SIS problem with rejection sampling. Moreover, numerous lattice-based blind signature and ring signature schemes have been proposed [26,27].…”

Section: Introductionmentioning

confidence: 99%

A New Lattice-Based Blind Ring Signature for Completely Anonymous Blockchain Transaction Systems

Xie

Chen

Yang

2022

Security and Communication Networks

View full text Add to dashboard Cite

Blockchain technology has been widely applied in numerous industries with its decentralization, verifiability, distributivity, and immutability. However, the identity privacy security of blockchain users is facing serious threats because of the openness of traditional blockchain transaction information. Moreover, numerous traditional cryptographic algorithms used by blockchain transaction networks are difficult to attack quantum computing. In this paper, we propose a new lattice-based blind ring signature scheme in allusion to completely anonymous blockchain transaction systems. There into, the blind ring signature can implement the complete anonymity of user identity privacy in blockchain transactions. Meanwhile, lattice cryptography can availably resist quantum computing attacks. Firstly, the proposed signature scheme has strong computational security based on the small integer solution (SIS) problem and a high sampling success rate by utilizing the techniques of rejection sampling from bimodal Gaussian distribution. Secondly, the proposed signature scheme can satisfy the correctness and security under the random oracle model, including anonymity, blindness, and one-more unforgeability. Thirdly, we construct a blockchain transaction system based on the proposed blind ring signature algorithm, which realizes the completely anonymous and antiquantum computing security of the blockchain users’ identity privacy. Finally, the performance evaluation results show that our proposed blind ring signature scheme has lower latency, smaller key size, and signature size than other similar schemes.

show abstract

A Novel Post-Quantum Blind Signature for Log System in Blockchain

Cited by 20 publications

References 32 publications

Code-based Sequential Aggregate Signature Scheme

Code-based Sequential Aggregate Signature Scheme

Policy-Based Group Signature Scheme from Lattice

A New Lattice-Based Blind Ring Signature for Completely Anonymous Blockchain Transaction Systems

Contact Info

Product

Resources

About