Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Post-Quantum Group Signatures from Symmetric Primitives.

Dan Boneh, Saba Eskandarian, Ben Fisch

Published Jan 1, 2018• 7 citations
OpenAlex

Related papers

Post-quantum ID-Based Ring Signatures from Symmetric-Key Primitives

Maxime Buser, Joseph K. Liu, Ron Steinfeld +1 more

Lecture notes in computer science•Jan 1, 2022•8 citations

Post-quantum Anonymous Signatures from the Lattice Isomorphism Group Action

Chris van Noorden, Paola de Perthuis

Lecture notes in computer science•Sep 26, 2026•0 citations

Sphinx-in-the-Head: Group Signatures from Symmetric Primitives

Liqun Chen, Changyu Dong, Christopher J. P. Newton +1 more

Group signatures and their variants have been widely used in privacy-sensitive scenarios such as anonymous authentication and attestation. In this paper, we present a new post-quantum group signature scheme from symmetric primitives. Using only symmetric primitives makes the scheme less prone to unknown attacks than basing the design on newly proposed hard problems whose security is less well-understood. However, symmetric primitives do not have rich algebraic properties, and this makes it extremely challenging to design a group signature scheme on top of them. It is even more challenging if we want a group signature scheme suitable for real-world applications, one that can support large groups and require few trust assumptions. Our scheme is based on MPC-in-the-head non-interactive zero-knowledge proofs, and we specifically design a novel hash-based group credential scheme, which is rooted in the SPHINCS+ signature scheme but with various modifications to make it MPC (multi-party computation) friendly. The security of the scheme has been proved under the fully dynamic group signature model. We provide an implementation of the scheme and demonstrate the feasibility of handling a group size as large as 2 60 . This is the first group signature scheme from symmetric primitives that supports such a large group size and meets all the security requirements.

ACM Transactions on Privacy and Security•Dec 27, 2023•12 citations

Quantum homomorphic signature

Tao Shang, Xiaojie Zhao, Chao Wang +1 more

Quantum Information Processing•Oct 22, 2014•41 citations

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

Melissa Chase, David Derler, Steven Goldfeder +5 more

We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parameterizable.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 27, 2017•257 citations

Post-Quantum Secure Group Signatures

Laurens Porzenheim

•Jan 1, 2019•0 citations
Group signatures and their variants have been widely used in privacy-sensitive scenarios such as anonymous authentication and attestation. In this paper, we present a new post-quantum group signature scheme from symmetric primitives. Using only symmetric primitives makes the scheme less prone to unknown attacks than basing the design on newly proposed hard problems whose security is less well-understood. However, symmetric primitives do not have rich algebraic properties, and this makes it extremely challenging to design a group signature scheme on top of them. It is even more challenging if we want a group signature scheme suitable for real-world applications, one that can support large groups and require few trust assumptions. Our scheme is based on MPC-in-the-head non-interactive zero-knowledge proofs, and we specifically design a novel hash-based group credential scheme, which is rooted in the SPHINCS+ signature scheme but with various modifications to make it MPC (multi-party computation) friendly. The security of the scheme has been proved under the fully dynamic group signature model. We provide an implementation of the scheme and demonstrate the feasibility of handling a group size as large as 2 60 . This is the first group signature scheme from symmetric primitives that supports such a large group size and meets all the security requirements.