Efficiency Improvements for Encrypt-to-Self
Jeroen Pijnenburg, Bertram Poettering

TL;DR
This paper enhances the encoding function used in the encrypt-to-self primitive, improving performance and implementation efficiency while maintaining security, and provides an open-source implementation.
Contribution
It proposes a new encoding function for encrypt-to-self that is more efficient and easier to implement without compromising security.
Findings
The new encoding function offers better performance.
Implementation aligns better with CPU memory restrictions.
Security level remains equivalent to previous designs.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
