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