Public-coin differing-inputs obfuscation and its applications
From MaRDI portal
Publication:5261695
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
(28)- Leakage resilience from program obfuscation
- Structure-preserving compilers from new notions of obfuscations
- Random walks and concurrent zero-knowledge
- Selective-Opening Security in the Presence of Randomness Failures
- The pseudorandom oracle model and ideal obfuscation
- Signatures Resilient to Uninvertible Leakage
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Bounded Collusion ABE for TMs from IBE
- Multi-input functional encryption with unbounded-message security
- Output-compressing randomized encodings and applications
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- 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
- Constrained PRFs for unbounded inputs with short keys
- 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
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Adaptively secure MPC with sublinear communication complexity
- Succinct computational secret sharing
- Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
- Strongly full-hiding inner product encryption
- Standard security does not imply indistinguishability under selective opening
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- New negative results on differing-inputs 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)