zkDaily - 2026-04-25

零知识证明 zkDaily

ZKP Frontier Tracker 🎯

Sat

04.25

2026

Secret-Carrying Puzzles and Garbled Circuits Optimized for Zero-knowledge Proofs

Paper

https://eprint.iacr.org/2026/788

Debasish Ray Chawdhuri Garbled Circuits

Chawdhuri and Prabhakaran introduce OxSP and a proof-friendly Garbled Circuit construction in , reducing the cost of proving correct garbling by nearly two-thirds.

Notes

OxSP enables public puzzle posting and solution verification with hidden content.
Building OxSP on GC requires ZK proofs, but existing combinations are costly.
New GC construction reduces cost of correct garbling proof by nearly two-thirds without non-standard assumptions.
The proof-friendly GC is independently useful for auditable secure 2PC.
Experiments show significant improvement in proving overhead.
OxSP potential applications include verifiable computing and private auctions.

Collected by @icerdesign

零知识证明 zkDaily

Q&A Deep Dive 💬

Sat

04.25

2026

What is a Secret-Carrying Puzzle?

A Secret-Carrying Puzzle lets a publisher pose a puzzle publicly while solvers return answers that contain hidden information. Verifiers can check correctness without seeing the hidden parts.

Why do OxSPs use Garbled Circuits?

Garbled Circuits enable computation on hidden inputs. OxSP uses GCs to encode puzzle logic so that solving happens on encrypted data while still allowing verifiable outputs.

What does the proof-friendly GC improve?

The design restructures GCs to be more compatible with ZK circuits, reducing constraint count and lowering the cost of proving correct garbling to about one-third, without new assumptions.

Prompted by @icerdesign