Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2011, Vol. 37 ›› Issue (3): 124-125,128. doi: 10.3969/j.issn.1000-3428.2011.03.044

• Networks and Communications • Previous Articles     Next Articles

Verifiable Multi-secret Sharing Scheme on Elliptic Curves

ZHANG Yan-li, ZHANG Jian-zhong   

  1. (College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China)
  • Online:2011-02-05 Published:2011-01-28

椭圆曲线上的可验证多秘密共享方案

张艳丽,张建中   

  1. (陕西师范大学数学与信息科学学院,西安 710062)
  • 作者简介:张艳丽(1985-),女,硕士研究生,主研方向:密码学;张建中(通讯作者),教授、博士
  • 基金资助:
    国家自然科学基金资助项目(10571113);陕西省自然科学基金资助项目(2009JM8002);陕西省教育厅科学研究计划自然科学基金资助项目(07JK375, 2010JK829)

Abstract: This paper presents a verifiable multi-secret sharing scheme based on elliptic curves. In the scheme each participant chooses her/his shadow by her/himself, so the system does not need a secure channel. It is a multi-use scheme, which can share several secrets in one secret sharing process. The security of the proposed scheme is based on the security of the Elliptic Curve RSA cryptosystem(ECRSA) and the intractability of the Elliptic Curve Discrete Logarithm Problem(ECDLP).

Key words: multi-secret sharing, verifiable multi-secret sharing, Elliptic Curve RSA cryptosystem(ECRSA), Elliptic Curve Discrete Logarithm Problem(ECDLP)

摘要: 基于椭圆曲线提出一个可验证的多秘密共享方案。在该方案中每个参与者自己选择秘密份额,不需要安全信道,并且该方案是一个多次使用的方案,在一次加密过程中可以共享多个秘密。该方案的安全性基于椭圆曲线上RSA密码体制的安全性及椭圆曲线上离散对数问题的困难性。

关键词: 多秘密共享, 可验证的多秘密共享, 椭圆曲线RSA密码体制, 椭圆曲线离散对数问题

CLC Number: