How to run Turing machines on encrypted data
From MaRDI portal
Recommendations
Cited in
(68)- FE and iO for Turing machines from minimal assumptions
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Function-private functional encryption in the private-key setting
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- How to build time-lock encryption
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Boosting verifiable computation on encrypted data
- Flexible and efficient verifiable computation on encrypted data
- Towards witness encryption without multilinear maps
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Garbled circuits with sublinear evaluator
- Attribute based encryption for deterministic finite automata from DLIN
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Offline witness encryption with semi-adaptive security
- Reusable garbled Turing machines without FHE
- Secure multi-party computation in large networks
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- Oblivious parallel RAM and applications
- How to avoid obfuscation using witness PRFs
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Fully secure functional encryption for inner products, from standard assumptions
- Cryptographic agents: towards a unified theory of computing on encrypted data
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Secure multiparty RAM computation in constant rounds
- Fully homomorphic encryption with auxiliary inputs
- Bilinear entropy expansion from the decisional linear assumption
- Garbled circuits as randomized encodings of functions: a primer
- Homomorphic encryption
- Storing and retrieving secrets on a blockchain
- Strongly full-hiding inner product encryption
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Predictable arguments of knowledge
- Explainable arguments
- New ways to garble arithmetic circuits
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Private polynomial commitments and applications to MPC
- Laconic function evaluation for Turing machines
- Witness encryption from smooth projective hashing system
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- ABE for circuits with constant-size secret keys and adaptive security
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- The pseudorandom oracle model and ideal obfuscation
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Forward-secure public key encryption without key update from proof-of-stake blockchain
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
- Universally composable auditable surveillance
- Publicly verifiable deletion from minimal assumptions
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- FE for inner products and its application to multi-authority ABE
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Faster ABE for Turing machines from circular evasive LWE
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Signature-based witness encryption with compact ciphertext
- Extractable witness encryption for KZG commitments and efficient laconic OT
- Mild asymmetric message franking: illegal-messages-only and retrospective content moderation
- Succinct witness encryption for batch languages and applications
- Pseudorandom FE, iO and applications
- Publicly verifiable deletion: general compilers from minimal assumptions
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- Verifiable FHE via lattice-based SNARKs
This page was built for publication: How to run Turing machines on encrypted data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849418)
