A Provably Secure Group Signature Scheme from Code-Based Assumptions
From MaRDI portal
Publication:2811134
DOI10.1007/978-3-662-48797-6_12zbMath1396.94075arXiv1909.04472OpenAlexW2254971601MaRDI QIDQ2811134
Huaxiong Wang, Martianus Frederic Ezerman, San Ling, Khoa Nguyen, Hyung Tae Lee
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.04472
Related Items (15)
A scalable post-quantum hash-based group signature ⋮ A rank metric code-based group signature scheme ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ A code-based group signature scheme ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ A Practical Group Signature Scheme Based on Rank Metric
This page was built for publication: A Provably Secure Group Signature Scheme from Code-Based Assumptions
