Open-refreshing verifiable secret sharing scheme in asynchronous system
Verifiable secret-sharmg scheme is a basic primitive in cryptography, it has found numerous application to secure multi-party computation and threshold cryptosystems. However, the threshold may be corrupted in a longer operating period, refreshing shares are the main methods used to deal with this problem. Many proposed schemes have less efficient in computation and communication, and are -affected also by the communication model. In this paper, a new verifiable secret sharing is proposed via a public refreshing phrase. Contract to the other proposed schemes, it achieves both forward and backward, security, and it has high computational efficiency and can be applied to asynchronous communication model.
secret sharing threshold cryptosystem provable security asynchronous communication
Lin Nie Xinglan Zhang
School of Mechanical Engineering & Automatization North University of China Xueyuanlu No.3, Taiyuan, College of Computer Science and Technology Beijing University of Technology Pingleyuan 100, Beijing,
国际会议
重庆
英文
459-461
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）