Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer

Yilei Wang, Ming Liu, Huawei Ma, Shuyu Fan, Huiyu Zhou, Siqi Ju, Xiaoying Wang, Qintai Yang

Abstract: Highlights•We construct a payment channel scheme. ObliHub uses the OPT to achieve the unlinkability and atomicity of transfers (§3).•We propose an oblivious puzzle transfer (OPT) protocol and prove its security based on the UC framework (§4).•We simulate and analyze the performance. ObliHub has only 2 stages. The running time is 0.2 s less than A2L<math><msup is="true"><mrow is="true"><mi is="true">A</mi></mrow><mrow is="true"><mn is="true">2</mn></mrow></msup><mi is="true">L</mi></math> (§5).