scientific article
From MaRDI portal
Publication:2707439
zbMath0980.94020MaRDI QIDQ2707439
Publication date: 6 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Upgrading to functional encryption ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ 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 ⋮ White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation ⋮ Securely obfuscating re-encryption ⋮ Offline witness encryption with semi-adaptive security ⋮ On the obfuscatability of quantum point functions ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Obfuscation for cryptographic purposes ⋮ Candidate iO from homomorphic encryption schemes ⋮ 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 ⋮ On best-possible obfuscation ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Candidate iO from homomorphic encryption schemes ⋮ On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ Towards Security Notions for White-Box Cryptography ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More ⋮ IND-secure quantum symmetric encryption based on point obfuscation ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
This page was built for publication: