Certifying Zero-Knowledge Circuits with Refinement Types. (arXiv:2304.07648v2 [cs.CR] UPDATED)

Zero-knowledge (ZK) proof systems have emerged as a promising solution for
building security-sensitive applications. However, bugs in ZK applications are
extremely difficult to detect and can allow a malicious party to silently
exploit the system without leaving any observable trace. This paper presents
Coda, a novel statically-typed language for building zero-knowledge
applications. Critically, Coda makes it possible to formally specify and
statically check properties of a ZK application through a rich refinement type
system. One of the key challenges in …

application applications bugs challenges check detect exploit key key challenges knowledge language malicious novel observable party reasoning security solution system systems the key trace types