Server-Aided Multi-Secret Sharing Scheme for Weak Computational Devices

In the setting of (t, n) threshold secret sharing, at least t parties can reconstruct the secret, and fewer than t parties learn nothing about the secret. However, to achieve fairness, the existing secret sharing schemes either assume a trusted party exists or require running multi-round, which is n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers, materials & continua materials & continua, 2018, Vol.56 (3), p.401
Hauptverfasser: Zhang, En, Duan, Xintao, Yiu, Siuming, Fang, Junbin, Jiang, Zoe L, HonYuen, Tsz, Peng, Jie
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!