Bootstrapping Obfuscators via Fast Pseudorandom Functions
From MaRDI portal
Publication:2936606
DOI10.1007/978-3-662-45608-8_9zbMath1317.94082OpenAlexW2111786286MaRDI QIDQ2936606
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_9
Related Items (16)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Obfuscating circuits via composite-order graded encoding ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Pseudorandom Functions: Three Decades Later ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
This page was built for publication: Bootstrapping Obfuscators via Fast Pseudorandom Functions
