On unconditionally binding code-based commitment schemes

Kirill Morozov, Partha Sarathi Roy, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

2 被引用数 (Scopus)

抄録

In this work, we construct a dual version of statistically binding commitment scheme by Jain et al. (Asiacrypt 2012) with shorter commitment size under hardness of syndrome decoding. Then, we point out that perfectly binding variants of the above schemes follow directly from the Randomized McEliece and Niederreiter public key encryption schemes, assuming indistinguishability of permuted Goppa codes, as well as hardness of the exact learning parity with noise (xLPN) problem (for the McEliece scheme) and hardness of syndrome decoding (for the Niederreiter scheme). Our key observation here is that perfect binding (as opposed to statistical binding) requires exact knowledge of minimal distance of the underlying code. Finally, we provide security evaluation of our proposals, and compare their performance with that of existing schemes.

本文言語英語
ホスト出版物のタイトルProceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017
出版社Association for Computing Machinery, Inc
ISBN(電子版)9781450348881
DOI
出版ステータス出版済み - 1 5 2017
イベント11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017 - Beppu, 日本
継続期間: 1 5 20171 7 2017

出版物シリーズ

名前Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017

その他

その他11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017
国/地域日本
CityBeppu
Period1/5/171/7/17

All Science Journal Classification (ASJC) codes

  • コンピュータ ネットワークおよび通信
  • 情報システム

フィンガープリント

「On unconditionally binding code-based commitment schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル