中国剩余定理
可验证秘密共享
余数
方案(数学)
秘密分享
计算机科学
数学
算术
离散数学
拓扑(电路)
理论计算机科学
域代数上的
作者
Om Prakash Verma,Nitin Jain,Saibal K. Pal
标识
DOI:10.1007/s13369-019-03992-7
摘要
It is not always in the best interests to rely on an individual to have control of entire sensitive information. This has led to the need for secret sharing schemes, which divide secret (key) among many participants or shareholders. To avoid any cheating by any of the shareholders, the need for verifiable secret sharing (VSS) has emerged. In this context, a hybrid approach for VSS scheme is suggested in this paper. The proposed algorithm shares multiple secrets among shareholders, where shareholders are also divided/classified into different levels. Hence, it includes multiple as well as multilevel secret sharing. Secrets can be recovered at intra- or inter-level, where shareholders of higher level can contribute their shares to lower levels. To reduce the complexity, the one-way hash function is used instead of the hard number-theoretic problems. The proposed scheme stands against the dishonest dealer and shareholders. To rule out a typical dishonest strategy of leaking secret information in the valid shares, the concept of dealer leakage resilience is used by reducing the dealer’s powers of selecting random values on his own. The execution is also done using cryptographic libraries. Finally, it is demonstrated that the scheme satisfies the security requirements of VSS.
科研通智能强力驱动
Strongly Powered by AbleSci AI