Pages that link to "Item:Q3457113"
From MaRDI portal
The following pages link to Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113):
Displaying 49 items.
- Obfuscating conjunctions (Q514475) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Multilinear Maps from Obfuscation (Q2796137) (← links)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- Shorter Circuit Obfuscation in Challenging Security Models (Q2827739) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- Cryptanalysis of GGH15 Multilinear Maps (Q2829232) (← links)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Q2829233) (← links)
- Circular Security Separations for Arbitrary Length Cycles from LWE (Q2829235) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption (Q5267417) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 (Q5738782) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) (Q6138084) (← links)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification (Q6145785) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)