Output-Compressing Randomized Encodings and Applications
From MaRDI portal
Publication:2796121
DOI10.1007/978-3-662-49096-9_5zbMath1348.94067OpenAlexW2296101771MaRDI QIDQ2796121
Rafael Pass, Karn Seth, Huijia Lin, Sidharth Telang
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_5
Related Items (20)
FE and iO for Turing machines from minimal assumptions ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Concurrently composable non-interactive secure computation ⋮ Indistinguishability obfuscation ⋮ On the complexity of compressing obfuscation ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Cryptography with Updates ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation: From Approximate to Exact
- Output-Compressing Randomized Encodings and Applications
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Functional Encryption: Definitions and Challenges
- Randomly Encoding Functions: A New Cryptographic Paradigm
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- The Knowledge Complexity of Interactive Proof Systems
- How to use indistinguishability obfuscation
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On Extractability Obfuscation
This page was built for publication: Output-Compressing Randomized Encodings and Applications
