{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q7S7N5AEEDJRCZUAL5SJQHNPSP","short_pith_number":"pith:Q7S7N5AE","schema_version":"1.0","canonical_sha256":"87e5f6f40420d31166805f64981daf93c16076e4f2c77b59bde6c5bedba15d2d","source":{"kind":"arxiv","id":"2011.05315","version":2},"attestation_state":"computed","paper":{"title":"Is Private Learning Possible with Instance Encoding?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.CR","authors_text":"Abhradeep Thakurta, Florian Tramer, Mohammad Mahmoody, Nicholas Carlini, Saeed Mahloujifar, Samuel Deng, Sanjam Garg, Shuang Song, Somesh Jha","submitted_at":"2020-11-10T18:55:20Z","abstract_excerpt":"A private machine learning algorithm hides as much as possible about its training data while still preserving accuracy. In this work, we study whether a non-private learning algorithm can be made private by relying on an instance-encoding mechanism that modifies the training inputs before feeding them to a normal learner. We formalize both the notion of instance encoding and its privacy by providing two attack models. We first prove impossibility results for achieving a (stronger) model. Next, we demonstrate practical attacks in the second (weaker) attack model on InstaHide, a recent proposal "},"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":"2011.05315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-11-10T18:55:20Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"df57dfc68dc109543e1dc0b91569fcddccfca117496ff14028e46276e7ac0a55","abstract_canon_sha256":"d359e403244abb87bc222bc5bdd0e0199d2a90c5f0c329509c220b577917f8ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:51.856776Z","signature_b64":"LVJvhr+jfYn1njqb+ETbO2dSJeHz5kN3LjhSaoVcMnxx//KaRnZjkrpSQn0hmSS0b0Tl+7GhzS3NZuPZxm4SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e5f6f40420d31166805f64981daf93c16076e4f2c77b59bde6c5bedba15d2d","last_reissued_at":"2026-07-05T02:35:51.856197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:51.856197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is Private Learning Possible with Instance Encoding?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.CR","authors_text":"Abhradeep Thakurta, Florian Tramer, Mohammad Mahmoody, Nicholas Carlini, Saeed Mahloujifar, Samuel Deng, Sanjam Garg, Shuang Song, Somesh Jha","submitted_at":"2020-11-10T18:55:20Z","abstract_excerpt":"A private machine learning algorithm hides as much as possible about its training data while still preserving accuracy. In this work, we study whether a non-private learning algorithm can be made private by relying on an instance-encoding mechanism that modifies the training inputs before feeding them to a normal learner. We formalize both the notion of instance encoding and its privacy by providing two attack models. We first prove impossibility results for achieving a (stronger) model. Next, we demonstrate practical attacks in the second (weaker) attack model on InstaHide, a recent proposal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05315","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/2011.05315/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":"2011.05315","created_at":"2026-07-05T02:35:51.856265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.05315v2","created_at":"2026-07-05T02:35:51.856265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05315","created_at":"2026-07-05T02:35:51.856265+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7S7N5AEEDJR","created_at":"2026-07-05T02:35:51.856265+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7S7N5AEEDJRCZUA","created_at":"2026-07-05T02:35:51.856265+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7S7N5AE","created_at":"2026-07-05T02:35:51.856265+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/Q7S7N5AEEDJRCZUAL5SJQHNPSP","json":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP.json","graph_json":"https://pith.science/api/pith-number/Q7S7N5AEEDJRCZUAL5SJQHNPSP/graph.json","events_json":"https://pith.science/api/pith-number/Q7S7N5AEEDJRCZUAL5SJQHNPSP/events.json","paper":"https://pith.science/paper/Q7S7N5AE"},"agent_actions":{"view_html":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP","download_json":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP.json","view_paper":"https://pith.science/paper/Q7S7N5AE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.05315&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7S7N5AEEDJRCZUAL5SJQHNPSP/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7S7N5AEEDJRCZUAL5SJQHNPSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP/action/storage_attestation","attest_author":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP/action/author_attestation","sign_citation":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP/action/citation_signature","submit_replication":"https://pith.science/pith/Q7S7N5AEEDJRCZUAL5SJQHNPSP/action/replication_record"}},"created_at":"2026-07-05T02:35:51.856265+00:00","updated_at":"2026-07-05T02:35:51.856265+00:00"}