Traceable policy-based signatures and instantiation from lattices

DOI10.1016/j.ins.2022.06.031arXiv2007.00033OpenAlexW3039332610MaRDI QIDQ6195214

Huaxiong Wang, Yanhong Xu, Khoa Nguyen, Reihaneh Safavi-Naini

Publication date: 13 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.00033

zbMATH Keywords

privacyzero-knowledge proofstraceabilitypolicy-based signaturesmodular constructionslattice-based instantiations

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Policy-based signature scheme from lattices
• An efficient ring signature scheme from pairings
• Attribute-based key-insulated signature and its applications
• Traceable ring signatures with post-quantum security
• Hidden attribute-based signatures without anonymity revocation
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
• A lattice-based group signature scheme with verifier-local revocation
• Constant-size group signatures from lattices
• Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
• Leakage-resilient group signature: definitions and constructions
• An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
• Escrow free attribute-based signature with self-revealability
• Group signatures with controllable linkability for dynamic membership
• On the Non-malleability of the Fiat-Shamir Transform
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• A Group Signature Scheme from Lattice Assumptions
• Attribute-Based Signatures
• Random Oracles in a Quantum World
• A new paradigm for public key identification
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Anonymous Proxy Signatures
• 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
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Group Signatures
• Group Signatures with Message-Dependent Opening
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Information Security and Privacy
• Functional Signatures and Pseudorandom Functions
• Policy-Based Signatures
• Decentralized Traceable Attribute-Based Signatures
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Topics in Cryptology – CT-RSA 2005
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Traceable policy-based signatures and instantiation from lattices