Obfuscation of Probabilistic Circuits and Applications
From MaRDI portal
Publication:5261688
DOI10.1007/978-3-662-46497-7_19zbMath1382.94078OpenAlexW25973253MaRDI QIDQ5261688
Stefano Tessaro, Vinod Vaikuntanathan, Ran Canetti, Huijia Lin
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_19
Related Items (51)
Impossibility of quantum virtual black-box obfuscation of classical circuits ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Topology-hiding computation beyond semi-honest adversaries ⋮ FE and iO for Turing machines from minimal assumptions ⋮ White box traitor tracing ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ 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 ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ 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 ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Multilinear maps from obfuscation ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ 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 ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ Anonymous whistleblowing over authenticated channels ⋮ Indistinguishability obfuscation ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model ⋮ 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 ⋮ Obfustopia built on secret-key functional encryption ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Non-interactive anonymous router ⋮ Universal proxy re-encryption ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Spooky Encryption and Its Applications ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ On instantiating the algebraic group model from falsifiable assumptions
This page was built for publication: Obfuscation of Probabilistic Circuits and Applications
