TY - GEN
T1 - On unconditionally binding code-based commitment schemes
AU - Morozov, Kirill
AU - Roy, Partha Sarathi
AU - Sakurai, Kouichi
N1 - Publisher Copyright:
© 2017 ACM.
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
T2 - 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017
Y2 - 5 January 2017 through 7 January 2017
ER -