Pages that link to "Item:Q3563854"
From MaRDI portal
The following pages link to Bonsai Trees, or How to Delegate a Lattice Basis (Q3563854):
Displaying 50 items.
- An efficient IBE scheme with tight security reduction in the random oracle model (Q264126) (← links)
- Efficient multi-party concurrent signature from lattices (Q280930) (← links)
- Lattice-based linearly homomorphic signatures in the standard model (Q284579) (← links)
- Policy-based signature scheme from lattices (Q306050) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- A lattice-based identity-based proxy blind signature scheme in the standard model (Q1718090) (← links)
- An efficient homomorphic aggregate signature scheme based on lattice (Q1718616) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Relations between semantic security and anonymity in identity-based encryption (Q1944921) (← links)
- Deterministic public-key encryption for adaptively-chosen plaintext distributions (Q1994638) (← links)
- Confined guessing: new signatures from standard assumptions (Q2018822) (← links)
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key (Q2037197) (← links)
- Revocable attribute-based proxy re-encryption (Q2048189) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← 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)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- A lattice-based fully dynamic group signature scheme without NIZK (Q2057162) (← links)
- Exact lattice sampling from non-Gaussian distributions (Q2061936) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
- Wildcarded identity-based encryption from lattices (Q2067630) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Progressive and efficient verification for digital signatures (Q2096619) (← links)
- Password protected secret sharing from lattices (Q2117043) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\) (Q2118552) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Attribute-based access control for inner product functional encryption from LWE (Q2146083) (← links)
