Zero-knowledge and code obfuscation
From MaRDI portal
Recommendations
Cited in
(35)- Upgrading to functional encryption
- Towards breaking the exponential barrier for general secret sharing
- On virtual grey box obfuscation for general circuits
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Candidate iO from homomorphic encryption schemes
- IND-secure quantum symmetric encryption based on point obfuscation
- Offline witness encryption with semi-adaptive security
- Obfuscation for cryptographic purposes
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- On the correlation intractability of obfuscated pseudorandom functions
- Contention in cryptoland: obfuscation, leakage and UCE
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- On the implausibility of constant-round public-coin zero-knowledge proofs
- Shorter circuit obfuscation in challenging security models
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- Towards Security Notions for White-Box Cryptography
- On non-black-box simulation and the impossibility of approximate obfuscation
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- How to use indistinguishability obfuscation: deniable encryption, and more
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation
- Candidate iO from homomorphic encryption schemes
- Efficiently obfuscating re-encryption program under DDH assumption
- A conceptually simple and generic construction of plaintext checkable encryption in the standard model
- Securely obfuscating re-encryption
- Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption
- On the obfuscatability of quantum point functions
- Pseudorandom obfuscation and applications
- Towards general-purpose program obfuscation via local mixing
- Lower bounds on the overhead of indistinguishability obfuscation
- On best-possible obfuscation
This page was built for publication: Zero-knowledge and code obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707439)
