Pages that link to "Item:Q5395678"
From MaRDI portal
The following pages link to On the (im)possibility of obfuscating programs (Q5395678):
Displaying 50 items.
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← links)
- On best-possible obfuscation (Q744349) (← links)
- Obfuscating finite automata (Q832331) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Code obfuscation against abstraction refinement attacks (Q1624593) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries (Q1631357) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Incremental program obfuscation (Q1680211) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- On perfect correctness in (lockable) obfuscation (Q2055721) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Universal proxy re-encryption (Q2061932) (← links)
- Instantiation of quantum point obfuscation (Q2102226) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Watermarking PRFs against quantum adversaries (Q2170100) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- New approaches to traitor tracing with embedded identities (Q2175935) (← links)
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications (Q2179397) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- Obfuscating simple functionalities from knowledge assumptions (Q2289432) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- Survey of information security (Q2385398) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
- Secure software leasing from standard assumptions (Q2695623) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Reconfigurable Cryptography: A Flexible Approach to Long-Term Security (Q2796136) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
