Public-coin differing-inputs obfuscation and its applications

DOI10.1007/978-3-662-46497-7_26MaRDI QIDQ5261695zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Omkant Pandey, Amit Sahai

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• New negative results on differing-inputs obfuscation
• How to use indistinguishability obfuscation: deniable encryption, and more

Cited in

(32)

• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• Leakage-resilient cryptography from puncturable primitives and obfuscation
• Simpler constructions of asymmetric primitives from obfuscation
• Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
• Random walks and concurrent zero-knowledge
• Leakage resilience from program obfuscation
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• Output-compressing randomized encodings and applications
• Functional Encryption for Turing Machines
• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
• Constrained PRFs for unbounded inputs with short keys
• Signatures Resilient to Uninvertible Leakage
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Selective-Opening Security in the Presence of Randomness Failures
• Multi-input functional encryption with unbounded-message security
• Standard security does not imply indistinguishability under selective opening
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Strongly full-hiding inner product encryption
• Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
• New negative results on differing-inputs obfuscation
• Adaptively secure MPC with sublinear communication complexity
• Bounded Collusion ABE for TMs from IBE
• Unbounded quadratic functional encryption and more from pairings
• Structure-preserving compilers from new notions of obfuscations
• The pseudorandom oracle model and ideal obfuscation
• Succinct computational secret sharing
• R3PO: reach-restricted reactive program obfuscation and its applications
• Succinct PPRFs via memory-tight reductions
• Adaptively secure streaming functional encryption
• Unbounded quadratic functional encryption and more from pairings
• Separating selective opening security from standard security, assuming indistinguishability obfuscation

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)