{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TXQLCKY2GOUVONZ4ROWEY2VY5R","short_pith_number":"pith:TXQLCKY2","schema_version":"1.0","canonical_sha256":"9de0b12b1a33a957373c8bac4c6ab8ec60a327537a0d02b7722f3248ae02f02d","source":{"kind":"arxiv","id":"1909.11073","version":2},"attestation_state":"computed","paper":{"title":"Private Aggregation from Fewer Anonymous Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Ameya Velingker, Badih Ghazi, Pasin Manurangsi, Rasmus Pagh","submitted_at":"2019-09-24T17:52:14Z","abstract_excerpt":"Consider the setup where $n$ parties are each given a number $x_i \\in \\mathbb{F}_q$ and the goal is to compute the sum $\\sum_i x_i$ in a secure fashion and with as little communication as possible. We study this problem in the anonymized model of Ishai et al. (FOCS 2006) where each party may broadcast anonymous messages on an insecure channel.\n  We present a new analysis of the one-round \"split and mix\" protocol of Ishai et al. In order to achieve the same security parameter, our analysis reduces the required number of messages by a $\\Theta(\\log n)$ multiplicative factor. We complement our pos"},"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.11073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-09-24T17:52:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b4fafd6a83454e0cfce848391ac978037384a8ebffe26dc408ba42a85ccd19df","abstract_canon_sha256":"9e66868878c01f5cb7d39c8a74f130e89e42695190904449b8b837c8331385f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:12:29.705391Z","signature_b64":"GZEP5s5qkTe/wr/46faZrn7HRVy7S9UHF/KJ+ml3F6wAt/q+aKjSf5Y7rnXDimcQBCNhms7axBb7FzEeZ+WdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de0b12b1a33a957373c8bac4c6ab8ec60a327537a0d02b7722f3248ae02f02d","last_reissued_at":"2026-07-05T00:12:29.704891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:12:29.704891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Aggregation from Fewer Anonymous Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Ameya Velingker, Badih Ghazi, Pasin Manurangsi, Rasmus Pagh","submitted_at":"2019-09-24T17:52:14Z","abstract_excerpt":"Consider the setup where $n$ parties are each given a number $x_i \\in \\mathbb{F}_q$ and the goal is to compute the sum $\\sum_i x_i$ in a secure fashion and with as little communication as possible. We study this problem in the anonymized model of Ishai et al. (FOCS 2006) where each party may broadcast anonymous messages on an insecure channel.\n  We present a new analysis of the one-round \"split and mix\" protocol of Ishai et al. In order to achieve the same security parameter, our analysis reduces the required number of messages by a $\\Theta(\\log n)$ multiplicative factor. We complement our pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11073","kind":"arxiv","version":2},"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.11073/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.11073","created_at":"2026-07-05T00:12:29.704949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11073v2","created_at":"2026-07-05T00:12:29.704949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11073","created_at":"2026-07-05T00:12:29.704949+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXQLCKY2GOUV","created_at":"2026-07-05T00:12:29.704949+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXQLCKY2GOUVONZ4","created_at":"2026-07-05T00:12:29.704949+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXQLCKY2","created_at":"2026-07-05T00:12:29.704949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11515","citing_title":"Improving Utility and Security of the Shuffler-based Differential Privacy","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R","json":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R.json","graph_json":"https://pith.science/api/pith-number/TXQLCKY2GOUVONZ4ROWEY2VY5R/graph.json","events_json":"https://pith.science/api/pith-number/TXQLCKY2GOUVONZ4ROWEY2VY5R/events.json","paper":"https://pith.science/paper/TXQLCKY2"},"agent_actions":{"view_html":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R","download_json":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R.json","view_paper":"https://pith.science/paper/TXQLCKY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11073&json=true","fetch_graph":"https://pith.science/api/pith-number/TXQLCKY2GOUVONZ4ROWEY2VY5R/graph.json","fetch_events":"https://pith.science/api/pith-number/TXQLCKY2GOUVONZ4ROWEY2VY5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R/action/storage_attestation","attest_author":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R/action/author_attestation","sign_citation":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R/action/citation_signature","submit_replication":"https://pith.science/pith/TXQLCKY2GOUVONZ4ROWEY2VY5R/action/replication_record"}},"created_at":"2026-07-05T00:12:29.704949+00:00","updated_at":"2026-07-05T00:12:29.704949+00:00"}