论文标题
加密自我的效率提高
Efficiency Improvements for Encrypt-to-Self
论文作者
论文摘要
Pijnenburg和Poeting（Esorics'20）的最新工作探讨了新颖的加密加密原始原始作品，该原始原始原始旨在用于对称加密案例，其中加密和解密重合。每当需要使用内存的计算设备加密某些数据以临时将其存放在不受信任的存储设备上时，就会设想原始性将是有用的。尽管新的原始性可以保护有效载荷的机密性，就像经典身份验证的加密原始原料一样，它提供了相当多的真实性保证：特别是，虽然经典解决方案在涉及用户腐败的上下文中完全失败了，但如果使用加密对象方案来保护数据，则所有ciphertexts and Mealses ass all ciphertexts and Mealses aslain All Plaste n afloseme bull do allime dembase bull drom fromefece均保持不良。 为了实例化其加密自发原始性，Pijnenburg等人提出了哈希函数的压缩函数的操作方式，精心设计的编码函数在处理后的消息和相关数据的序列化中起着核心作用。在目前的工作中，我们重新审视此编码功能的设计。无需质疑它是否有足够的安全性完成加密工作，我们通过提出修改来从技术/实施的角度来改进它，以减轻某些条件，这些条件减轻了某些条件，这些条件不可避免地需要实施以不尊重现代CPU的单词智慧操作所施加的记忆一致性限制，最终导致绩效造成惩罚。因此，我们的主要贡献是提出改进的编码功能，以解释为什么它提供更好的性能，并证明它提供了与前身一样多的安全性。我们最终根据新的编码函数报告了对加密自身原始的开源实现。
Recent work by Pijnenburg and Poettering (ESORICS'20) explores the novel cryptographic Encrypt-to-Self primitive that is dedicated to use cases of symmetric encryption where encryptor and decryptor coincide. The primitive is envisioned to be useful whenever a memory-bounded computing device is required to encrypt some data with the aim of temporarily depositing it on an untrusted storage device. While the new primitive protects the confidentiality of payloads as much as classic authenticated encryption primitives would do, it provides considerably better authenticity guarantees: Specifically, while classic solutions would completely fail in a context involving user corruptions, if an encrypt-to-self scheme is used to protect the data, all ciphertexts and messages fully remain unforgeable. To instantiate their encrypt-to-self primitive, Pijnenburg et al propose a mode of operation of the compression function of a hash function, with a carefully designed encoding function playing the central role in the serialization of the processed message and associated data. In the present work we revisit the design of this encoding function. Without questioning its adequacy for securely accomplishing the encrypt-to-self job, we improve on it from a technical/implementational perspective by proposing modifications that alleviate certain conditions that would inevitably require implementations to disrespect memory alignment restrictions imposed by the word-wise operation of modern CPUs, ultimately leading to performance penalties. Our main contributions are thus to propose an improved encoding function, to explain why it offers better performance, and to prove that it provides as much security as its predecessor. We finally report on our open-source implementation of the encrypt-to-self primitive based on the new encoding function.
