期刊文献+

适应性选择密文安全的可公开验证加密方案 被引量:1

Adaptively-chosen ciphertext secure and publicly verifiable encryption scheme
下载PDF
导出
摘要 在密钥托管、电子公平交易、可公开分享和安全多方计算中,对可公开验证加密有广泛的应用需求,但是已有的可公开验证加密方案或者是选择明文安全的,或者是在随机预言机模下是选择密文安全的,显然不满足诸多复杂应用环境的安全需求。在对已有可公开验证方案的分析和现实应用需求的基础上,结合CS加密方案,利用非交互性零知识证明协议提出了一个新的可公开验证的加密方案,新方案使得除发送方和接收方外的任何第三方都可以验证密文的有效性,且不会泄露消息的其他任何信息。最后,相对于随机预言机模型,在标准模型下证明了新方案是适应性选择密文安全的。 There is a great demand for publicly verifiable encryption in key escrow,optimistic fair exchange,publicly verifiable secret sharing and secure multiparty computation,but the current schemes are either chosen plaintext secure or chosen ciphertext secure in the random oracle model,which obviously are not secure enough to be applied in the complicated circumstances.Based on the analysis of the current schemes and application of the reality,this paper proposed a new publicly verifiable encryption scheme by combining the CS encryption scheme with the non-interactive zero knowledge proof protocol.The new scheme enabled any third party other than the sender and receiver to verify the validity of the ciphertext,but leaked no information about the message.Finally,without using the random oracle,the adaptively chosen ciphertext security of the scheme is proved in the standard model.
出处 《计算机应用》 CSCD 北大核心 2013年第4期1051-1054,共4页 journal of Computer Applications
基金 国家自然科学基金资助项目(61272492 61103231 61103230)
关键词 可公开验证 CS方案 零知识证明协议 标准模型 适应性选择密文安全 publicly verifiable CS scheme zero knowledge proof protocol standard model adaptively chosen ciphertext security
  • 相关文献

参考文献15

  • 1POUPARD G, STERN J. Fair encryption of RSA keys[ C]// EN- ROCRYPT'00, LNCS 1807.
  • 2YOUNG A, YUNG M. Auto-recoverable auto-certifiable cryptosys- tems[C]// EUROCRYPT' 98, LNCS 1403. Berlin: Springer-Ver- lag, 1998:17 -31.
  • 3STADLER M . Publicly verifiable secret sharing [ C ] / / EURO - CRYPT' 96, LNCS 1070. Berlin: Springer-Verlag, 1996:191 - 199.
  • 4CAMENISHCH J, MAURER U, STADLER M. Digital payment systems with passive anonymity revoking trustees[ C]// Computer Security-ESORICS' 96, LNCS 1146. Berlin: Springer-Verlag, 1996:33 - 43.
  • 5FRANKEL Y, TSIOUNIS Y, YUNG M. Indirect discourse proofs: achieving efficient fair on-line e-cash[ C]//ASIACRYPT' 96, LNCS 1163. Berlin: Springer-Verlag, 1996:68-82.
  • 6BELLARE M, GOLDWASSER S. Encapsulated key escrow, TR688 [ R]. Cambridge: MIT Laboratory for Computer Science, 1996.
  • 7ASOTAN N, SHOUP V, WAIDNER M. Optimistic fair exchange of digital signatures[ J]. IEEE Journal on Selected Areas in Communi- cations, 2000, 18(4): 591-610.
  • 8伍前红,王继林,袁素春,王育民.可公开验证的ElGamal/RSA加密[J].电子与信息学报,2005,27(4):608-611. 被引量:2
  • 9CANETrI R, GOLDREICH O, HALEVI S. The random oracle methodology, revisited[ J]. Journal of the ACM, 2004, 51 (4) : 557 - 594.
  • 10NIETO J M G, MANULIS M, POETTERING B, et al. Publicly verifiable ciphertexts[ C]// SCN'12: Proceedings of the 8th Inter- national Conference on Security and Cryptography for Networks, LNCS 7485. Bedim Springer-Verlag, 2012:393-410.

二级参考文献40

  • 1Chaum D, Pederscn T R. Wallet databases with observers. In CRYPTO'92, Florida, America, Springer-Verlag. LNCS, 1993,vol.740:89 - 105.
  • 2Stadler M. Publicly verifiable secret sharing. In EUROCRYPT'96, Brussels, Belgium, Springer Verlag, LNCS,1996, vol. 1070:191 - 199.
  • 3Asokan N, Shoup V, Waidner M. Optimistic fair exchange of digital signatures. In EUROCRYPT'98, Paris, France, Springer Verlag, LNCS, 1998, vol. 1403:591 - 606.
  • 4Camenisch J, Maumr U, Stadler M. Digital payment systems with passive anonymity revoking trustees. In Computer Security-ESORICS'96, Berlin, German, Springer-Verlag, LNCS,1996, vol.1146:33 - 43.
  • 5Frankel Y, Tsiounis Y, Yung M. Indirect discourse proofs:achieving efficient fair on-line e-cash. In ASIACRYPT'96,Tokyo, Japan, Springer-Verlag, LNCS, 1996, vol. 1163:68 - 82.
  • 6Poupard G, Stem J. Fair encryption of RSA keys. In EUROCRYPT'00, Springer-Verlag, LNCS, 2000, vol. 1807:173- 189.
  • 7Young A, Yung M. Auto-recoverable auto-certifiable cryptosystems. In EUROCRYPT'98, Paris, France, Springer Verlag, LNCS, 1998, vol. 1403:17 - 31.
  • 8Fujisaki, E., Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO'97, Francisco,America, Springer Verlag, LNCS, 1997, vol. 1294:16 - 30.
  • 9Bellare M, Neven G. Transitive signatures based on factoring and RSA. In: Zheng Y, ed. Proc. of the Advances in CryptologyASIACRYPT 2002. LNCS 2501, Berlin, Heidelberg: Springer-Verlag, 2002. 397-4 14.
  • 10Goh EJ, Jarecki S. A signature scheme as secure as the Diffie-Hellman problem. In: Biham E, ed. Proc. of the Advances in Cryptology-EUROCRYPT 2003. LNCS 2656, Berlin, Heidelberg: Springer-Verlag, 2003. 401-415.

共引文献102

同被引文献9

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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