2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC) 2020
DOI: 10.1109/compsac48688.2020.0-158
|View full text |Cite
|
Sign up to set email alerts
|

A Verifiable Secret Sharing Scheme without Using Multi-Party Computations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…It overcomes the shortcoming of bit similarity between the shared key and the target key and improves security. Makino et al [6] discussed a previous verifable secret-sharing scheme [7] and pointed out the necessity of multiparty computation to protect the sharing from malicious actors. Ten, they studied a new secretsharing scheme that can be verifed without the participation of multiple parties, and the security of verifcation is proved.…”
Section: Related Workmentioning
confidence: 99%
“…It overcomes the shortcoming of bit similarity between the shared key and the target key and improves security. Makino et al [6] discussed a previous verifable secret-sharing scheme [7] and pointed out the necessity of multiparty computation to protect the sharing from malicious actors. Ten, they studied a new secretsharing scheme that can be verifed without the participation of multiple parties, and the security of verifcation is proved.…”
Section: Related Workmentioning
confidence: 99%