In this post, the Chainlink Labs Research team discusses how to hide the individual lengths of sensitive data from the verifier.

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.

Andrew Lewis-Pye, Dahlia Malkhi, and Oded Naor expand the discussion of view synchronization and present a new protocol that quickly recovers in the case of a Byzantine leader.

Discover how the prover convinces the verifier that a TLS response is obtained from a particular server in Chainlink DECO.

Introducing a blog series outlining the research taking DECO, a privacy-preserving oracle protocol, from idea to implementation.

We describe an efficient single-point VOLE (SPVOLE) protocol where the prover’s message is an all-zero vector except at one location.

Understand an efficient protocol to generate VOLE correlations for batches of commitments.

How Chainlink DECO could help support crypto self-custody and key recovery in a privacy-preserving way.

This post describes the transition from VOLE to commitment in VOLE-based ZK protocols and outlines how to generate VOLE correlations in a higher degree.

Discover a commit-and-prove ZK proof system that can process tens of millions of gates per second and handle large circuits while requiring minimal memory.