Obfuscation of probabilistic circuits and applications

DOI10.1007/978-3-662-46497-7_19zbMATH Open1382.94078OpenAlexW25973253MaRDI QIDQ5261688FDOQ5261688

Authors: Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan 

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

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (60)

• The pseudorandom oracle model and ideal obfuscation
• Non-interactive anonymous router with quasi-linear router computation
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• Anonymous whistleblowing over authenticated channels
• Indistinguishability obfuscation
• 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
• On the Bottleneck Complexity of MPC with Correlated Randomness
• Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
• (Inner-product) functional encryption with updatable ciphertexts
• Indistinguishability Obfuscation: From Approximate to Exact
• Impossibility of quantum virtual black-box obfuscation of classical circuits
• On constructing one-way permutations from indistinguishability obfuscation
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• FE and iO for Turing machines from minimal assumptions
• Topology-hiding computation beyond semi-honest adversaries
• Multikey Fully Homomorphic Encryption and Applications
• Multilinear maps from obfuscation
• Overlaying conditional circuit clauses for secure computation
• From cryptomania to obfustopia through secret-key functional encryption
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• White box traitor tracing
• Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
• Sublinear secure computation from new assumptions
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
• On Constructing One-Way Permutations from Indistinguishability Obfuscation
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Multilinear Maps from Obfuscation
• Perfect Structure on the Edge of Chaos
• Spooky Encryption and Its Applications
• Multi-input Functional Encryption with Unbounded-Message Security
• On the Correlation Intractability of Obfuscated Pseudorandom Functions
• Obfustopia built on secret-key functional encryption
• COA-secure obfuscation and applications
• Distributed (correlation) samplers: how to remove a trusted dealer in one round
• Non-interactive anonymous router
• Delegating RAM Computations with Adaptive Soundness and Privacy
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
• From FE combiners to secure MPC and back
• Constructions for quantum indistinguishability obfuscation
• Universal proxy re-encryption
• A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation
• 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\)
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
• Succinct interactive oracle proofs: applications and limitations
• Garbled Circuits as Randomized Encodings of Functions: a Primer
• Homomorphic encryption: a mathematical survey
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• On instantiating the algebraic group model from falsifiable assumptions

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)