We apply the ZKMB paradigm to several case studies. Experimental results suggest that in certain settings, performance is in striking distance of practicality; an example is a middlebox that filters domain queries (each query requiring a separate proof) when the client has a long-lived TLS connection with a DNS resolver. In such configurations, the middlebox's overhead is 2–5 ms of running time per proof, and client latency to create a proof is several seconds. On the other hand, clients ma...| www.usenix.org
Most recent| Chainlink Blog
This post introduces commit-and-prove zero-knowledge proofs (ZKPs), which can be used to recycle memory as the ZK protocol proceeds.| Chainlink Blog
In this post, the Chainlink Labs Research team discusses how to hide the individual lengths of sensitive data from the verifier.| Chainlink Blog
This post discusses how to efficiently parse the TLS response and form claims about it while preserving the privacy of sensitive data within the response.| Chainlink Blog
Introducing a blog series outlining the research taking DECO, a privacy-preserving oracle protocol, from idea to implementation.| Chainlink Blog
DECO Research Series #2: Provenance and Authenticity | Chainlink Blog
Zero-knowledge proofs (ZKPs) are a cryptographic method used to prove knowledge about a piece of data, without revealing the data itself.| chain.link