2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC) 2020
DOI: 10.1109/isceic51027.2020.00008
|View full text |Cite
|
Sign up to set email alerts
|

Verifiable Secret Sharing Scheme Using Merkle Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…A Verifiable Secret Sharing schema with cheater identification has been discussed in [12]. The advantage of the proposed systems, compared to others like [13], [14], is the ability to discover the corrupted shares before secret recomposition, thus reducing the computation time required to rebuild the secret.…”
Section: Secret Share (Ss)mentioning
confidence: 99%
“…A Verifiable Secret Sharing schema with cheater identification has been discussed in [12]. The advantage of the proposed systems, compared to others like [13], [14], is the ability to discover the corrupted shares before secret recomposition, thus reducing the computation time required to rebuild the secret.…”
Section: Secret Share (Ss)mentioning
confidence: 99%
“…When verifying whether the leaf node has changed, you only need to compare the correctness of the root node value. The security of the Merkle tree itself mainly depends on the security of the hash function, and the security properties such as one-way irreversibility and non-collision of hash function have long been proved, which ensures that the application of Merkle tree based on hash function is much secure and practical [ 27 ]. An enclave container can be created in the software guard extensions (SGX), and confidentiality and integrity of the code and data are secured against malicious software.…”
Section: System Modelmentioning
confidence: 99%