• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IMA conference on cryptography and coding >A Linearly Homomorphic Signature Scheme from Weaker Assumptions
【24h】

A Linearly Homomorphic Signature Scheme from Weaker Assumptions

机译：弱假设的线性同态签名方案

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In delegated computing, prominent in the context of cloud computing, guaranteeing both the correctness and authenticity of computations is of critical importance. Homomorphic signatures can be used as cryptographic solutions to this problem. In this paper we solve the open problem of constructing a linearly homomorphic signature scheme that is secure against an active adversary under standard assumptions. We provide a construction based on the DL and CDH assumption. Furthermore we show how our scheme can be combined with homomorphic encryption under the framework of Linearly Homomorphic Authenticated Encryption with Public Verifiability. This way we can provide the first such scheme that is context hiding. Furthermore our solution even allows verification in constant time (in an amortized sense).
机译：在委托计算中（在云计算的上下文中非常重要），确保计算的正确性和真实性至关重要。同态签名可以用作此问题的密码解决方案。在本文中，我们解决了构建线性同态签名方案的开放性问题，该方案在标准假设下可抵抗主动对手。我们提供了基于DL和CDH假设的构造。此外，我们展示了如何在具有公共可验证性的线性同态认证加密框架下将我们的方案与同态加密结合。这样，我们可以提供第一个这样的方案，即上下文隐藏。此外，我们的解决方案甚至允许在固定时间（摊销意义上）进行验证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号