Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
type: Item
instance of: scholarly article
title: Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
zbMATH Open document ID: 1481.94135
DOI: 10.1007/978-3-030-45388-6_16
author: André Chailloux
author: Thomas Debris-Alazard
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 7436981
zbMATH Keywords: GPV construction
zbMATH Keywords: signature schemes
MaRDI profile type: Publication
full work available at URL: 978-3-030-45388-6 16
OpenAlex ID: W3021611028
cites work: Q4470455
cites work: Ternary Syndrome Decoding with large weight
cites work: Random Oracles in a Quantum World
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: Decoding linear codes with high error rate and its impact for LPN security
cites work: On the inherent intractability of certain coding problems (Corresp.)
cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
cites work: Approximate trapdoors for lattices and smaller hash-and-sign signatures
cites work: From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
cites work: Q4536804
cites work: Q4737250
cites work: Analysis of Information Set Decoding for a Sub-linear Error Weight
cites work: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
cites work: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
cites work: Security Bounds for the Design of Code-Based Cryptosystems
cites work: Q4829810
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: On the complexity of some cryptographic problems based on the general decoding problem
cites work: Critical perspectives on provable security: fifteen years of ``another look'' papers
cites work: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
cites work: On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
cites work: Decoding One Out of Many
cites work: Q3835408
description: scientific article; zbMATH DE number 7436981