{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HGZHDJCKDXXHWOEXXSN2M6JSUK","short_pith_number":"pith:HGZHDJCK","schema_version":"1.0","canonical_sha256":"39b271a44a1dee7b3897bc9ba67932a2a49581b99c64546d29bb791d826bbdf9","source":{"kind":"arxiv","id":"2107.11839","version":2},"attestation_state":"computed","paper":{"title":"Differential Privacy in the Shuffle Model: A Survey of Separations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Albert Cheu","submitted_at":"2021-07-25T16:40:21Z","abstract_excerpt":"Differential privacy is often studied in one of two models. In the central model, a single analyzer has the responsibility of performing a privacy-preserving computation on data. But in the local model, each data owner ensures their own privacy. Although it removes the need to trust the analyzer, local privacy comes at a price: a locally private protocol is less accurate than a centrally private counterpart when solving many learning and estimation problems. Protocols in the shuffle model are designed to attain the best of both worlds: recent work has shown high accuracy is possible with only "},"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":"2107.11839","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CR","submitted_at":"2021-07-25T16:40:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b4293289ac9f2656f79d45cea923a902ba09dbb91f6d62a0c7b3b3465089300d","abstract_canon_sha256":"807ae706b79c1f6065bcf787eeca814357922a29da88046bd6ec7715b0dd3f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:19.731299Z","signature_b64":"8ADAeiNCCwYrhnj0F9Q3JUePhVblnIRvYwiilE+rhB255fTxpf3Vh7oC37+ZEky+/BXw907d+sTKPWSGpS5aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39b271a44a1dee7b3897bc9ba67932a2a49581b99c64546d29bb791d826bbdf9","last_reissued_at":"2026-07-05T04:26:19.730867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:19.730867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differential Privacy in the Shuffle Model: A Survey of Separations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Albert Cheu","submitted_at":"2021-07-25T16:40:21Z","abstract_excerpt":"Differential privacy is often studied in one of two models. In the central model, a single analyzer has the responsibility of performing a privacy-preserving computation on data. But in the local model, each data owner ensures their own privacy. Although it removes the need to trust the analyzer, local privacy comes at a price: a locally private protocol is less accurate than a centrally private counterpart when solving many learning and estimation problems. Protocols in the shuffle model are designed to attain the best of both worlds: recent work has shown high accuracy is possible with only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11839","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/2107.11839/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":"2107.11839","created_at":"2026-07-05T04:26:19.730925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.11839v2","created_at":"2026-07-05T04:26:19.730925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11839","created_at":"2026-07-05T04:26:19.730925+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGZHDJCKDXXH","created_at":"2026-07-05T04:26:19.730925+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGZHDJCKDXXHWOEX","created_at":"2026-07-05T04:26:19.730925+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGZHDJCK","created_at":"2026-07-05T04:26:19.730925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21524","citing_title":"Prophet Inequalities under Local Differential Privacy","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13563","citing_title":"Differentially Private Hierarchical Heavy Hitters","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02563","citing_title":"IntraShuffler: A Privacy Preserving Framework for Heterogeneous DP Federated Learning","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2406.06408","citing_title":"Differentially Private Best-Arm Identification","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09054","citing_title":"Personalized w-Event Privacy for Infinite Stream Estimation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04901","citing_title":"On the (In-)Security of the Shuffling Defense in the Transformer Secure Inference","ref_index":179,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK","json":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK.json","graph_json":"https://pith.science/api/pith-number/HGZHDJCKDXXHWOEXXSN2M6JSUK/graph.json","events_json":"https://pith.science/api/pith-number/HGZHDJCKDXXHWOEXXSN2M6JSUK/events.json","paper":"https://pith.science/paper/HGZHDJCK"},"agent_actions":{"view_html":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK","download_json":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK.json","view_paper":"https://pith.science/paper/HGZHDJCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.11839&json=true","fetch_graph":"https://pith.science/api/pith-number/HGZHDJCKDXXHWOEXXSN2M6JSUK/graph.json","fetch_events":"https://pith.science/api/pith-number/HGZHDJCKDXXHWOEXXSN2M6JSUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK/action/storage_attestation","attest_author":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK/action/author_attestation","sign_citation":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK/action/citation_signature","submit_replication":"https://pith.science/pith/HGZHDJCKDXXHWOEXXSN2M6JSUK/action/replication_record"}},"created_at":"2026-07-05T04:26:19.730925+00:00","updated_at":"2026-07-05T04:26:19.730925+00:00"}