Fair secret sharing scheme using asymmetric bivariate polynomial
In Shamir's (t,n) secret sharing scheme,any m (m≥t) participants can reconstruct the secret,and any less than t participants can't get any information about the secret.However,if there are more than t participants in the secret reconstruction phase,Shamir's secret reconstruction phase...
Saved in:
Main Authors: | Wenwei YANG, Yuqing XING |
---|---|
Format: | Article |
Language: | English |
Published: |
POSTS&TELECOM PRESS Co., LTD
2019-02-01
|
Series: | 网络与信息安全学报 |
Subjects: | |
Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2019003 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Novel and effective secret sharing scheme
by: Run-hua SHI, et al.
Published: (2012-01-01) -
Cloud outsourcing secret sharing scheme against covert adversaries
by: En ZHANG, et al.
Published: (2017-05-01) -
(t, n) threshold secret sharing scheme without SDC
by: ZHOU Fu-cai, et al.
Published: (2006-01-01) -
Provably secure secret sharing scheme based on bilinear maps
by: LI Hui-xian1, et al.
Published: (2008-01-01) -
Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
by: Ryutaroh Matsumoto
Published: (2025-01-01)