{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NLOSIINX3GRJUCX5R73ZF4RQC7","short_pith_number":"pith:NLOSIINX","schema_version":"1.0","canonical_sha256":"6add2421b7d9a29a0afd8ff792f23017f865d7e11f9c467a26c01d2f879d94ab","source":{"kind":"arxiv","id":"1909.11225","version":1},"attestation_state":"computed","paper":{"title":"Improved Summation from Shuffling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adria Gascon, Borja Balle, James Bell, Kobbi Nissim","submitted_at":"2019-09-24T23:28:19Z","abstract_excerpt":"A protocol by Ishai et al.\\ (FOCS 2006) showing how to implement distributed $n$-party summation from secure shuffling has regained relevance in the context of the recently proposed \\emph{shuffle model} of differential privacy, as it allows to attain the accuracy levels of the curator model at a moderate communication cost. To achieve statistical security $2^{-\\sigma}$, the protocol by Ishai et al.\\ requires the number of messages sent by each party to {\\em grow} logarithmically with $n$ as $O(\\log n + \\sigma)$. In this note we give an improved analysis achieving a dependency of the form $O(1+"},"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":"1909.11225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-09-24T23:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"b3a1dcfa9d7269f4a9cc82cbaf76a391f2885185169c2d87668cc21c086d0761","abstract_canon_sha256":"6de5b60b9246a923061cc86e4519141ed4f4216a18e9cff6cb8a75d5028cf482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:09.542853Z","signature_b64":"DgrrPitpDH0wvHVCC0HuwRAhK4z6Zandf9v3DZr1u9Pkulj5be92FO+2DQl4k6vFNoSSQjSja7aSBZ7DoqsWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6add2421b7d9a29a0afd8ff792f23017f865d7e11f9c467a26c01d2f879d94ab","last_reissued_at":"2026-07-05T00:07:09.542484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:09.542484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Summation from Shuffling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adria Gascon, Borja Balle, James Bell, Kobbi Nissim","submitted_at":"2019-09-24T23:28:19Z","abstract_excerpt":"A protocol by Ishai et al.\\ (FOCS 2006) showing how to implement distributed $n$-party summation from secure shuffling has regained relevance in the context of the recently proposed \\emph{shuffle model} of differential privacy, as it allows to attain the accuracy levels of the curator model at a moderate communication cost. To achieve statistical security $2^{-\\sigma}$, the protocol by Ishai et al.\\ requires the number of messages sent by each party to {\\em grow} logarithmically with $n$ as $O(\\log n + \\sigma)$. In this note we give an improved analysis achieving a dependency of the form $O(1+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11225","kind":"arxiv","version":1},"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/1909.11225/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":"1909.11225","created_at":"2026-07-05T00:07:09.542538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11225v1","created_at":"2026-07-05T00:07:09.542538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11225","created_at":"2026-07-05T00:07:09.542538+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLOSIINX3GRJ","created_at":"2026-07-05T00:07:09.542538+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLOSIINX3GRJUCX5","created_at":"2026-07-05T00:07:09.542538+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLOSIINX","created_at":"2026-07-05T00:07:09.542538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11358","citing_title":"On the Power of Multiple Anonymous Messages","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7","json":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7.json","graph_json":"https://pith.science/api/pith-number/NLOSIINX3GRJUCX5R73ZF4RQC7/graph.json","events_json":"https://pith.science/api/pith-number/NLOSIINX3GRJUCX5R73ZF4RQC7/events.json","paper":"https://pith.science/paper/NLOSIINX"},"agent_actions":{"view_html":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7","download_json":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7.json","view_paper":"https://pith.science/paper/NLOSIINX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11225&json=true","fetch_graph":"https://pith.science/api/pith-number/NLOSIINX3GRJUCX5R73ZF4RQC7/graph.json","fetch_events":"https://pith.science/api/pith-number/NLOSIINX3GRJUCX5R73ZF4RQC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7/action/storage_attestation","attest_author":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7/action/author_attestation","sign_citation":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7/action/citation_signature","submit_replication":"https://pith.science/pith/NLOSIINX3GRJUCX5R73ZF4RQC7/action/replication_record"}},"created_at":"2026-07-05T00:07:09.542538+00:00","updated_at":"2026-07-05T00:07:09.542538+00:00"}