Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (12): 75-77.DOI: 10.3778/j.issn.1002-8331.2009.12.025

• 网络、通信、安全 • Previous Articles     Next Articles

Study on provable security scheme of ID-based threshold decryption

WANG Xue-guang   

  1. School of Information Science and Technology,East China University of Political Science and Law,Shanghai 201620,China
  • Received:2009-01-15 Revised:2009-02-16 Online:2009-04-21 Published:2009-04-21
  • Contact: WANG Xue-guang

可证安全的身份门限解密机制研究

王学光   

  1. 华东政法大学 信息科学技术学院,上海 201620
  • 通讯作者: 王学光

Abstract: This paper presents an ID-based threshold decryption scheme based on works of Boneh and Boyen,which can be proved to be secure without random oracles.It is validated that it has ID-based adaptive chosen ciphertext security on solving decisional (tqε)-BDHI problem assumption.

Key words: provable security, ID based cryptography, threshold decryption

摘要: 通过对以往门限解密机制的研究,在Boneh和Boyen工作的基础上,提出了一个在标准模型下可证安全的基于身份的门限解密机制。并在解决判定性(tqε)-BDHI困难问题假设基础上,证明此机制在标准模型下是指定身份适应性选择密文安全的。

关键词: 可证安全, 基于身份加密, 门限解密