Semantic security for the McEliece cryptosystem without random oracles
type: Item
instance of: scholarly article
title: Semantic security for the McEliece cryptosystem without random oracles
zbMATH Open document ID: 1196.94062
author: Ryo Nojima
author: Kazukuni Kobara
author: Kirill E. Morozov
author: Hideki Imai
published in: Designs, Codes and Cryptography
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 5536768
describes a project that uses: McEliece
MaRDI profile type: Publication
full work available at URL: s10623-008-9175-9
OpenAlex ID: W2137648527
Wikidata QID: Q59383161
cites work: Q4365732
cites work: On the inherent intractability of certain coding problems (Corresp.)
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
cites work: Q3615883
cites work: Q4474171
cites work: Q4249317
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: A Summary of McEliece-Type Cryptosystems and their Security
cites work: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: Foundations of Cryptography
cites work: Probabilistic encryption
cites work: Parallel and Concurrent Security of the HB and HB + Protocols
cites work: Q2724577
cites work: A probabilistic algorithm for computing minimum weights of large error-correcting codes
cites work: On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
cites work: Weak keys in the McEliece public-key cryptosystem
cites work: Q4156696
cites work: Q3752293
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Is code equivalence easy to decide?
cites work: Q4950040
cites work: Finding the permutation between equivalent linear codes: the support splitting algorithm
cites work: Q4783729
cites work: Q3835408
DOI: 10.1007/S10623-008-9175-9
DBLP publication ID: journals/dcc/NojimaIKM08
description: scientific article; zbMATH DE number 5536768