Output-compressing randomized encodings and applications
From MaRDI portal
Recommendations
- Output compression, MPC, and iO for Turing machines
- Succinct randomized encodings and their applications
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Statistical randomized encodings: a complexity theoretic view
- Encoding functions with constant online rate or how to compress garbled circuits keys
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Attribute-based encryption for circuits
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computationally private randomizing polynomials and their applications
- From selective to adaptive security in functional encryption
- Functional encryption: definitions and challenges
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On extractability obfuscation
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Output-compressing randomized encodings and applications
- Public-coin differing-inputs obfuscation and its applications
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Reusable garbled circuits and succinct functional encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
- The Knowledge Complexity of Interactive Proof Systems
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(33)- Functional encryption against probabilistic queries: definition, construction and applications
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- On Removing Graded Encodings from Functional Encryption
- On pseudorandom encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- FE and iO for Turing machines from minimal assumptions
- Succinct randomized encodings and their applications
- Output-compressing randomized encodings and applications
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Garbled circuits as randomized encodings of functions: a primer
- From cryptomania to obfustopia through secret-key functional encryption
- Statistical randomized encodings: a complexity theoretic view
- On the complexity of compressing obfuscation
- Obfuscating pseudorandom functions is post-quantum complete
- Concurrently composable non-interactive secure computation
- On statistically secure obfuscation with approximate correctness
- Indistinguishability obfuscation
- Output Constrained Lossy Source Coding With Limited Common Randomness
- Candidate obfuscation via oblivious LWE sampling
- Succinct PPRFs via memory-tight reductions
- Proofs of Work from worst-case assumptions
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Cryptography with updates
- From FE combiners to secure MPC and back
- From cryptomania to obfustopia through secret-key functional encryption
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Output compression, MPC, and iO for Turing machines
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- scientific article; zbMATH DE number 7650434 (Why is no real title available?)
This page was built for publication: Output-compressing randomized encodings and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796121)
