Pages that link to "Item:Q1680213"
From MaRDI portal
The following pages link to Indistinguishability obfuscation for Turing machines: constant overhead and amortization (Q1680213):
Displaying 5 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)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free (Q2056741) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
