Pages that link to "Item:Q5495826"
From MaRDI portal
The following pages link to Reusable garbled circuits and succinct functional encryption (Q5495826):
Displaying 50 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)
- Stronger security for reusable garbled circuits, general definitions and attacks (Q1675713) (← links)
- Privacy-free garbled circuits for formulas: size zero and information-theoretic (Q1675725) (← 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)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience (Q2152060) (← links)
- CCA secure \textit{a posteriori} openable encryption in the standard model (Q2152171) (← links)
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) (Q2152174) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Access control encryption with efficient verifiable sanitized decryption (Q2200529) (← links)
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing (Q2224811) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- A new approach to practical function-private inner product encryption (Q2317860) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- A survey of lattice based expressive attribute based encryption (Q2668411) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
- Decentralized multi-client functional encryption for set intersection with improved efficiency (Q2692968) (← links)
