...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >Signcryption with Non-interactive Non-repudiation
【24h】

Signcryption with Non-interactive Non-repudiation

机译：非交互不可否认的签密

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Signcryption is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a composition of public key encryption and public key signature. We present a model of security for Signcryption schemes that offer non-interactive non-repudiation. This is non-repudiation in which the judge settling a repudiation dispute does not have to get involved in an interactive zero-knowledge proof. Our model applies to many existing schemes in the literature Bao and Deng, He and Wu, Peterson and Michels. We explain why the scheme proposed in Bao and Deng, [4] is insecure under any definition of privacy based on the idea of indistinguishable encryptions Goldwasser and Micali. We describe a modified scheme to overcome the problem. Proofs of security are given for the scheme in the random oracle model Bellare and Rogaway.
机译：签密是一种公钥原语，它同时实现加密方案和签名方案的功能。它比公用密钥加密和公用密钥签名的组合更有效。我们为提供非交互式不可否认性的Signcryption方案提供了一种安全模型。这是不可否认性，其中解决争端争议的法官不必参与交互式零知识证明。我们的模型适用于鲍和邓，何和吴，彼得森和米歇尔等文献中的许多现有方案。我们解释了基于不可区分的加密Goldwasser和Micali的思想，在Bao和Deng [4]中提出的方案为什么在任何隐私定义下都不安全。我们描述了一种克服问题的改进方案。在随机预言机模型Bellare和Rogaway中给出了该方案的安全性证明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号