Zero-knowledge protocols for code-based public-key encryption

Rong Hu, Kirill Morozov, Tsuyoshi Takagi

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Code-based public-key encryption schemes (PKE) are the candidates for post-quantum cryptography, since they are believed to resist the attacks using quantum algorithms. The most famous such schemes are the McEliece encryption and the Niederreiter encryption. In this paper, we present the zero-knowledge (ZK) proof systems for proving statements about data encrypted using these schemes. Specifically, we present a proof of plaintext knowledge for both PKEs, and also a verifiable McEliece PKE. The main ingredients of our constructions are the ZK identification schemes by Stern from Crypto93 and by Jain, Krenn, Pietrzak, and Tentes from Asiacrypt12.

Original languageEnglish
Pages (from-to)2139-2151
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number10
Publication statusPublished - Oct 1 2015

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Zero-knowledge protocols for code-based public-key encryption'. Together they form a unique fingerprint.

Cite this