Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software

DOI10.1007/978-3-319-56617-7_5zbMath1394.94926OpenAlexW2603101734MaRDI QIDQ5270360

Amit Sahai, Abhishek Jain, Prabhanjan V. Ananth

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Cryptography with Updates ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Output-Compressing Randomized Encodings and Applications
• Functional Encryption for Turing Machines
• Fully Succinct Garbled RAM
• Time-Lock Puzzles from Randomized Encodings
• Multi-input Functional Encryption for Unbounded Arity Functions
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• How to Run Turing Machines on Encrypted Data
• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
• On Virtual Grey Box Obfuscation for General Circuits
• Incremental Deterministic Public-Key Encryption
• Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
• Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
• Succinct Randomized Encodings and their Applications
• Functional Encryption: Definitions and Challenges
• Incremental Unforgeable Encryption
• Delegating RAM Computations with Adaptive Soundness and Privacy
• Adaptive Succinct Garbled RAM or: How to Delegate Your Database
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Indistinguishability Obfuscation from Compact Functional Encryption
• On Strong Simulation and Composable Point Obfuscation
• On Best-Possible Obfuscation
• One-Time Programs
• Software protection and simulation on oblivious RAMs
• Fully homomorphic encryption using ideal lattices
• How to use indistinguishability obfuscation
• Public-Coin Differing-Inputs Obfuscation and Its Applications
• Watermarking cryptographic capabilities
• Fuzzy Identity-Based Encryption
• On the (im)possibility of obfuscating programs
• Protecting Obfuscation against Algebraic Attacks
• Multi-input Functional Encryption
• New Negative Results on Differing-Inputs Obfuscation
• Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• On Extractability Obfuscation

This page was built for publication: Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software