Pages that link to "Item:Q2941536"
From MaRDI portal
The following pages link to Succinct Randomized Encodings and their Applications (Q2941536):
Displaying 41 items.
- Security definitions on time-lock puzzles (Q831622) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Cryptography with Updates (Q5738983) (← links)
- (Q5875794) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Universal ring signatures in the standard model (Q6175977) (← links)
- Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
- Time-lock puzzles from lattices (Q6652906) (← links)
