A distributed statistical zero-knowledge Sumcheck protocol is constructed and applied to non-k-colorability and subgraph counting with O(n) and O(k log n) rounds respectively.
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Statistical Zero-Knowledge Proofs via Sumcheck
A distributed statistical zero-knowledge Sumcheck protocol is constructed and applied to non-k-colorability and subgraph counting with O(n) and O(k log n) rounds respectively.