\textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
From MaRDI portal
Publication:6635752
DOI10.1007/978-3-031-57718-5_8MaRDI QIDQ6635752FDOQ6635752
Authors: Hongrui Cui, Hanlin Liu, Di Yan, Kang Yang, Yu Yu, Kaiyi Zhang 
Publication date: 12 November 2024
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A New Approach to Practical Active-Secure Two-Party Computation
- On the inherent intractability of certain coding problems (Corresp.)
- Semi-homomorphic encryption and multiparty computation
- A new identification scheme based on syndrome decoding
- Title not available (Why is that?)
- Improved identification schemes based on error-correcting codes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- The return of the SDitH
- Some new NP-complete coding problems
- Actively Secure OT Extension with Optimal Overhead
- TinyKeys: a new approach to efficient multi-party computation
- LESS is More: Code-Based Signatures Without Syndromes
- Efficient UC commitment extension with homomorphism for free (and applications)
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
- LESS-FM: fine-tuning signatures from the code equivalence problem
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- 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
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Short signatures from regular syndrome decoding in the head
- Half-tree: halving the cost of tree expansion in COT and DPF
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- SDitH in the QROM
This page was built for publication: \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635752)
