{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XHWANOEYWSOMK47Q2AUI57ZWJK","short_pith_number":"pith:XHWANOEY","schema_version":"1.0","canonical_sha256":"b9ec06b898b49cc573f0d0288eff364ab9891af317e53cfc95651cef9a004b6d","source":{"kind":"arxiv","id":"1601.06562","version":2},"attestation_state":"computed","paper":{"title":"Secure Computation of Randomized Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Deepesh Data","submitted_at":"2016-01-25T11:30:19Z","abstract_excerpt":"Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; and computation is such that no user learns any additional information about the other user's input and output other than what cannot be inferred from its own input and output. First we consider a scenario, where privacy conditions are against both the users. In perfect security setting Kilian [STOC 2000] gave a characterization of securely computable randomized functions, and we provide rate-optimal protocols for such functions. We prove that the same cha"},"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":"1601.06562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-25T11:30:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7181ed0dda9479cd3f697620aca5d8d89936a917d8930d90dfa8d9ed1a2e71aa","abstract_canon_sha256":"231c9236f7164aebb033fd7705ea90c8056b8a0dbcaa3191bde9f98b450c3722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.315438Z","signature_b64":"eXAg0WM+mOznpU2Q8dAP331yuCPrDFH6EcEaznqRFDRWaa6dr5qMKC3Pl7pAMq/vdJuEJkiKT1M+3caSSaSpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ec06b898b49cc573f0d0288eff364ab9891af317e53cfc95651cef9a004b6d","last_reissued_at":"2026-05-18T00:58:57.314695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.314695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Computation of Randomized Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Deepesh Data","submitted_at":"2016-01-25T11:30:19Z","abstract_excerpt":"Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; and computation is such that no user learns any additional information about the other user's input and output other than what cannot be inferred from its own input and output. First we consider a scenario, where privacy conditions are against both the users. In perfect security setting Kilian [STOC 2000] gave a characterization of securely computable randomized functions, and we provide rate-optimal protocols for such functions. We prove that the same cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06562","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":""},"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":"1601.06562","created_at":"2026-05-18T00:58:57.314825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06562v2","created_at":"2026-05-18T00:58:57.314825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06562","created_at":"2026-05-18T00:58:57.314825+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHWANOEYWSOM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHWANOEYWSOMK47Q","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHWANOEY","created_at":"2026-05-18T12:30:51.357362+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/XHWANOEYWSOMK47Q2AUI57ZWJK","json":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK.json","graph_json":"https://pith.science/api/pith-number/XHWANOEYWSOMK47Q2AUI57ZWJK/graph.json","events_json":"https://pith.science/api/pith-number/XHWANOEYWSOMK47Q2AUI57ZWJK/events.json","paper":"https://pith.science/paper/XHWANOEY"},"agent_actions":{"view_html":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK","download_json":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK.json","view_paper":"https://pith.science/paper/XHWANOEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06562&json=true","fetch_graph":"https://pith.science/api/pith-number/XHWANOEYWSOMK47Q2AUI57ZWJK/graph.json","fetch_events":"https://pith.science/api/pith-number/XHWANOEYWSOMK47Q2AUI57ZWJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK/action/storage_attestation","attest_author":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK/action/author_attestation","sign_citation":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK/action/citation_signature","submit_replication":"https://pith.science/pith/XHWANOEYWSOMK47Q2AUI57ZWJK/action/replication_record"}},"created_at":"2026-05-18T00:58:57.314825+00:00","updated_at":"2026-05-18T00:58:57.314825+00:00"}