零知识模型检查
Zero-Knowledge Model Checking
AI总结:
本文提出一种无需泄露系统即可形式验证其功能正确性的技术,结合演绎方法和零知识证明,通过排名函数生成形式证书,适用于安全与保密性均至关重要的领域。
摘要:
我们介绍了一种技术,用于形式验证软件系统满足功能正确性的时序规范,而无需泄露系统本身。我们的方法结合了演绎方法的模型检查来获得系统的形式正确性证书,与零知识证明相结合,以说服外部验证者,保密的系统符合公开的正确性规范。我们考虑证明证书表示为排名函数,并引入了零知识中的显式状态和符号方案进行模型检查。显式状态方案假设系统表示为转换图,我们使用多项式承诺来说服验证者公开的证明证书对应于保密的转换关系。符号方案假设系统指定为线性守卫命令,并使用分段线性排名函数。我们应用Farkas引理来获得有效性见证,使用sigma协议进行矩阵乘法和范围证明来说服验证者见证的存在。我们构建了一个原型,以展示我们的两种方案在线性时序逻辑验证示例中的实际有效性。我们的技术使在安全性和保密性均至关重要的领域中能够实现形式验证。
英文摘要:
We introduce a technology to formally verify that a software system satisfies a temporal specification of functional correctness, without revealing the system itself. Our method combines a deductive approach to model checking to obtain a formal certificate of correctness for the system, with zero-knowledge proofs to convince an external verifier that the system -- kept secret -- complies with its specification of correctness -- made public. We consider proof certificates represented as ranking functions, and introduce both an explicit-state and a symbolic scheme for model checking in zero knowledge. Our explicit-state scheme assumes systems represented as transition graphs. We use polynomial commitments to convince the verifier that the public proof certificates correspond to the secret transition relation. Our symbolic scheme assumes systems specified as linear guarded commands. We apply Farkas' lemma to obtain a witness for the validity of the ranking function and employ sigma protocols with folding to efficiently convince the verifier of the witness's existence. We built a prototype to demonstrate the practical efficacy of our two schemes on linear temporal logic verification examples. Our technology enables formal verification in domains where both the safety and the confidentiality of the system under analysis are critical.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。