Pages that link to "Item:Q2849418"
From MaRDI portal
The following pages link to How to Run Turing Machines on Encrypted Data (Q2849418):
Displaying 39 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Towards witness encryption without multilinear maps (Q2104410) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves (Q2191198) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings (Q2790032) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
- Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions (Q2822675) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Fully Homomorphic Encryption with Auxiliary Inputs (Q3454587) (← links)
- Bilinear Entropy Expansion from the Decisional Linear Assumption (Q3457083) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Universally composable auditable surveillance (Q6562576) (← links)
- Publicly verifiable deletion from minimal assumptions (Q6587954) (← links)
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
- Dynamic collusion functional encryption and multi-authority attribute-based encryption (Q6635893) (← links)
- A general framework for lattice-based ABE using evasive inner-product functional encryption (Q6636517) (← links)
