Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
From MaRDI portal
Publication:2055652
DOI10.1007/978-3-030-45727-3_7zbMath1479.94295OpenAlexW3023641907MaRDI QIDQ2055652
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_7
SISmultivariate cryptographyzero-knowledgepost-quantum digital signaturespermuted kernel problemsilly acronyms
Related Items (22)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ One-time traceable ring signatures ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Short signatures from regular syndrome decoding in the head ⋮ An estimator for the hardness of the MQ problem ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Verifiable decryption in the head ⋮ On the (in)security of optimized Stern-like signature schemes ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature ⋮ Banquet: short and fast signatures from AES ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ LESS-FM: fine-tuning signatures from the code equivalence problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the security of the identification scheme based on permuted kernels
- Classical proofs for the quantum collapsing property of classical hash functions
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Aurora: transparent succinct arguments for R1CS
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- A crossbred algorithm for solving Boolean polynomial systems
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
- Hybrid approach for solving multivariate systems over finite fields
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- A new identification scheme based on syndrome decoding
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- A Permutation Network
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Computationally Binding Quantum Commitments
This page was built for publication: Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
