Policy-based signature scheme from lattices

DOI10.1007/s10623-015-0126-yzbMath1379.94052OpenAlexW1474293894MaRDI QIDQ306050

Shantian Cheng, Huaxiong Wang, Khoa Nguyen

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0126-y

zbMATH Keywords

lattice-based cryptographypolicy-based signaturesthe bonsai treezero-knowledge protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease

Uses Software

• BLISS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice Signatures and Bimodal Gaussians
• Lattice-Based Group Signatures with Logarithmic Signature Size
• Improved Short Lattice Signatures in the Standard Model
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Lattice Signatures without Trapdoors
• Fully Anonymous Attribute Tokens from Lattices
• Simpler Efficient Group Signatures from Lattices
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• A Group Signature Scheme from Lattice Assumptions
• Lattice-Based Blind Signatures
• Attribute-Based Signatures
• A new paradigm for public key identification
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Bonsai Trees, or How to Delegate a Lattice Basis
• Structure-Preserving Signatures and Commitments to Group Elements
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Group Signatures
• Applied Cryptography and Network Security
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Compact E-Cash
• Generating Shorter Bases for Hard Random Lattices
• Lattice-Based Group Signature Scheme with Verifier-Local Revocation
• Policy-Based Signatures
• Mesh Signatures
• Asymptotically Efficient Lattice-Based Digital Signatures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Automata, Languages and Programming
• On Signatures of Knowledge
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Policy-based signature scheme from lattices