Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
From MaRDI portal
Publication:2055702
DOI10.1007/978-3-030-45388-6_16zbMath1481.94135OpenAlexW3021611028MaRDI QIDQ2055702
André Chailloux, Thomas Debris-Alazard
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_16
Related Items (2)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Optimal tightness for chain-based unique signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ternary Syndrome Decoding with large weight
- Decoding linear codes with high error rate and its impact for LPN security
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Critical perspectives on provable security: fifteen years of ``another look papers
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
- Random Oracles in a Quantum World
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Decoding One Out of Many
- Trapdoors for hard lattices and new cryptographic constructions
- Security Bounds for the Design of Code-Based Cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- On the complexity of some cryptographic problems based on the general decoding problem
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
