Commitment schemes are one of the basic building blocks to construct secure protocols for multi party computation. Many recent works are exploring hardware primitives like physically unclonable functions to build keyless cryptographic protocols, with minimal assumptions. The asymmetric nature and non-invertibility property of PUFs are widely exploited to build oblivious transfer protocols that are extended to build bit-commitment schemes. However, these schemes require the physical transfer of the PUF device between the interacting parties. In this work, we introduce a new class of hardware-based primitives called physically related functions that enable hardware circuits to securely communicate with each other over insecure channels. We propose a bit-commitment protocol based on this hardware primitive without needing any physical transfer. Our scheme is statistically hiding and computationally binding, requiring only one round of communication while being practically deployable. We explore the security properties of physically related functions, under which we prove the security of our scheme. We experimentally show that it is impossible to break the security of the scheme with more than negligible probability.

中文翻译：

---

通过实际相关职能做出的承诺


承诺方案是构建多方计算安全协议的基本构建块之一。最近的许多工作正在探索硬件原语，例如物理上不可克隆的函数，以在最少的假设下构建无密钥加密协议。 PUF 的不对称性质和不可逆性被广泛用于构建不经意的传输协议，这些协议被扩展以构建比特承诺方案。然而，这些方案需要在交互方之间物理转移PUF设备。在这项工作中，我们引入了一类新的基于硬件的原语，称为物理相关函数，使硬件电路能够通过不安全的通道安全地相互通信。我们提出了一种基于该硬件原语的比特承诺协议，无需任何物理传输。我们的方案是统计隐藏和计算绑定的，只需要一轮通信，同时实际上是可部署的。我们探索物理相关功能的安全属性，并在此基础上证明我们方案的安全性。我们通过实验证明，不可能以大于可忽略的概率来破坏该方案的安全性。