【24h】

Efficient and Provable White-Box Primitives

机译:高效且可提供的白盒原语

获取原文

摘要

In recent years there have been several attempts to build white-box block ciphers whose implementations aim to be incompressible. This includes the weak white-box ASASA construction by Bouillaguet, Biryukov and Khovratovich from ASIACRYPT 2014, and the recent space-hard construction by Bogdanov and Isobe from CCS 2015. In this article we propose the first constructions aiming at the same goal while offering provable security guarantees. Moreover we propose concrete instantiations of our constructions, which prove to be quite efficient and competitive with prior work. Thus provable security comes with a surprisingly low overhead.
机译:近年来,有几次尝试建立实现的实现旨在不可压缩的白盒块密码。这包括Bouillaguet,Biryukov和Khovratovich的Buroillaguet,Biryukov和Khovratovich的弱白盒asasa建设,以及来自CCS 2015的Bogdanov和Isobe最近的空间硬建筑。在本文中,我们提出了针对同一目标的第一个建筑,同时提供可提供的目标安全保证。此外,我们提出了我们建筑的具体实例化,这证明了与事先工作相当有效和竞争。因此,可提供的安全性令人惊讶的是低开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号