Pages that link to "Item:Q3181035"
From MaRDI portal
The following pages link to Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035):
Displaying 13 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)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
