No article text was recorded for this version.
computational overhead of indistinguishability obfuscation
Version 1 of 132 papers35 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Hopes, Fears and Software Obfuscation: A Survey
- Blog: Provable Security
- Blog: Symmetric-Key Based Proofs of Retrievability Supporting Public Verification
- Blog: Single Secret Leader Election
- Blog: Operational Signature Schemes
- Blog: Watermarking Cryptographic Capabilities
- Blog: Secure Quantum Extraction Protocols
- Blog: Evolving Secret Sharing Made Short
- Blog: Quantum One-Time Protection of any Randomized Algorithm
- Blog: A Modular Approach to Unclonable Cryptography
- Blog: Access Control Encryption: Enforcing Information Flow with Cryptography
- Blog: Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial
- Blog: ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
- Blog: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Blog: Delegating RAM Computations with Adaptive Soundness and Privacy
- Blog: Secure Identity Based Encryption Without Random Oracles
- Blog: Comments and Improvements on Chameleon Hashing Without Key Exposure Based on Factoring
- Blog: Cryptographic Protocols for Electronic Voting
- Blog: Time-Lock Puzzles from Randomized Encodings
- Blog: How to Protect Yourself without Perfect Shredding
- Blog: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Blog: Protecting Obfuscation Against Algebraic Attacks
- Blog: Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC
- Blog: Publicly Verifiable Software Watermarking
- Blog: Charge Your Clients: Payable Secure Computation and Its Applications
- Blog: Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds
- Blog: Evolving secret sharing revisited: computational security and succinctness
- Blog: Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models
- Blog: From Obfuscation to the Security of Fiat-Shamir for Proofs
- Blog: Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware
- Blog: Decentralized Privacy-preserving Timed Execution in Blockchain-based Smart Contract Platforms
- Blog: Adaptively Secure Two-party Computation From Indistinguishability Obfuscation
History & citation
Current · Permanent link
- Indistinguishability Obfuscation for Universal Cryptographic Construction merged into this direction (56% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_overhead_of_indistinguisha_5b9f4b8b,
title = {computational overhead of indistinguishability obfuscation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-overhead-of-indistinguishability-obfuscation/rdr_5b9f4b8b0af7432f9e80cea80d27a85a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_overhead_of_indistinguisha_5b9f4b8b_v1,
title = {computational overhead of indistinguishability obfuscation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-overhead-of-indistinguishability-obfuscation/rdr_5b9f4b8b0af7432f9e80cea80d27a85a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}