Pages that link to "Item:Q5495825"
From MaRDI portal
The following pages link to Attribute-based encryption for circuits (Q5495825):
Displaying 50 items.
- Generalized closest substring encryption (Q300391) (← links)
- Verifiability-based conversion from CPA to CCA-secure predicate encryption (Q683914) (← links)
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption (Q887451) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing (Q1701978) (← links)
- Improved inner-product encryption with adaptive security and full attribute-hiding (Q1710620) (← links)
- Fine-grained searchable encryption in multi-user setting (Q1741938) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- CP-ABE for circuits (and More) in the symmetric key setting (Q2055716) (← links)
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Generic negation of pair encodings (Q2061950) (← links)
- Efficient fully CCA-secure predicate encryptions from pair encodings (Q2070257) (← links)
- Functional encryption for attribute-weighted sums from \(k\)-Lin (Q2096503) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Making \textit{any} attribute-based encryption accountable, efficiently (Q2167762) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin (Q2188962) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Access control encryption with efficient verifiable sanitized decryption (Q2200529) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- A survey of lattice based expressive attribute based encryption (Q2668411) (← links)
- Blind key-generation attribute-based encryption for general predicates (Q2673977) (← links)
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 (Q2673979) (← links)
- Unbounded dynamic predicate compositions in ABE from standard assumptions (Q2691592) (← links)
- Inner-product functional encryption with fine-grained access control (Q2691594) (← links)
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH (Q2697676) (← links)
- ABE for DFA from LWE against bounded collusions, revisited (Q2697861) (← links)
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography (Q2698337) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps (Q2802421) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- More Efficient Constructions for Inner-Product Encryption (Q2822673) (← links)
- Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions (Q2822675) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
