Public-Coin Differing-Inputs Obfuscation and Its Applications
From MaRDI portal
Publication:5261695
DOI10.1007/978-3-662-46497-7_26zbMATH Open1336.94054OpenAlexW841739680MaRDI QIDQ5261695FDOQ5261695
Amit Sahai, Omkant Pandey, Yuval Ishai
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_26
Cited In (26)
- Leakage resilience from program obfuscation
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits
- Structure-preserving compilers from new notions of obfuscations
- The pseudorandom oracle model and ideal obfuscation
- Selective-Opening Security in the Presence of Randomness Failures
- Random walks and concurrent zero-knowledge
- Signatures Resilient to Uninvertible Leakage
- Standard Security Does Not Imply Indistinguishability Under Selective Opening
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Bounded Collusion ABE for TMs from IBE
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Functional Encryption for Turing Machines
- Unbounded quadratic functional encryption and more from pairings
- Simpler constructions of asymmetric primitives from obfuscation
- Output-Compressing Randomized Encodings and Applications
- Multi-input Functional Encryption with Unbounded-Message Security
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits
- R3PO: reach-restricted reactive program obfuscation and its applications
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- Adaptively secure MPC with sublinear communication complexity
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- Succinct computational secret sharing
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Constrained PRFs for Unbounded Inputs with Short Keys
- Strongly full-hiding inner product encryption
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
This page was built for publication: Public-Coin Differing-Inputs Obfuscation and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261695)
