Pages that link to "Item:Q5261688"

The following pages link to Obfuscation of Probabilistic Circuits and Applications (Q5261688):

Displaying 50 items.

• A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation (Q780319) (← links)
• Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
• FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
• Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model (Q2031043) (← links)
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
• Non-interactive anonymous router (Q2056804) (← links)
• Universal proxy re-encryption (Q2061932) (← links)
• On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
• Impossibility of quantum virtual black-box obfuscation of classical circuits (Q2120091) (← links)
• White box traitor tracing (Q2139638) (← links)
• Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model (Q2148757) (← links)
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
• COA-secure obfuscation and applications (Q2170027) (← links)
• Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
• From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
• From FE combiners to secure MPC and back (Q2175912) (← links)
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
• Multilinear maps from obfuscation (Q2188963) (← links)
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
• On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
• Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
• On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
• Multilinear Maps from Obfuscation (Q2796137) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
• Spooky Encryption and Its Applications (Q2829944) (← links)
• Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
• Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
• Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
• Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← links)
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
• Obfustopia built on secret-key functional encryption (Q5925547) (← links)
• Homomorphic encryption: a mathematical survey (Q6118172) (← links)
• (Inner-product) functional encryption with updatable ciphertexts (Q6141858) (← links)
• Indistinguishability obfuscation (Q6198645) (← links)
• Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
• On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
• R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
• SoK: learning with errors, circular security, and fully homomorphic encryption (Q6635900) (← links)