Obfuscation of probabilistic circuits and applications
From MaRDI portal
Publication:5261688
Recommendations
Cited in
(60)- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- (Inner-product) functional encryption with updatable ciphertexts
- Impossibility of quantum virtual black-box obfuscation of classical circuits
- On constructing one-way permutations from indistinguishability obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Non-interactive anonymous router with quasi-linear router computation
- Toward fine-grained blackbox separations between semantic and circular-security notions
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- FE and iO for Turing machines from minimal assumptions
- Topology-hiding computation beyond semi-honest adversaries
- Multilinear maps from obfuscation
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Multi-input functional encryption with unbounded-message security
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Overlaying conditional circuit clauses for secure computation
- Garbled circuits as randomized encodings of functions: a primer
- From cryptomania to obfustopia through secret-key functional encryption
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Anonymous whistleblowing over authenticated channels
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- On constructing one-way permutations from indistinguishability obfuscation
- On the correlation intractability of obfuscated pseudorandom functions
- White box traitor tracing
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Multilinear maps from obfuscation
- On the bottleneck complexity of MPC with correlated randomness
- Sublinear secure computation from new assumptions
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Spooky Encryption and Its Applications
- Indistinguishability obfuscation
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- COA-secure obfuscation and applications
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Non-interactive anonymous router
- Obfustopia built on secret-key functional encryption
- From FE combiners to secure MPC and back
- R3PO: reach-restricted reactive program obfuscation and its applications
- SoK: learning with errors, circular security, and fully homomorphic encryption
- From cryptomania to obfustopia through secret-key functional encryption
- Constructions for quantum indistinguishability obfuscation
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation
- Universal proxy re-encryption
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Multikey fully homomorphic encryption and applications
- How to construct quantum FHE, generically
- Adaptive security in SNARGs via iO and lossy functions
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- Indistinguishability obfuscation: from approximate to exact
- Succinct interactive oracle proofs: applications and limitations
- Homomorphic encryption: a mathematical survey
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- On instantiating the algebraic group model from falsifiable assumptions
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Obfuscation of probabilistic circuits and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261688)
