Succinct Randomized Encodings and their Applications
From MaRDI portal
Publication:2941536
DOI10.1145/2746539.2746574zbMath1321.94041OpenAlexW2101230806MaRDI QIDQ2941536
Sidharth Telang, Huijia Lin, Nir Bitansky, Rafael Pass, Sanjam Garg
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2746539.2746574
Related Items (40)
Security definitions on time-lock puzzles ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Delegating RAM Computations ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Collusion-resistant functional encryption for RAMs ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Universal ring signatures in the standard model ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Cryptography with Updates ⋮ No-signaling linear PCPs ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Cryptographic Assumptions: A Position Paper ⋮ No-signaling linear PCPs ⋮ Oblivious Parallel RAM and Applications ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Obfuscation Combiners ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Succinct Randomized Encodings and their Applications
