The following pages link to (Q4783716):
Displaying 50 items.
- Obfuscating conjunctions (Q514475) (← links)
- Using algebraic models of programs for detecting metamorphic malwares (Q549466) (← links)
- Securely obfuscating re-encryption (Q656916) (← links)
- A low-cost memory remapping scheme for address bus protection (Q666092) (← links)
- On the obfuscatability of quantum point functions (Q669933) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- On best-possible obfuscation (Q744349) (← links)
- On strong simulation and composable point obfuscation (Q744605) (← links)
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation (Q780319) (← links)
- Generalising the array split obfuscation (Q867610) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← 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)
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems (Q1650427) (← links)
- Software watermarking: a semantics-based approach (Q1650961) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Classical leakage resilience from fault-tolerant quantum computation (Q2010581) (← links)
- White-box cryptography: don't forget about grey-box attacks (Q2010584) (← links)
- Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Secure software leasing (Q2056750) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Collusion resistant watermarkable PRFs from standard assumptions (Q2096500) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- IND-secure quantum symmetric encryption based on point obfuscation (Q2100792) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Impossibility of quantum virtual black-box obfuscation of classical circuits (Q2120091) (← links)
- New approaches for quantum copy-protection (Q2120093) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- White box traitor tracing (Q2139638) (← links)
