An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
From MaRDI portal
Publication:2876905
DOI10.1007/3-540-68339-9_22zbMath1304.94056OpenAlexW1961257075MaRDI QIDQ2876905
Jacques Stern, Jean-Bernard Fischer
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_22
Related Items (14)
About Low DFR for QC-MDPC Decoding ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ On codes and learning with errors over function fields ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Efficient authentication from hard learning problems ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds ⋮ Agnostic Learning from Tolerant Natural Proofs ⋮ QUAD: A multivariate stream cipher with provable security ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ Decoding One Out of Many ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ A Practical Group Signature Scheme Based on Rank Metric
This page was built for publication: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
