{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OPYS7L4CG72SCWBCJQO5BVSWQ5","short_pith_number":"pith:OPYS7L4C","canonical_record":{"source":{"id":"1502.00172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-31T22:10:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ff95a70ef5fcfb8722203e954178735e4946f0ba377363e133cab097886c8d83","abstract_canon_sha256":"5d0384919a8a9a4419b6e9be01f72a85958ba83b58530cc3a08f1584df415039"},"schema_version":"1.0"},"canonical_sha256":"73f12faf8237f52158224c1dd0d656877f12c2107e068c8df161b5bb7da12732","source":{"kind":"arxiv","id":"1502.00172","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00172","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00172v3","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00172","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"OPYS7L4CG72S","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPYS7L4CG72SCWBC","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPYS7L4C","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OPYS7L4CG72SCWBCJQO5BVSWQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-31T22:10:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ff95a70ef5fcfb8722203e954178735e4946f0ba377363e133cab097886c8d83","abstract_canon_sha256":"5d0384919a8a9a4419b6e9be01f72a85958ba83b58530cc3a08f1584df415039"},"schema_version":"1.0"},"canonical_sha256":"73f12faf8237f52158224c1dd0d656877f12c2107e068c8df161b5bb7da12732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:37.638685Z","signature_b64":"q34MYdOvJcUBDFCC7Viw2B5Q0aiqofaTmLo4Tmz4MbpoV7m3UhB0nWKyEY7bCkBaiuTeA21dTJol9Zj6IosrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73f12faf8237f52158224c1dd0d656877f12c2107e068c8df161b5bb7da12732","last_reissued_at":"2026-05-18T00:03:37.638029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:37.638029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00172","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdUhAyM4trOvcyS21SrytLT4YJOzkZQc98hEaru/jrJTVR5catZN1uDZHvaCNb73HRQNahcZvR1oPqU30fpJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:52:03.212647Z"},"content_sha256":"14d12cbabafaed21f1d74dd0d8e399a4206787746c8153373dd93ebb635dcdf6","schema_version":"1.0","event_id":"sha256:14d12cbabafaed21f1d74dd0d8e399a4206787746c8153373dd93ebb635dcdf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OPYS7L4CG72SCWBCJQO5BVSWQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leakage-resilient Cryptography with key derived from sensitive data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Konrad Durnoga, Maciej Zdanowicz, Micha{\\l} Zaj\\k{a}c, Tomasz Kazana","submitted_at":"2015-01-31T22:10:50Z","abstract_excerpt":"In this paper we address the problem of large space consumption for protocols in the Bounded Retrieval Model (BRM), which require users to store large secret keys subject to adversarial leakage. We propose a method to derive keys for such protocols on-the-fly from weakly random private data (like text documents or photos, users keep on their disks anyway for non-cryptographic purposes) in such a way that no extra storage is needed. We prove that any leakage-resilient protocol (belonging to a certain, arguably quite broad class) when run with a key obtained this way retains a similar level of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00172","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHnkrSQNB3KBjbs6EHnpH8FIf9Qm8QtX5RGcHsc/+y/+cmw/nG4HmMSBAeCkCMIOMs0lxMneEfsi/KEDWHUqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:52:03.213494Z"},"content_sha256":"21911759e2ea93e9b4a2cc8340f56bb7557388c49c7bbd5601fb9daf26fe7e42","schema_version":"1.0","event_id":"sha256:21911759e2ea93e9b4a2cc8340f56bb7557388c49c7bbd5601fb9daf26fe7e42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/bundle.json","state_url":"https://pith.science/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T16:52:03Z","links":{"resolver":"https://pith.science/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5","bundle":"https://pith.science/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/bundle.json","state":"https://pith.science/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPYS7L4CG72SCWBCJQO5BVSWQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OPYS7L4CG72SCWBCJQO5BVSWQ5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5d0384919a8a9a4419b6e9be01f72a85958ba83b58530cc3a08f1584df415039","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-31T22:10:50Z","title_canon_sha256":"ff95a70ef5fcfb8722203e954178735e4946f0ba377363e133cab097886c8d83"},"schema_version":"1.0","source":{"id":"1502.00172","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00172","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00172v3","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00172","created_at":"2026-05-18T00:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"OPYS7L4CG72S","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPYS7L4CG72SCWBC","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPYS7L4C","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:21911759e2ea93e9b4a2cc8340f56bb7557388c49c7bbd5601fb9daf26fe7e42","target":"graph","created_at":"2026-05-18T00:03:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we address the problem of large space consumption for protocols in the Bounded Retrieval Model (BRM), which require users to store large secret keys subject to adversarial leakage. We propose a method to derive keys for such protocols on-the-fly from weakly random private data (like text documents or photos, users keep on their disks anyway for non-cryptographic purposes) in such a way that no extra storage is needed. We prove that any leakage-resilient protocol (belonging to a certain, arguably quite broad class) when run with a key obtained this way retains a similar level of s","authors_text":"Konrad Durnoga, Maciej Zdanowicz, Micha{\\l} Zaj\\k{a}c, Tomasz Kazana","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-31T22:10:50Z","title":"Leakage-resilient Cryptography with key derived from sensitive data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00172","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:14d12cbabafaed21f1d74dd0d8e399a4206787746c8153373dd93ebb635dcdf6","target":"record","created_at":"2026-05-18T00:03:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5d0384919a8a9a4419b6e9be01f72a85958ba83b58530cc3a08f1584df415039","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-01-31T22:10:50Z","title_canon_sha256":"ff95a70ef5fcfb8722203e954178735e4946f0ba377363e133cab097886c8d83"},"schema_version":"1.0","source":{"id":"1502.00172","kind":"arxiv","version":3}},"canonical_sha256":"73f12faf8237f52158224c1dd0d656877f12c2107e068c8df161b5bb7da12732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73f12faf8237f52158224c1dd0d656877f12c2107e068c8df161b5bb7da12732","first_computed_at":"2026-05-18T00:03:37.638029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:37.638029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q34MYdOvJcUBDFCC7Viw2B5Q0aiqofaTmLo4Tmz4MbpoV7m3UhB0nWKyEY7bCkBaiuTeA21dTJol9Zj6IosrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:37.638685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00172","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14d12cbabafaed21f1d74dd0d8e399a4206787746c8153373dd93ebb635dcdf6","sha256:21911759e2ea93e9b4a2cc8340f56bb7557388c49c7bbd5601fb9daf26fe7e42"],"state_sha256":"bc170b4ee61aa7dc331fd32ac8e4915330fb0c4013c0b777996eef9f28432923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZZS9ROAmcteQpn9gBcweE2k2N/SgDA/LfjGjfVIs9/DpPcGMT2c6qsO/loTq2yC/9zhIIqpujJ0/974JV7fAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:52:03.217172Z","bundle_sha256":"262fd001c198279d96314f34383414bf8f5e21d1ce9eefad84278da28337dc6f"}}