Homomorphic commitment scheme with constant output locality

Miyaji, Hideaki; Miyaji, Atsuko; Wang, Yuntao

doi:10.1109/candar51075.2020.00030

Cited by 1 publication

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another one is to avoid using such strong randomness extractors and to construct a commitment scheme directly from a hash function [9,10], which are our preliminary works. Remark that, in [9], it only proves that the output locality is smaller than the input length, and in [10], it is only claimed that the hiding property is based on the decisional (M, δ)-bSVP assumption, whereas no concrete proof was given nor the relation between the decisional (M, δ)-bSVP assumption and (M, δ)-bSVP assumption was shown. In other words, no secure commitment with output locality-3 has been proposed so far without using strong randomness extractors.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Commitment Scheme with Output Locality-3 Fit for the IoT Device

Miyaji

Wang

Kawachi

et al. 2021

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

Low output locality is a property of functions, in which every output bit depends on a small number of input bits. In IoT devices with only a fragile CPU, it is important for many IoT devices to cooperate to execute a single function. In such IoT’s collaborative work, a feature of low output locality is very useful. This is why it is desirable to reconstruct cryptographic primitives with low output locality. However, until now, commitment with a constant low output locality has been constructed by using strong randomness extractors from a nonconstant-output-locality collision-resistant hash function. In this paper, we construct a commitment scheme with output locality-3 from a constant-output-locality collision-resistant hash function for the first time. We prove the computational hiding property of our commitment by the decisional M , δ -bSVP assumption and prove the computational binding property by the M , δ -bSVP assumption, respectively. Furthermore, we prove that the M , δ -bSVP assumption can be reduced to the decisional M , δ -bSVP assumption. We also give a parameter suggestion for our commitment scheme with the 128 bit security.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Compared to previous works [10] in CANDAR 2020, this paper is the full version of the paper presented at CANDAR 2020. In our preliminary work [10], we have constructed a commitment scheme with output locality-3. However, it does not include any security consideration.…”

Section: Introductionmentioning

confidence: 99%