Obfuscation of probabilistic circuits and applications

Recommendations

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
Obfuscation for Cryptographic Purposes
On the (im)possibility of obfuscating programs
scientific article; zbMATH DE number 1842483
On best-possible obfuscation

Cited in

(72)

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

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)