A modular approach to unclonable cryptography
From MaRDI portal
Publication:6652999
DOI10.1007/978-3-031-68394-7_1MaRDI QIDQ6652999FDOQ6652999
Authors: Prabhanjan Ananth, Amit Behera 
Publication date: 13 December 2024
Recommendations
Cites Work
- A single quantum cannot be cloned
- Title not available (Why is that?)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- How to use indistinguishability obfuscation
- Title not available (Why is that?)
- Constrained pseudorandom functions and their applications
- Quantum one-time programs. (Extended abstract)
- Functional signatures and pseudorandom functions
- Two-round secure MPC from indistinguishability obfuscation
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Secure software leasing
- Quantum lightning never strikes the same state twice
- Hidden cosets and applications to unclonable cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Unclonable encryption, revisited
- Public-key Quantum money with a classical bank
- Franchised quantum money
- Collusion resistant copy-protection for watermarkable functionalities
- On the feasibility of unclonable encryption, and more
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Quantum search-to-decision reduction for the LWE problem
- Revocable cryptography from learning with errors
Cited In (2)
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)
