Pages that link to "Item:Q5915836"
From MaRDI portal
The following pages link to Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5915836):
Displayed 7 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)