Obfuscation of Probabilistic Circuits and Applications

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Theory of Cryptography Conference

• Publication date

  2015-03-23

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-662-46497-7_19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Succinct Randomized Encodings and their Applications

  2015cited by this paper
• Obfuscating Conjunctions

  2015cited by this paper
• Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

  2014cited by this paper
• Functional Signatures and Pseudorandom Functions

  2014cited by this paper
• Succinct Garbling Schemes and Applications

  2014cited by this paper
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator

  2014cited by this paper
• How to use indistinguishability obfuscation: deniable encryption, and more

  2014cited by this paper
• (Leveled) Fully Homomorphic Encryption without Bootstrapping

  2014cited by this paper
• Bootstrapping Obfuscators via Fast Pseudorandom Functions

  2014cited by this paper
• Protecting Obfuscation against Algebraic Attacks

  2014cited by this paper
• On Extractability Obfuscation

  2014cited by this paper
• On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption

  2013cited by this paper
• Delegatable pseudorandom functions and applications

  2013cited by this paper
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

  2013cited by this paper
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

  2013cited by this paper
• Constrained Pseudorandom Functions and Their Applications

  2013cited by this paper
• Differing-Inputs Obfuscation and Applications

  2013cited by this paper
• Key Homomorphic PRFs and Their Applications

  2013cited by this paper
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

  2012cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

  2011cited by this paper
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

  2010cited by this paper
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

  2009cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• Lossy trapdoor functions and their applications

  2008cited by this paper
• Games for exchanging information

  2008cited by this paper
• Rerandomizable RCCA Encryption

  2007cited by this paper
• On the impossibility of obfuscation with auxiliary input

  2005cited by this paper
• COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS

  2005cited by this paper
• Cryptography in NC0

  2004cited by this paper
• On the (im)possibility of obfuscating programs

  2001cited by this paper
• A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

  2001cited by this paper
• Randomizing polynomials: A new representation with applications to round-efficient secure computation

  2000cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• How to construct random functions

  1986cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• SRI International

  1982cited by this paper

• Adaptive NIKE for Unbounded Parties

  2026cites this paper
• Exact Non-Identity Check and Gate-Teleportation-Based Indistinguishability Obfuscation are NP-hard for Low-T-Depth Quantum Circuits

  2025cites this paper
• Witness encryption with updatable ciphertexts

  2025cites this paper
• Fully Composable Homomorphic Encryption

  2025cites this paper
• Fully-Homomorphic Encryption from Lattice Isomorphism

  2025cites this paper
• Rate-1 Zero-Knowledge Proofs from One-Way Functions

  2024cites this paper
• Towards general-purpose program obfuscation via local mixing

  2024cites this paper
• On Instantiating Unleveled Fully-Homomorphic Signatures from Falsifiable Assumptions

  2024influential citation
• Adaptive Security in SNARGs via iO and Lossy Functions

  2024cites this paper
• How to Construct Quantum FHE, Generically

  2024influential citation
• Private Access Control for Function Secret Sharing

  2023cites this paper
• (Inner-Product) Functional Encryption with Updatable Ciphertexts

  2023cites this paper
• On the Feasibility of Unleveled Fully-Homomorphic Signatures

  2023influential citation
• Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices

  2023cites this paper
• SoK: Towards CCA Secure Fully Homomorphic Encryption

  2023cites this paper
• Alternative Constructions of Asymmetric Primitives from Obfuscation: Hierarchical IBE, Predicate Encryption, and More

  2023cites this paper
• Homomorphic Indistinguishability Obfuscation and its Applications

  2023cites this paper
• On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions

  2023cites this paper
• Bootstrapping Homomorphic Encryption via Functional Encryption

  2023cites this paper
• COA-Secure Obfuscation and Applications

  2022influential citation
• The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn't Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions

  2022cites this paper
• Sublinear Secure Computation from New Assumptions

  2022cites this paper
• Towards Practical Topology-Hiding Computation

  2022cites this paper
• Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪

  2022cites this paper
• The Pseudorandom Oracle Model and Ideal Obfuscation

  2022cites this paper
• Non-Interactive Anonymous Router with Quasi-Linear Router Computation

  2022cites this paper
• Locked Circuit Indistinguishability: A Notion of Security for Logic Locking

  2022cites this paper
• Succinct Interactive Oracle Proofs: Applications and Limitations

  2022cites this paper
• Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round

  2022cites this paper
• Non-Interactive Anonymous Router

  2021cites this paper
• White Box Traitor Tracing

  2021cites this paper
• Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0

  2021cites this paper
• Lattice-Based HRA-secure Attribute-Based Proxy Re-Encryption in Standard Model

  2021cites this paper
• Anonymous Whistleblowing over Authenticated Channels

  2021cites this paper
• On the Bottleneck Complexity of MPC with Correlated Randomness

  2021cites this paper
• Constructions for Quantum Indistinguishability Obfuscation

  2020cites this paper
• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

  2020cites this paper
• On Instantiating the Algebraic Group Model from Falsifiable Assumptions

  2020cites this paper
• Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE

  2020cites this paper
• Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

  2020cites this paper
• Lattice-based Unidirectional IBPRE Secure in Standard Model

  2020cites this paper
• Indistinguishability obfuscation for quantum circuits of low T-count

  2020cites this paper
• Stronger Multilinear Maps from Indistinguishability Obfuscation

  2020cites this paper
• Indistinguishability obfuscation from well-founded assumptions

  2020cites this paper
• Cryptographic Obfuscation: A Survey

  2020cites this paper
• Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

  2020cites this paper
• Information Security Applications: 21st International Conference, WISA 2020, Jeju Island, South Korea, August 26–28, 2020, Revised Selected Papers

  2020cites this paper
• Identity-Based Unidirectional Proxy Re-encryption in Standard Model: A Lattice-Based Construction

  2020cites this paper
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO

  2020influential citation
• New Techniques for Obfuscating Conjunctions

  2019cites this paper
• Proxy Re-Encryption and Re-Signatures from Lattices

  2019cites this paper
• Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation

  2019cites this paper
• Adaptively Single-Key Secure Constrained PRFs for NC1

  2019cites this paper
• Collusion Resistant Broadcast and Trace from Positional Witness Encryption

  2019cites this paper
• User-Controlled Computations in Untrusted Computing Environments

  2019influential citation
• Fiat-Shamir : From Practice to Theory , Part II NIZK and Correlation Intractability from Circular-Secure FHE

  2019cites this paper
• Dual-Mode NIZKs from Obfuscation

  2019cites this paper
• Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation

  2019cites this paper
• A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation

  2019cites this paper
• Homomorphic Time-Lock Puzzles and Applications

  2019cites this paper
• A Dispersed Multi-Value Attribute-Based Encryption With Mediated Obfuscation

  2019cites this paper
• Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles

  2019cites this paper
• Classical Verification of Quantum Computations with Efficient Verifier

  2019cites this paper
• From FE Combiners to Secure MPC and Back

  2019cites this paper
• Topology-Hiding Computation Beyond Semi-Honest Adversaries

  2018cites this paper
• Graded Encoding Schemes from Obfuscation

  2018cites this paper
• Obfustopia Built on Secret-Key Functional Encryption

  2018cites this paper
• The Birth of Cryptographic Obfuscation -- A Survey

  2018cites this paper
• Interactively Secure Groups from Obfuscation

  2018influential citation
• CCA1 secure FHE from PIO, revisited

  2018cites this paper
• Obfuscation from Low Noise Multilinear Maps

  2018cites this paper
• New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation

  2018cites this paper
• Universal Proxy Re-Encryption

  2018cites this paper
• Delegating Computations with (Almost) Minimal Time and Space Overhead

  2018cites this paper
• FE and iO for Turing Machines from Minimal Assumptions

  2018cites this paper
• Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II

  2017cites this paper
• Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization

  2017cites this paper
• Structure vs. Hardness Through the Obfuscation Lens

  2017cites this paper
• Indistinguishability Obfuscation for All Circuits from Secret-Key Functional Encryption

  2017cites this paper
• Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness

  2017cites this paper
• Garbled Circuits as Randomized Encodings of Functions: a Primer

  2017cites this paper
• Non-Interactive Multiparty Computation Without Correlated Randomness

  2017cites this paper
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

  2017cites this paper
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

  2017cites this paper
• Chosen-Ciphertext Secure Fully Homomorphic Encryption

  2017cites this paper
• Parametrization and Evaluation of Intermediate Level Obfuscator

  2017cites this paper
• Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs

  2017cites this paper
• Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives

  2017cites this paper
• Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness

  2017cites this paper
• Patchable Indistinguishability Obfuscation: iO for Evolving Software

  2017cites this paper
• IRON: Functional Encryption using Intel SGX

  2017cites this paper
• Strongly average-case secure obfuscation: achieving input privacy and circuit obscurity

  2016cites this paper
• On Program Obfuscation

  2016cites this paper
• Proxy re-encryption via indistinguishability obfuscation

  2016cites this paper
• Advances in Cryptology – CRYPTO 2016

  2016cites this paper
• New Negative Results on Differing-Inputs Obfuscation

  2016cites this paper
• Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security

  2016cites this paper
• Multi-input Functional Encryption with Unbounded-Message Security

  2016cites this paper
• Indistinguishability Obfuscation Does Not Reduce to Structured Languages

  2016cites this paper
• Indistinguishability Obfuscation with Non-trivial Efficiency

  2016cites this paper