An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

Pilaram, Hossein; Eghlidos, Taraneh; Toluee, Rahim

doi:10.1049/ise2.12007

Cited by 9 publications

(6 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ALGORITHM 1 Committee selection stage. In order to validate the authenticity of the messages, we adopt the secp256k1 cryptography [35,36] instead of the threshold signature techniques [37,38], for the reason that secp256k1 encryption does not require key combining, which is more suitable for our algorithm to have better performance than the threshold signature techniques.…”

Section: Voting Stagementioning

confidence: 99%

FP‐BFT: A fast pipeline Byzantine consensus algorithm

Xin-lei

Liu

et al. 2023

IET Blockchain

View full text Add to dashboard Cite

The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency in the presence of malicious nodes. However, the BFT consensus algorithms are confronted with low efficiency and scalability problems caused by multiple rounds of handshake communication. In this paper, a pipeline‐based Fast Pipeline Byzantine Fault Tolerance consensus algorithm (FP‐BFT) is proposed, which adopts a non‐leader pipeline framework to process different rounds of transactions in parallel. By means of randomly selecting 2f+1 nodes to form a committee for one round of transactions, consensus agreement can be reached within the committee via nodes broadcasting and voting. Committee nodes participating in the consensus are chosen by chance to avoid the monopoly of which becomes the block producer. Consensus efficiency and the system throughput can be significantly improved with the pipeline framework. Comparison experiments are conducted to verify the superiority of the FP‐BFT algorithm, and the theoretical proof is given to guarantee the Byzantine fault‐tolerant security. Experimental results show that FP‐BFT has improved the consensus efficiency by decreasing communication overhead to make it better applied both in public blockchain and consortium blockchain systems.

show abstract

Section: Voting Stagementioning

confidence: 99%

FP‐BFT: A fast pipeline Byzantine consensus algorithm

Xin-lei

Liu

et al. 2023

IET Blockchain

View full text Add to dashboard Cite

show abstract

“…Lemma 1 [29] The approximate shortest vector problem and the approximate shortest linearly independent vector problem in lattice are polynomial time unsolvable. For , is a one-way anti-collision hash function, where is the dimension of the integer lattice and is a constant.…”

Section: Latticementioning

confidence: 99%

A Verifiable Multi-Secret Sharing Scheme Based on Short Integer Solution

Yan

Zhu

et al. 2023

Chinese J. Elect.

View full text Add to dashboard Cite

With the possible birth of the quantum computer, traditional secret sharing schemes have been unable to meet security requirements. We proposed a new verifiable multi-secret sharing scheme based on the short integer solution problem. By utilizing a symmetric binary polynomial, secrets and secret shares can be generated, and then we convert the secret shares into binary string on , which can be identified by one-way anti-collision hash function on the lattice, so that multiple secrets can be reconstructed safely. The advantages mainly focus on verifiability without interaction in the distribution phase and less memory requirement. In a secret sharing scheme, verifiability prevents the dealer to share the wrong shares and forces the participants to submit their shares correctly. Meanwhile, the interaction can be reduced, which means the security is improved. In a multi-secret sharing scheme, releasing the public values is inevitable, this paper has less public values and less size of shares per secret size to reduce the pressure of memory consumption in the proper parameters. In the end, it can also effectively resist the quantum attack.

show abstract

“…We choose (7), ( 9) and (10). After choosing 3 points, we use Lagrange basis polynomials and obtain (15), ( 16), (17). Therefore, applying (18) with ( 15), ( 16) and (17) we got (19).…”

Section: Proposed Approachmentioning

confidence: 99%

“…After choosing 3 points, we use Lagrange basis polynomials and obtain (15), ( 16), (17). Therefore, applying (18) with ( 15), ( 16) and (17) we got (19). As a result of (19), we successfully reconstruct original data (secret) 4311 with Shamir' Secret Scheme shown in (20).…”

Section: Proposed Approachmentioning

confidence: 99%

“…As a result of (19), we successfully reconstruct original data (secret) 4311 with Shamir' Secret Scheme shown in (20). Use finite field arithmetic with Shamir's Secret Scheme, provides perfect security [14] [17]. However, previous works shows that this system still need to be tested in real cloud environment with different file size, types and threshold values [18].…”

Section: Proposed Approachmentioning

confidence: 99%

See 1 more Smart Citation

Implementation of Shamir’s Secret Sharing Scheme in Cloud Computing

Karaoğlan¹,

Guneser²

2022

acperpro

View full text Add to dashboard Cite

With the increase in the use of cloud systems, security on cloud systems has become one of the most important items that underlined. Due to the nature of the cloud systems, it is difficult to manage multiuser systems and access control devices, resulting in some security vulnerabilities. In this paper we studied on Cloud Computing with Shamir's Secret Sharing Scheme with Advanced Encryption Standard (AES) algorithm for encryption and decryption process. For encryption and decryption process AES in Cryptool 1.4.41 has been used. For implementing Shamir Secret Sharing Scheme, Python language has been chosen and Spyder 3.8 has been chosen for environment. As a result, we successfully demonstrate the Shamir's Scheme implementation with file operations.

show abstract

An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing

Cited by 9 publications

References 45 publications

FP‐BFT: A fast pipeline Byzantine consensus algorithm

FP‐BFT: A fast pipeline Byzantine consensus algorithm

A Verifiable Multi-Secret Sharing Scheme Based on Short Integer Solution

Implementation of Shamir’s Secret Sharing Scheme in Cloud Computing

Contact Info

Product

Resources

About