{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4BTZ4DAAZ2RBYAO6DTS5FJMI2I","short_pith_number":"pith:4BTZ4DAA","schema_version":"1.0","canonical_sha256":"e0679e0c00cea21c01de1ce5d2a588d215cece3d2a933bdbefda39dca0a62667","source":{"kind":"arxiv","id":"2304.03841","version":6},"attestation_state":"computed","paper":{"title":"Efficient Secure Aggregation for Privacy-Preserving Federated Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arman Riasi, Balaji Padmanabhan, Reza Ebrahimi, Rouzbeh Behnia, Sherman S. M. Chow, Thang Hoang","submitted_at":"2023-04-07T20:44:06Z","abstract_excerpt":"Secure aggregation protocols ensure the privacy of users' data in federated learning by preventing the disclosure of local gradients. Many existing protocols impose significant communication and computational burdens on participants and may not efficiently handle the large update vectors typical of machine learning models. Correspondingly, we present e-SeaFL, an efficient verifiable secure aggregation protocol taking only one communication round during the aggregation phase. e-SeaFL allows the aggregation server to generate proof of honest aggregation to participants via authenticated homomorp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.03841","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-04-07T20:44:06Z","cross_cats_sorted":[],"title_canon_sha256":"d53198305e97d14fd000d8924a4a447a0349582f193682bf33603a11e3507e2c","abstract_canon_sha256":"97c47b4d911a27f9d427ffb2eb2c7a24a5e68762f258a95aa557e95eb39db220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:07.243293Z","signature_b64":"VgMXb3amkmbRg8o2lYM1RxmQW+1rxSgW0Xq3wQm2vKe0IjxudYIX9uszKAY8CrxDgRABfmh7tfwA1s3nVwy9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0679e0c00cea21c01de1ce5d2a588d215cece3d2a933bdbefda39dca0a62667","last_reissued_at":"2026-07-05T09:33:07.242818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:07.242818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Secure Aggregation for Privacy-Preserving Federated Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arman Riasi, Balaji Padmanabhan, Reza Ebrahimi, Rouzbeh Behnia, Sherman S. M. Chow, Thang Hoang","submitted_at":"2023-04-07T20:44:06Z","abstract_excerpt":"Secure aggregation protocols ensure the privacy of users' data in federated learning by preventing the disclosure of local gradients. Many existing protocols impose significant communication and computational burdens on participants and may not efficiently handle the large update vectors typical of machine learning models. Correspondingly, we present e-SeaFL, an efficient verifiable secure aggregation protocol taking only one communication round during the aggregation phase. e-SeaFL allows the aggregation server to generate proof of honest aggregation to participants via authenticated homomorp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03841","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03841/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.03841","created_at":"2026-07-05T09:33:07.242876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03841v6","created_at":"2026-07-05T09:33:07.242876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03841","created_at":"2026-07-05T09:33:07.242876+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BTZ4DAAZ2RB","created_at":"2026-07-05T09:33:07.242876+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BTZ4DAAZ2RBYAO6","created_at":"2026-07-05T09:33:07.242876+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BTZ4DAA","created_at":"2026-07-05T09:33:07.242876+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05751","citing_title":"Efficient Full-Stack Private Federated Deep Learning with Post-Quantum Security","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I","json":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I.json","graph_json":"https://pith.science/api/pith-number/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/graph.json","events_json":"https://pith.science/api/pith-number/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/events.json","paper":"https://pith.science/paper/4BTZ4DAA"},"agent_actions":{"view_html":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I","download_json":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I.json","view_paper":"https://pith.science/paper/4BTZ4DAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03841&json=true","fetch_graph":"https://pith.science/api/pith-number/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/graph.json","fetch_events":"https://pith.science/api/pith-number/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/action/storage_attestation","attest_author":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/action/author_attestation","sign_citation":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/action/citation_signature","submit_replication":"https://pith.science/pith/4BTZ4DAAZ2RBYAO6DTS5FJMI2I/action/replication_record"}},"created_at":"2026-07-05T09:33:07.242876+00:00","updated_at":"2026-07-05T09:33:07.242876+00:00"}