Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
From MaRDI portal
Publication:3562917
DOI10.1007/978-3-642-13013-7_29zbMath1281.94074OpenAlexW1560474949MaRDI QIDQ3562917
Publication date: 28 May 2010
Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_29
Related Items
Lattice-based key exchange on small integer solution problem ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Policy-based signature scheme from lattices ⋮ Tightly secure signatures from lossy identification schemes ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ A note on the post-quantum security of (ring) signatures ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A New Design of Online/Offline Signatures Based on Lattice ⋮ Efficient authentication from hard learning problems ⋮ Lattice-based programmable hash functions and applications ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Programmable hash functions and their applications ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Identity-Based Blind Signature from Lattices in Standard Model ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions ⋮ Efficient public-key encryption with equality test from lattices ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Confined guessing: new signatures from standard assumptions ⋮ Generic constructions of integrated PKE and PEKS ⋮ A lattice-based signcryption scheme without random oracles ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ One-Time Signatures and Chameleon Hash Functions ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ The Geometry of Lattice Cryptography ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Strongly unforgeable ring signature scheme from lattices in the standard model ⋮ Survey of Lattice-Based Group Signature ⋮ Progressive and efficient verification for digital signatures ⋮ Implementation of lattice trapdoors on modules and applications
This page was built for publication: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
