Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
From MaRDI portal
Publication:6057202
DOI10.1007/978-3-031-33017-9_2zbMath1522.94040arXiv2204.02915OpenAlexW4377082027MaRDI QIDQ6057202
Publication date: 4 October 2023
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.02915
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Improved identification schemes based on error-correcting codes
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Identity-based encryption from codes with rank metric
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- LESS-FM: fine-tuning signatures from the code equivalence problem
- An algebraic approach to the rank support learning problem
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Security Proofs for Signature Schemes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- On the Complexity of the Rank Syndrome Decoding Problem
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- Decoding One Out of Many
- Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A new identification scheme based on syndrome decoding
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- Fiat-Shamir transformation of multi-round interactive proofs
This page was built for publication: Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
