Security of Verifiable Threshold Quantum Secret Sharing With Sequential Communication
نویسندگان
چکیده
منابع مشابه
A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method
Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The secu...
متن کاملAn efficient threshold verifiable multi-secret sharing
In 2004, C.-C. Yang, T.-Y. Chang and M.-S. Hwang proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir's secret sharing. In order to add the verifiable property into previous scheme, J. Shao and Z. Cao proposed an efficient (t,n) verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, ...
متن کاملVerifiable Secret Redistribution for Threshold Sharing Schemes
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m,n) access structures for threshold sharing schemes. Our protocol enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage. We observe that existing protocols either cannot be readily extended to allow redistribution between different access struct...
متن کاملVerifiable Secret Redistribution for Threshold Sharing Schemes
We present a new protocol for verifiably redistributing secrets from an (m,n) threshold sharing scheme to an (m′, n′) scheme. Our protocol guards against dynamic adversaries. We observe that existing protocols either cannot be readily extended to allow redistribution between different threshold schemes, or have vulnerabilities that allow faulty old shareholders to distribute invalid shares to n...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2941971