Pages that link to "Item:Q3562917"
From MaRDI portal
The following pages link to Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More (Q3562917):
Displayed 44 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- Confined guessing: new signatures from standard assumptions (Q2018822) (← links)
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity (Q2043417) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Progressive and efficient verification for digital signatures (Q2096619) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more (Q2215969) (← links)
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions (Q2235756) (← links)
- Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease (Q2317863) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Strongly unforgeable ring signature scheme from lattices in the standard model (Q2336385) (← links)
- A lattice-based signcryption scheme without random oracles (Q2515427) (← links)
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening (Q2822670) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793) (← links)
- Identity-Based Blind Signature from Lattices in Standard Model (Q2980856) (← links)
- One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Two Efficient Tag-Based Encryption Schemes on Lattices (Q3297485) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy (Q5041224) (← links)
- Survey of Lattice-Based Group Signature (Q5855889) (← links)
- Generic constructions of integrated PKE and PEKS (Q5963369) (← links)
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling (Q6104338) (← links)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- A note on the post-quantum security of (ring) signatures (Q6113964) (← links)
- Lattice signature with efficient protocols, application to anonymous credentials (Q6145918) (← links)
- A New Design of Online/Offline Signatures Based on Lattice (Q6163661) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- Almost tight multi-user security under adaptive corruptions from LWE in the standard model (Q6190153) (← links)
- Traceable policy-based signatures and instantiation from lattices (Q6195214) (← links)