计算机工程2011，Vol.37Issue(3)：124-125,128,3.DOI:10.3969/j.issn.1000-3428.2011.03.044
椭圆曲线上的可验证多秘密共享方案
Verifiable Multi-secret Sharing Scheme on Elliptic Curves
摘要
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).关键词
多秘密共享/可验证的多秘密共享/椭圆曲线RSA密码体制/椭圆曲线离散对数问题Key words
multi-secret sharing/ verifiable multi-secret sharing/ Elliptic Curve RSA cryptosystem(ECRSA)/ Elliptic Curve Discrete Logarithm Problem(ECDLP)分类
信息技术与安全科学引用本文复制引用
张艳丽,张建中..椭圆曲线上的可验证多秘密共享方案[J].计算机工程,2011,37(3):124-125,128,3.基金项目
国家自然科学基金资助项目(10571113) （10571113）
陕西省自然科学基金资助项目(2009JM8002) （2009JM8002）
陕西省教育厅科学研究计划自然科学基金资助项目(07JK375,2010JK829) （07JK375,2010JK829）
