Pages that link to "Item:Q5495826"
From MaRDI portal
The following pages link to Reusable garbled circuits and succinct functional encryption (Q5495826):
Displaying 29 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency (Q511917) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing (Q1701978) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- (Q4638057) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Unbounded predicate inner product functional encryption from pairings (Q6109084) (← links)
- A survey on functional encryption (Q6163797) (← links)
- Practical multi-party quantum homomorphic encryption (Q6175520) (← links)