On unconditionally binding code-based commitment schemes

Kirill Morozov, Partha Sarathi Roy, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450348881
DOIs
Publication statusPublished - Jan 5 2017
Event11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017 - Beppu, Japan
Duration: Jan 5 2017Jan 7 2017

Publication series

NameProceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017

Other

Other11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017
CountryJapan
CityBeppu
Period1/5/171/7/17

Fingerprint

Hardness
Decoding
Cryptography

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Morozov, K., Roy, P. S., & Sakurai, K. (2017). On unconditionally binding code-based commitment schemes. In Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017 [101] (Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017). Association for Computing Machinery, Inc. https://doi.org/10.1145/3022227.3022327

On unconditionally binding code-based commitment schemes. / Morozov, Kirill; Roy, Partha Sarathi; Sakurai, Kouichi.

Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017. Association for Computing Machinery, Inc, 2017. 101 (Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Morozov, K, Roy, PS & Sakurai, K 2017, On unconditionally binding code-based commitment schemes. in Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017., 101, Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017, Association for Computing Machinery, Inc, 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017, Beppu, Japan, 1/5/17. https://doi.org/10.1145/3022227.3022327
Morozov K, Roy PS, Sakurai K. On unconditionally binding code-based commitment schemes. In Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017. Association for Computing Machinery, Inc. 2017. 101. (Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017). https://doi.org/10.1145/3022227.3022327
Morozov, Kirill ; Roy, Partha Sarathi ; Sakurai, Kouichi. / On unconditionally binding code-based commitment schemes. Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017. Association for Computing Machinery, Inc, 2017. (Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017).
@inproceedings{3290e8d48f854915af24a3de42300c64,
title = "On unconditionally binding code-based commitment schemes",
abstract = "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.",
author = "Kirill Morozov and Roy, {Partha Sarathi} and Kouichi Sakurai",
year = "2017",
month = "1",
day = "5",
doi = "10.1145/3022227.3022327",
language = "English",
series = "Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017",
publisher = "Association for Computing Machinery, Inc",
booktitle = "Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017",

}

TY - GEN

T1 - On unconditionally binding code-based commitment schemes

AU - Morozov, Kirill

AU - Roy, Partha Sarathi

AU - Sakurai, Kouichi

PY - 2017/1/5

Y1 - 2017/1/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85015159352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015159352&partnerID=8YFLogxK

U2 - 10.1145/3022227.3022327

DO - 10.1145/3022227.3022327

M3 - Conference contribution

AN - SCOPUS:85015159352

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

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

PB - Association for Computing Machinery, Inc

ER -