Pith. sign in

REVIEW 4 cited by

Zero-Knowledge Proof-based Verifiable Decentralized Machine Learning in Communication Network: A Comprehensive Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.14848 v2 pith:ZERVKBKS submitted 2023-10-23 cs.LG cs.CR

classification cs.LGcs.CR
keywords learningmachineresearchdecentralizedsurveyzkp-vmlanalysiscomprehensive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Over recent decades, machine learning has significantly advanced network communication, enabling improved decision-making, user behavior analysis, and fault detection. Decentralized approaches, where participants exchange computation results instead of raw private data, mitigate these risks but introduce challenges related to trust and verifiability. A critical issue arises: How can one ensure the integrity and validity of computation results shared by other participants? Existing survey articles predominantly address security and privacy concerns in decentralized machine learning, whereas this survey uniquely highlights the emerging issue of verifiability. Recognizing the critical role of zero-knowledge proofs in ensuring verifiability, we present a comprehensive review of Zero-Knowledge Proof-based Verifiable Machine Learning (ZKP-VML). To clarify the research problem, we present a definition of ZKP-VML consisting of four algorithms, along with several corresponding key security properties. Besides, we provide an overview of the current research landscape by systematically organizing the research timeline and categorizing existing schemes based on their security properties. Furthermore, through an in-depth analysis of each existing scheme, we summarize their technical contributions and optimization strategies, aiming to uncover common design principles underlying ZKP-VML schemes. Building on the reviews and analysis presented, we identify current research challenges and suggest future research directions. To the best of our knowledge, this is the most comprehensive survey to date on verifiable decentralized machine learning and ZKP-VML.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust and Secure Code Watermarking for Large Language Models via ML/Crypto Codesign

    cs.CR 2025-02 reject novelty 6.0 of 10

    RoSeMary embeds recoverable signatures in LLM-generated code and uses zero-knowledge proofs to verify ownership without revealing the signature.

  2. NiyamAI - An Intent-Bound AI Agent with Cryptographically Verifiable Guardrails using Zero-Knowledge Proofs

    cs.AI 2026-08 reject novelty 5.0 of 10

    Niyam-AI binds agent permissions with SHA-256 and adds zk-SNARK proofs for a small Judge model's safety decisions, reporting F1 88.5% on Agent-SafetyBench, though the classifier is benchmark-adapted and the proof appl...

  3. Game of Coding under Computation-Dependent Adversarial Noise

    cs.IT 2026-07 accept novelty 4.0 of 10

    An adversary that adapts its noise to the realized computation gains nothing: averaging its conditional noise distributions yields an input-independent strategy with identical acceptance probability and mean-squared error.

  4. Engineering Trustworthy Machine-Learning Operations with Zero-Knowledge Proofs

    cs.SE 2025-05 conditional novelty 4.0 of 10

    A systematic review of 57 ZKP-for-ML papers concludes that inference verification dominates the field and that research is converging toward a unified ZKMLOps framework for trustworthy, auditable AI.

Pith tools