Deniable encryption in a Quantum world

DOI10.1145/3519935.3520019MaRDI QIDQ6083593zbMATH OpenWikidataFDO

Authors Andrea Coladangelo, Umesh V. Vazirani, Shafi Goldwasser

Publication date 8 December 2023

Published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.14988

zbMATH Keywords

deniable encryptionquantum cryptography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Abstract: (Sender-)Deniable encryption provides a very strong privacy guarantee: a sender who is coerced by an attacker into "opening" their ciphertext after-the-fact is able to generate "fake" local random choices that are consistent with any plaintext of their choice. The only known fully-efficient constructions of public-key deniable encryption rely on indistinguishability obfuscation (iO) (which currently can only be based on sub-exponential hardness assumptions). In this work, we study (sender-)deniable encryption in a setting where the encryption procedure is a quantum algorithm, but the ciphertext is classical. First, we propose a quantum analog of the classical definition in this setting. We give a fully efficient construction satisfying this definition, assuming the quantum hardness of the Learning with Errors (LWE) problem. Second, we show that quantum computation unlocks a fundamentally stronger form of deniable encryption, which we call perfect unexplainability. The primitive at the heart of unexplainability is a quantum computation for which there is provably no efficient way, such as exhibiting the "history of the computation", to establish that the output was indeed the result of the computation. We give a construction which is secure in the random oracle model, assuming the quantum hardness of LWE. Crucially, this notion implies a form of protection against coercion "before-the-fact", a property that is impossible to achieve classically.

Cited in

(5)

• scientific article; zbMATH DE number 5501363 (Why is no real title available?)
• Deniable cryptosystems: simpler constructions and achieving leakage resilience
• Authenticated sublinear quantum private information retrieval
• Deny whatever you want: dual-deniable public-key encryption
• Adaptive hardcore bit and quantum key leasing over classical channel from LWE with polynomial modulus

This page was built for publication: Deniable encryption in a Quantum world

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083593)