Zero-knowledge protocols for the McEliece encryption

DOI10.1007/978-3-642-31448-3_14MaRDI QIDQ2907371zbMATH OpenOpenAlexFDO

Authors Kirill E. Morozov, Tsuyoshi Takagi

Publication date 7 September 2012

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31448-3_14

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Proof of plaintext knowledge for the ajtai-dwork cryptosystem
• Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
• On the CCA2 security of McEliece in the standard model
• Coding-Based Oblivious Transfer
• Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions

Cited in

(8)

• Group encryption: full dynamicity, message filtering and code-based instantiation
• Zero-knowledge proofs for committed symmetric Boolean functions
• Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
• Argument of knowledge of a Goppa codeword and of a bounded error
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Fully dynamic attribute-based signatures for circuits from codes
• Short code-based one-out-of-many proofs and applications
• Group encryption with oblivious traceability

This page was built for publication: Zero-knowledge protocols for the McEliece encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907371)