A modular approach to unclonable cryptography
From MaRDI portal
Publication:6652999
Recommendations
Cites work
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 2086396 (Why is no real title available?)
- A single quantum cannot be cloned
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Collusion resistant copy-protection for watermarkable functionalities
- Constrained pseudorandom functions and their applications
- Franchised quantum money
- Functional signatures and pseudorandom functions
- Hidden cosets and applications to unclonable cryptography
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation from well-founded assumptions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On the feasibility of unclonable encryption, and more
- Public-key Quantum money with a classical bank
- Quantum lightning never strikes the same state twice
- Quantum one-time programs. (Extended abstract)
- Quantum search-to-decision reduction for the LWE problem
- Revocable cryptography from learning with errors
- Secure software leasing
- Two-round secure MPC from indistinguishability obfuscation
- Unclonable encryption, revisited
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)
