Paper 2018/083
Flaws in a Verifiably Multiplicative Secret Sharing Scheme from ICITS 2017
Maki Yoshida and Satoshi Obana
Abstract
In this paper, we point out flaws in an existing verifiably multiplicative secret sharing (VMSS) scheme. Namely, we show that a scheme proposed by Yoshida and Obana presented at ICITS 2017 is insecure against an adversary who corrupts a single player. We then show that in the model of ICITS 2017 which restricts the decoder additive, the error-free verification is impossible. We further show that by allowing a general class of decoders which include a linear one, the scheme is error-free.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MAJOR revision.
- Keywords
- secret sharingmultiplicativeverifiabilitycryptanalysis
- Contact author(s)
- maki-yos @ nict go jp
- History
- 2018-01-26: received
- Short URL
- https://ia.cr/2018/083
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/083,
author = {Maki Yoshida and Satoshi Obana},
title = {Flaws in a Verifiably Multiplicative Secret Sharing Scheme from {ICITS} 2017},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/083},
year = {2018},
url = {https://eprint.iacr.org/2018/083}
}
