How to delete without a trace: certified deniability in a quantum world
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- Certified everlasting secure collusion-resistant functional encryption, and more
- Certified everlasting zero-knowledge proof for QMA
- Computationally binding quantum commitments
- Cryptography with certified deletion
- Definitions and properties of zero-knowledge proof systems
- Deniable encryption
- Designated verifier proofs and their applications
- How to construct quantum random functions
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Multi-collision resistance: a paradigm for keyless hash functions
- Public key encryption with secure key leasing
- Quantum encryption with certified deletion
- Quantum money from hidden subspaces
- Quantum proofs of deletion for learning with errors
- Revisiting post-quantum Fiat-Shamir
- Revocable cryptography from learning with errors
- Revocable quantum digital signatures
- Secret sharing with certified deletion
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Short-lived zero-knowledge proofs and signatures
- Strengths and Weaknesses of Quantum Computing
- The pseudorandom oracle model and ideal obfuscation
- Unclonable commitments and proofs
This page was built for publication: How to delete without a trace: certified deniability in a quantum world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443369)