Pages that link to "Item:Q2816296"
From MaRDI portal
The following pages link to Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296):
Displayed 50 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- 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)
- Obfuscating conjunctions (Q514475) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Obfuscating finite automata (Q832331) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- A ciphertext-size lower bound for order-preserving encryption with limited leakage (Q1631322) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries (Q1631357) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Software watermarking: a semantics-based approach (Q1650961) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← 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)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- White-box cryptography: don't forget about grey-box attacks (Q2010584) (← links)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Secure software leasing (Q2056750) (← 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)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
