期刊文献+

Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme 被引量:1

Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
原文传递
导出
摘要 In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement. In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement.
出处 《Science China Mathematics》 SCIE 2013年第7期1385-1401,共17页 中国科学:数学(英文版)
基金 supported by National Natural Science Foundation of China(Grant No.60970152) IIE's Research Project on Cryptography(Grant No.Y3Z0011102) the Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDA06010701) National Key Basic Research Program of China(973 Program)(Grant No.2011CB302400)
关键词 identity-based encryption Fujisaki-Okamoto transformation provable security cascading reduction 可证明安全性 加密方案 富兰克林 安全性分析 散列函数 哈希函数 松紧程度 IBE
  • 相关文献

参考文献25

  • 1Abdalla M, Bellare M, Catalano D, et al. Searchable encryption revisited: Consistency properties, relation to anony- mous ibe, and extensions. In: Lecture Notes in Computer Science, vol. 3621. Berlin: Springer, 2005, 205-222.
  • 2Bellare M, Ristenpart T. Simulation without the artificial abort: Simplified proof and improved concrete security for waters' IBE scheme. In: Lecture Notes in Computer Science, vol. 5479. Berlin: Springer, 2009, 407-424.
  • 3Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In: Proceeding CCS'93 Proceedings of the 1st ACM conference on Computer and communications security. New York: Association for Computing Machinery, 1993 62-73.
  • 4Bellare M, Rogaway P. The exact security of digital signatures - how to sign with RSA and rabin. In: Lecture Notes in Computer Science, vol. 1070. Berlin: Springer, 1996, 399-416.
  • 5Bellare M, Rogaway P. Minimizing the use of random oracles in authenticated encryption schemes. In: Lecture Notes in Computer Science, vol. 1334. London: Springer-Verlag, 1997, 1-16.
  • 6Boneh D, Franklin M. Identity-based encryption from the weil pairing. In: Lecture Notes in Computer Science, vol. 2139. Berlin: Springer, 2001, 213-229.
  • 7Boneh D, Franklin M. Identity-based encryption from the well pairing. SIAM J Comput, 2003, 32:586-615.
  • 8Boyen X. Multipurpose identity-based signcryption-a swiss army knife for identity-based cryptography. In: Lecture Notes in Computer Science, vol. 2729. Berlin: Springer, 2003, 383-399.
  • 9Carter L, Wegman M N. Universal classes of hash functions. J Comput Syst Sci, 1979, 18:143-154.
  • 10Chen L, Cheng Z H. Security proof of sakai-kasahara's identity-based encryption scheme. In: Lecture Notes in Com- puter Science, vol. 3796. Berlin: Springer, 2005, 442-459.

同被引文献8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部