Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

@article{Hiroka2021QuantumEW,
  title={Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication},
  author={Taiga Hiroka and Tomoyuki Morimae and Ryo Nishimaki and Takashi Yamakawa},
  journal={IACR Cryptol. ePrint Arch.},
  year={2021},
  volume={2021},
  pages={617}
}
Broadbent and Islam (TCC ’20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted. Although their construction is information-theoretically secure, it is limited to the setting of one-time symmetric key encryption (SKE), where a sender and receiver have to share a common key in advance and the key can be used… 
7 Citations
Certified Everlasting Functional Encryption
TLDR
For the construction of certified everlasting FE, this paper introduces and construct certified everlasting versions of secret- key encryption, public-key encryption, receiver non-committing encryption, and a garbling scheme, which are of independent interest.
Quantum Proofs of Deletion for Learning with Errors
TLDR
This work augments the proof-of-deletion paradigm with fully homomorphic encryption (FHE) and introduces an encoding based on Gaussian coset states which is highly generic and suggests that essentially any LWE-based cryptographic primitive admits a classically-verifiable quantum proof of deletion.
Cryptography with Certified Deletion
TLDR
A new, unifying framework that yields an array of cryptographic primitives that enable a party in possession of a quantum ciphertext to generate a classical certificate that the encrypted plaintext has been information-theoretically deleted, and cannot be recovered even given unbounded computational resources is proposed.
Unclonable Encryption, Revisited
TLDR
It is shown that unClonable encryption, satisfying a stronger property, called unclonable-indistinguishability (defined by Broadbent and Lord), implies copy-protection for a simple class of unlearnable functions.
Uncloneable Encryption, Revisited
TLDR
This work studies uncloneable encryption schemes, where the encryption key can be reused to encrypt multiple messages, and presents two constructions from minimal cryptographic assumptions: a private-key un cloneable encryption scheme assuming post-quantum oneway functions and a public-key Uncloneable Encryption Scheme assuming a post-Quantum public- key encryption scheme.
Certified Everlasting Zero-Knowledge Proof for QMA
TLDR
This work introduces a novel compromise, which is a computational zero-knowledge proof for QMA, but the verifier issues a classical certificate that shows that the verifiers has deleted its quantum information.
Depth-efficient proofs of quantumness
TLDR
All existing proofs of quantumness can be modified so that the prover need only perform constant-depth quantum circuits (and measurements) together with logdepth classical computation, and thus obtain depth-efficient proofs ofquantumness whose soundness cannot be based on the same assumptions as existing schemes.

References

SHOWING 1-10 OF 140 REFERENCES
Quantum Encryption with Certified Deletion: Public Key and Attribute-Based
TLDR
A (reusable-key) public key encryption (PKE) and attribute-based encryption (ABE) with certified deletion is constructed assuming the existence of indistinguishability obfuscation and one-way function.
Quantum encryption with certified deletion
TLDR
It is shown that it is possible to encrypt classical data into a quantum ciphertext such that the recipient of the ciphertext can produce a classical string which proves to the originator that the recipients has relinquished any chance of recovering the plaintext should the decryption key be revealed.
Attribute-based encryption for circuits
TLDR
This work presents a new framework for constructing attribute-based encryption schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions.
Adaptively-Secure, Non-interactive Public-Key Encryption
TLDR
This work constructs adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarily- many senders and shows that this limitation can be overcome by updating the decryption key over time.
Composably secure device-independent encryption with certified deletion.
TLDR
It is shown that it is possible to achieve this task even when the honest parties do not trust their quantum devices, and security for the ECD task is defined in a composable manner and the protocol satisfies conditions that lead to composable security.
Revocable Quantum Timed-Release Encryption
TLDR
It is shown that revocable timed-release encryption without trusted parties is possible using quantum cryptography (while trivially impossible classically) and two proof techniques in the quantum random oracle model are developed.
Witness encryption and its applications
TLDR
The method for witness encryption is introduced and formally defined, which yields the first candidate construction for an open problem posed by Rudich in 1989: constructing computational secret sharing schemes for an NP-complete access structure.
One-shot signatures and applications to hybrid quantum/classical authentication
TLDR
One-shot signatures are defined, which are signatures where any secret key can be used to sign only a single message, and then self-destructs, and have numerous applications for hybrid quantum/classical cryptographic tasks, where all communication is required to be classical but local quantum operations are allowed.
Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices
TLDR
This work shows how to remove the DCR assumption and remain with a scheme based on the circular security of LWE alone, and along the way relax some of the requirements in the Gay-Pass blueprint and thus obtain a scheme that is secure under a relaxed assumption.
...
...