{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6RPIYHTAORUWKLHOUU346VE2RS","short_pith_number":"pith:6RPIYHTA","schema_version":"1.0","canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","source":{"kind":"arxiv","id":"1107.5419","version":3},"attestation_state":"computed","paper":{"title":"Scalable and Secure Aggregation in Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Florian Huc, Hamza Harkous, Rachid Guerraoui, Sebastien Gambs","submitted_at":"2011-07-27T09:09:38Z","abstract_excerpt":"We consider the problem of computing an aggregation function in a \\emph{secure} and \\emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\\epsilon)n$ malicious nodes for any constant $1/2 > \\epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high"},"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":"1107.5419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"d70a9de58579c29d4a9983b0208bcc06228bbba57a5269a855780f9a1f236774","abstract_canon_sha256":"3552afe5fbfa698b086fae76fb2a325fe83fdd3063da84aacdd102eb75a22b1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.479896Z","signature_b64":"4duI2rpLlJIWZnW2cKnZn/LuSlLjWhvmgdRDQE9M2Uae6oapXakLAPGYwF7DT8tQ+7PpyqNxpNnCdOuBX/zTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","last_reissued_at":"2026-05-18T04:07:52.479329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.479329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable and Secure Aggregation in Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Florian Huc, Hamza Harkous, Rachid Guerraoui, Sebastien Gambs","submitted_at":"2011-07-27T09:09:38Z","abstract_excerpt":"We consider the problem of computing an aggregation function in a \\emph{secure} and \\emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\\epsilon)n$ malicious nodes for any constant $1/2 > \\epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5419","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1107.5419","created_at":"2026-05-18T04:07:52.479407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5419v3","created_at":"2026-05-18T04:07:52.479407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5419","created_at":"2026-05-18T04:07:52.479407+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RPIYHTAORUW","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RPIYHTAORUWKLHO","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RPIYHTA","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS","json":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS.json","graph_json":"https://pith.science/api/pith-number/6RPIYHTAORUWKLHOUU346VE2RS/graph.json","events_json":"https://pith.science/api/pith-number/6RPIYHTAORUWKLHOUU346VE2RS/events.json","paper":"https://pith.science/paper/6RPIYHTA"},"agent_actions":{"view_html":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS","download_json":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS.json","view_paper":"https://pith.science/paper/6RPIYHTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5419&json=true","fetch_graph":"https://pith.science/api/pith-number/6RPIYHTAORUWKLHOUU346VE2RS/graph.json","fetch_events":"https://pith.science/api/pith-number/6RPIYHTAORUWKLHOUU346VE2RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/action/storage_attestation","attest_author":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/action/author_attestation","sign_citation":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/action/citation_signature","submit_replication":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/action/replication_record"}},"created_at":"2026-05-18T04:07:52.479407+00:00","updated_at":"2026-05-18T04:07:52.479407+00:00"}