Policy-based signature scheme from lattices

DOI10.1007/S10623-015-0126-YzbMATH Open1379.94052OpenAlexW1474293894MaRDI QIDQ306050FDOQ306050

Authors: Shantian Cheng, Hoa Nguyen, Huaxiong Wang 

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

Recommendations

• Policy-Based Signatures
• Policy-compliant signatures
• A lattice-based identity-based proxy blind signature scheme in the standard model
• Identity-based proxy re-signatures from lattices
• Identity-based blind signature from lattices in standard model

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• On lattices, learning with errors, random linear codes, and cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai trees, or how to delegate a lattice basis
• Improved short lattice signatures in the standard model
• Lattice signatures without trapdoors
• Title not available (Why is that?)
• Generating shorter bases for hard random lattices
• Structure-preserving signatures and commitments to group elements
• Group Signatures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Title not available (Why is that?)
• Lattice signatures and bimodal Gaussians
• Lattice-based group signatures with logarithmic signature size
• Trapdoors for lattices: simpler, tighter, faster, smaller
• 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
• Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Title not available (Why is that?)
• Applied Cryptography and Network Security
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Compact E-Cash
• Lattice-based group signature scheme with verifier-local revocation
• Policy-Based Signatures
• Mesh Signatures
• Asymptotically Efficient Lattice-Based Digital Signatures
• Automata, Languages and Programming
• On Signatures of Knowledge

Cited In (10)

• Bicameral and auditably private signatures
• A lattice-based group signature scheme with verifier-local revocation
• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
• Policy-Based Signatures
• Traceable policy-based signatures and instantiation from lattices
• Fully dynamic attribute-based signatures for circuits from codes
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Policy-compliant signatures

Uses Software

• BLISS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306050)