2022 IEEE International Conference on Blockchain (Blockchain) 2022
DOI: 10.1109/blockchain55522.2022.00034
|View full text |Cite
|
Sign up to set email alerts
|

Advancing Blockchain-based Federated Learning through Verifiable Off-chain Computations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…To increase the usability and have a trustless distributed aggregation process, multiple works such as [31], [33], [17], and [44] use smart contracts. Since functions in a smart contract run automatically and publicly, using them for aggregation removes the need for trusting a server and verifying the aggregation process.…”
Section: B Aggregation Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…To increase the usability and have a trustless distributed aggregation process, multiple works such as [31], [33], [17], and [44] use smart contracts. Since functions in a smart contract run automatically and publicly, using them for aggregation removes the need for trusting a server and verifying the aggregation process.…”
Section: B Aggregation Methodsmentioning
confidence: 99%
“…Heiss et al In [17] present a design where all data owners' model computations are verified with zkSNARK. The clients compute a model locally and send their gradients to the smart contract for verification and aggregation.…”
Section: A Comparison Of Federify With the State Of The Artmentioning
confidence: 99%
“…Both references [89][90][91] used zero-knowledge proof methods to ensure that the submitted gradient values are from the real dataset, reference [90] used zero-knowledge proof techniques to construct a zk-Trainer to output gradient values as well as proofs simultaneously; reference [91] mentioned many computational details on this basis, including how to efficiently compute matrix operations in the gradient solution process, how to introduce auxiliary variables to simplify the computational process, and how to trade-off computational accuracy with computational complexity. Both solutions mention the problem that needs to be solved when applying zk-SNARK to BCFL.…”
Section: Figure 8: Zero-knowledge Proof Of Knowledge In Flmentioning
confidence: 99%
“…As proposed in [22,23], the schemes integrate the ZKPs and blockchain to construct the verifiable DFL framework, where the verification for updates is viewed as part of the consensus process, and miners are responsible for the verification before recording the updates into the blocks. In [24], ZKP-based verification is executed by smart contracts. However, these schemes use the blockchain as the black box or the third-party platform.…”
Section: Global Model Aggregatormentioning
confidence: 99%
“…, c s ) from multiple epochs can also be aggregated into the final ZKP proof π. The FP process can be proved via Groth 16 as described in [19,20,24], which is not the concern of this paper. To prove the validity of the training result, the BP process must be proposed, which is the process of chain rules as shown in Section 2.1.…”
Section: Zkp Proof Generation For the Local Training Processmentioning
confidence: 99%