pith. sign in

Eliminating label leakage in tree- based vertical federated learning

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

fields

cs.CR 2

years

2026 2

clear filters

representative citing papers

Practical Anonymous Two-Party Gradient Boosting Decision Tree

cs.CR · 2026-05-26 · unverdicted · novelty 7.0

Introduces an anonymous two-party GBDT protocol using dual circuit-PSI and halved-cost ciphertext packing in homomorphic encryption to hide shared record IDs while claiming competitive efficiency.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Practical Anonymous Two-Party Gradient Boosting Decision Tree cs.CR · 2026-05-26 · unverdicted · none · ref 55

    Introduces an anonymous two-party GBDT protocol using dual circuit-PSI and halved-cost ciphertext packing in homomorphic encryption to hide shared record IDs while claiming competitive efficiency.