Zero-knowledge protocols for the McEliece encryption

Kirill Morozov, Tsuyoshi Takagi

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

7 被引用数 (Scopus)

抄録

We present two zero-knowledge protocols for the code-based McEliece public key encryption scheme in the standard model. Consider a prover who encrypted a plaintext m into a ciphertext c under the public key pk. The first protocol is a proof of plaintext knowledge (PPK), where the prover convinces a polynomially bounded verifier on a joint input (c,pk) that he knows m without actually revealing it. This construction uses code-based Véron's zero-knowledge identification scheme. The second protocol, which builds on the first one, is a verifiable McEliece encryption, were the prover convinces a polynomially bounded verifier on a joint input (c,pk,m) that c is a valid encryption of m, without performing decryption. These protocols are the first PPK and the first verifiable encryption for code-based cryptosystems.

本文言語英語
ホスト出版物のタイトルInformation Security and Privacy - 17th Australasian Conference, ACISP 2012, Proceedings
ページ180-193
ページ数14
DOI
出版ステータス出版済み - 2012
イベント17th Australasian Conference on Information Security and Privacy, ACISP 2012 - Wollongong, NSW, オーストラリア
継続期間: 7月 9 20127月 11 2012

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7372 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他17th Australasian Conference on Information Security and Privacy, ACISP 2012
国/地域オーストラリア
CityWollongong, NSW
Period7/9/127/11/12

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Zero-knowledge protocols for the McEliece encryption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル