Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (5): 13-17.doi: 10.13190/jbupt.200805.13.322

• Papers • Previous Articles     Next Articles

Proactive and Publicly Verifiable Server-Assisted Secret Sharing

YU Jia1,HAO Rong1,2,KONG Fan-yu2, LI Xu-liang1,2   

  1. 1.College of Information Engineering, Qingdao University, Qingdao 266071,China; 2.Institute of Network Security, Shandong University, Jinan 250100, China)
  • Received:2007-12-31 Revised:1900-01-01 Online:2008-10-30 Published:2008-10-30
  • Contact: YU Jia

Abstract:

How to protect the security of secret keys is an important problem of security. A proactive and publicly verifiable server-assisted secret sharing scheme is proposed. The secret in this scheme is publicly verifiably shared between a user and a group of servers, and the secret reconstruction is activated by the user. Another important trait of the scheme is that it has two-side initial proactive property, that is, the shares of the user and servers will be renewed in each time period and the renewal operation is initiated by the cooperation of the user and servers. This will make the scheme very fair and make it difficult for an adversary to compromise the secret.

Key words: proactive secret sharing, publicly verifiable secret sharing, server-assisted cryptosystem

CLC Number: