{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EKT6SEYSYYLOCSI7ITLNMRA7YA","short_pith_number":"pith:EKT6SEYS","schema_version":"1.0","canonical_sha256":"22a7e91312c616e1491f44d6d6441fc00e40fd290354aa272af398c34ad4ff2a","source":{"kind":"arxiv","id":"2307.13474","version":1},"attestation_state":"computed","paper":{"title":"Secure Aggregation with an Oblivious Server","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun","submitted_at":"2023-07-25T13:08:19Z","abstract_excerpt":"Secure aggregation usually aims at securely computing the sum of the inputs from $K$ users at a server. Noticing that the sum might inevitably reveal information about the inputs (when the inputs are non-uniform) and typically the users (not the server) desire the sum (in applications such as federated learning), we consider a variant of secure aggregation where the server is oblivious, i.e., the server only serves as a communication facilitator/helper to enable the users to securely compute the sum and learns nothing in the process. Our communication protocol involves one round of messages fr"},"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":"2307.13474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-25T13:08:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a1b648e3dd391f82ca83395e9e7ff5b755ec6c0cb38c63b3e83b9aad850697f","abstract_canon_sha256":"c14cefd30b1eb168898ea744d1a04f33146f1da325c2bb81c8781479d512e25d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:14.725635Z","signature_b64":"wxh2CJRTvHbqa71ntHnfdL5Ouh2oO1Fgu8f8dJOn2vWmy0ptvSfEIVbtH2V91pRbNfuVRHUWEUTj9x42WSQlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a7e91312c616e1491f44d6d6441fc00e40fd290354aa272af398c34ad4ff2a","last_reissued_at":"2026-07-05T06:34:14.725215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:14.725215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Aggregation with an Oblivious Server","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun","submitted_at":"2023-07-25T13:08:19Z","abstract_excerpt":"Secure aggregation usually aims at securely computing the sum of the inputs from $K$ users at a server. Noticing that the sum might inevitably reveal information about the inputs (when the inputs are non-uniform) and typically the users (not the server) desire the sum (in applications such as federated learning), we consider a variant of secure aggregation where the server is oblivious, i.e., the server only serves as a communication facilitator/helper to enable the users to securely compute the sum and learns nothing in the process. Our communication protocol involves one round of messages fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13474","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/2307.13474/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":"2307.13474","created_at":"2026-07-05T06:34:14.725269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13474v1","created_at":"2026-07-05T06:34:14.725269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13474","created_at":"2026-07-05T06:34:14.725269+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKT6SEYSYYLO","created_at":"2026-07-05T06:34:14.725269+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKT6SEYSYYLOCSI7","created_at":"2026-07-05T06:34:14.725269+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKT6SEYS","created_at":"2026-07-05T06:34:14.725269+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26391","citing_title":"Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01849","citing_title":"Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA","json":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA.json","graph_json":"https://pith.science/api/pith-number/EKT6SEYSYYLOCSI7ITLNMRA7YA/graph.json","events_json":"https://pith.science/api/pith-number/EKT6SEYSYYLOCSI7ITLNMRA7YA/events.json","paper":"https://pith.science/paper/EKT6SEYS"},"agent_actions":{"view_html":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA","download_json":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA.json","view_paper":"https://pith.science/paper/EKT6SEYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13474&json=true","fetch_graph":"https://pith.science/api/pith-number/EKT6SEYSYYLOCSI7ITLNMRA7YA/graph.json","fetch_events":"https://pith.science/api/pith-number/EKT6SEYSYYLOCSI7ITLNMRA7YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA/action/storage_attestation","attest_author":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA/action/author_attestation","sign_citation":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA/action/citation_signature","submit_replication":"https://pith.science/pith/EKT6SEYSYYLOCSI7ITLNMRA7YA/action/replication_record"}},"created_at":"2026-07-05T06:34:14.725269+00:00","updated_at":"2026-07-05T06:34:14.725269+00:00"}