Pages that link to "Item:Q1928766"
From MaRDI portal
The following pages link to Bonsai trees, or how to delegate a lattice basis (Q1928766):
Displayed 37 items.
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption (Q2035455) (← links)
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity (Q2043417) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Revocable hierarchical attribute-based signatures from lattices (Q2096621) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Lattice-based IBE with equality test supporting flexible authorization in the standard model (Q2152055) (← links)
- Dynamic collusion bounded functional encryption from identity-based encryption (Q2170069) (← links)
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more (Q2215969) (← links)
- Efficient identity-based encryption with hierarchical key-insulation from HIBE (Q2232128) (← links)
- Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Strongly unforgeable ring signature scheme from lattices in the standard model (Q2336385) (← links)
- Survey of information security (Q2385398) (← links)
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 (Q2673979) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- Updatable public key encryption in the standard model (Q2697895) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
- Targeted Homomorphic Attribute-Based Encryption (Q3181032) (← links)
- (Q4638057) (← links)
- Algorithms for the Generalized NTRU Equations and their Storage Analysis (Q4988919) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Generic Constructions of Revocable Identity-Based Encryption (Q5040410) (← links)
- Algebraic Attacks Against Several Weak Variants of GVW’13 ABE (Q5205016) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance (Q5970987) (← links)
- More efficient adaptively secure lattice-based IBE with equality test in the standard model (Q6111983) (← links)
- Forward-secure encryption with fast forwarding (Q6114263) (← links)
- Candidate witness encryption from lattice techniques (Q6155267) (← links)
- Post-quantum asynchronous deniable key exchange and the signal handshake (Q6169026) (← links)
- Public key authenticated encryption with keyword search from LWE (Q6173292) (← links)