Pages that link to "Item:Q4924400"
From MaRDI portal
The following pages link to Candidate Multilinear Maps from Ideal Lattices (Q4924400):
Displayed 50 items.
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- Bad Directions in Cryptographic Hash Functions (Q3194624) (← links)
- Trapdoors for Ideal Lattices with Applications (Q3454588) (← links)
- Predicate Encryption for Circuits from LWE (Q3457082) (← links)
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113) (← links)
- New Multilinear Maps Over the Integers (Q3457114) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Adaptive Simulation Security for Inner Product Functional Encryption (Q5041151) (← links)
- Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) (Q5056035) (← links)
- Functional Encryption for Cascade Automata (Extended Abstract) (Q5207903) (← links)
- Testing Isomorphism of Lattices over CM-Orders (Q5232327) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- Ciphertext-policy attribute-based encryption for general circuits from bilinear maps (Q5371908) (← 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)
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← links)
- Provably Secure NTRU Instances over Prime Cyclotomic Rings (Q5738796) (← links)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Multi-input Inner-Product Functional Encryption from Pairings (Q5738891) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Simultaneous diagonalization of incomplete matrices and applications (Q5853794) (← links)
- Tensors in computations (Q5887832) (← links)
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions (Q5896157) (← links)
- Unbounded inner product functional encryption from bilinear maps (Q5915907) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- Unbounded inner product functional encryption from bilinear maps (Q5919081) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs (Q6057185) (← links)
- Unbounded quadratic functional encryption and more from pairings (Q6063532) (← links)
- Broadcast, trace and revoke with optimal parameters from polynomial hardness (Q6063535) (← links)
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation (Q6070448) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- On the security of functional encryption in the generic group model (Q6095189) (← links)