A modular approach to unclonable cryptography
From MaRDI portal
Publication:6652999
DOI10.1007/978-3-031-68394-7_1MaRDI QIDQ6652999
Prabhanjan Ananth, Amit Behera
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Secure software leasing
- Hidden cosets and applications to unclonable cryptography
- Quantum lightning never strikes the same state twice
- Unclonable encryption, revisited
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Quantum One-Time Programs
- Constrained Pseudorandom Functions and Their Applications
- Quantum money from hidden subspaces
- How to use indistinguishability obfuscation
- A single quantum cannot be cloned
- Functional Signatures and Pseudorandom Functions
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Indistinguishability obfuscation from well-founded assumptions
- Public-key Quantum money with a classical bank
- On the feasibility of unclonable encryption, and more
- Collusion resistant copy-protection for watermarkable functionalities
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Franchised quantum money
- Quantum search-to-decision reduction for the LWE problem
- Revocable cryptography from learning with errors
This page was built for publication: A modular approach to unclonable cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652999)
