Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
From MaRDI portal
Publication:2055702
Recommendations
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- How to prove security of a signature with a tighter security reduction
- Improving signature schemes with tight security reductions
- Improvement and efficient implementation of a lattice-based signature scheme
- A code-based signature scheme from the Lyubashevsky framework
Cites work
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Analysis of information set decoding for a sub-linear error weight
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Critical perspectives on provable security: fifteen years of ``another look papers
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding one out of many
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 2077078 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the complexity of some cryptographic problems based on the general decoding problem
- On the inherent intractability of certain coding problems (Corresp.)
- Random oracles in a quantum world
- Security bounds for the design of code-based cryptosystems
- Ternary Syndrome Decoding with large weight
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Trapdoors for hard lattices and new cryptographic constructions
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Cited in
(6)- Optimal tightness for chain-based unique signatures
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Generalized First Pre-image Tractable Random Oracle Model and Signature Schemes
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- History-free sequential aggregation of hash-and-sign signatures
- SoK: how (not) to design and implement post-quantum cryptography
This page was built for publication: Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055702)
