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 29 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)
- Lattice-based linearly homomorphic signature scheme over binary field (Q5018301) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities (Q6122595) (← links)
- Generic constructions of master-key KDM secure attribute-based encryption (Q6146591) (← links)
- A survey on functional encryption (Q6163797) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- Traceable policy-based signatures and instantiation from lattices (Q6195214) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing (Q6494637) (← links)