首页> 外文会议>International Workshop on Theory and Practice in Public Key Cryptography; 20050123-26; Les Diablerets(CH) >A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
【24h】

A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible

机译:基于Trapdoor单向排列且签名尽可能短的通用方案

获取原文
获取原文并翻译 | 示例

摘要

We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as short as possible. Our scheme is provably secure against existential forgery under chosen-message attacks (with tight reduction) in the ideal cipher model. It is a variant of the construction used in QUARTZ, that makes multiple calls to the trapdoor permutation to avoid birthday paradox attacks. We name our scheme the generic chained construction (GCC) and we show that the k-rounds GCC based on a k-bit one-way permutation with k-bit security generates k-bit signatures with almost k-bit security.
机译:我们回答了一个开放的问题,即基于活板门排列的单向性并使用尽可能短的签名来构建具有经过验证的安全性的数字签名方案的可能性。在理想的密码模型中,我们的方案在选择的消息攻击(严格减少)下可有效地防止存在的伪造。它是QUARTZ中使用的结构的变体,它多次调用trapdoor排列以避免生日悖论攻击。我们将我们的方案命名为通用链结构(GCC),并显示基于具有k位安全性的k位单向置换的k轮GCC生成具有几乎k位安全性的k位签名。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号