{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UMV227BXPE4CCMXNEHJV5C2BJW","short_pith_number":"pith:UMV227BX","canonical_record":{"source":{"id":"1503.01382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-04T16:51:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f0714f608fa1bd79c0325b2cec372eae43cf39b7cc7f2a8c5dcf8245384450c5","abstract_canon_sha256":"6aba7ee51679113342e030ab5a5ebe8cf1c5eb732ae466d628b00dcd662a8ef7"},"schema_version":"1.0"},"canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","source":{"kind":"arxiv","id":"1503.01382","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01382","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01382v2","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01382","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"UMV227BXPE4C","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UMV227BXPE4CCMXN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UMV227BX","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UMV227BXPE4CCMXNEHJV5C2BJW","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-04T16:51:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f0714f608fa1bd79c0325b2cec372eae43cf39b7cc7f2a8c5dcf8245384450c5","abstract_canon_sha256":"6aba7ee51679113342e030ab5a5ebe8cf1c5eb732ae466d628b00dcd662a8ef7"},"schema_version":"1.0"},"canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:23.903420Z","signature_b64":"E2Ma377OyoA5IWy5N35NxDYtpmRMM3IsU7s/K9l41802/NAC6BIGBUBJwWWD778hEkbqn8u/cW106KrIBtdCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","last_reissued_at":"2026-05-18T02:17:23.902778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:23.902778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01382","source_version":2,"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-18T02:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1izp80tHanwHtA8LF76nVx40mByH8xfgUGZirLudcFQkFs7MDoEIHp3CEvtSPPzNWMBxAA0kwKJYD8oph2SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:46:52.469217Z"},"content_sha256":"e85865ce9c37a3e065bb85455660749f9f6c60c33e935741f0018197bd5f356c","schema_version":"1.0","event_id":"sha256:e85865ce9c37a3e065bb85455660749f9f6c60c33e935741f0018197bd5f356c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UMV227BXPE4CCMXNEHJV5C2BJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Gregory Gutin, Jason Crampton, Mark Jones, Naomi Farley","submitted_at":"2015-03-04T16:51:31Z","abstract_excerpt":"The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable decryption key from the secret and publicly available information. A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret. For a given information flow policy, there will be many different possible chain-based enforcement schemes. In this paper, we provide a polynomial-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01382","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"},"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-18T02:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9RlLcGjmBxWZq43XrW/hyl9iZpUYXdG+JzM3/yVm+VZMFmK6paoPxJklTajdJ9eMi00JbkRid0kTKO04mOOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:46:52.469951Z"},"content_sha256":"98d1878f7904840fcab4ef5a8daf8b2e70f985a874f59291ed11efd6d0c852bf","schema_version":"1.0","event_id":"sha256:98d1878f7904840fcab4ef5a8daf8b2e70f985a874f59291ed11efd6d0c852bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/bundle.json","state_url":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMV227BXPE4CCMXNEHJV5C2BJW/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-05-30T15:46:52Z","links":{"resolver":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW","bundle":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/bundle.json","state":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMV227BXPE4CCMXNEHJV5C2BJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UMV227BXPE4CCMXNEHJV5C2BJW","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":"6aba7ee51679113342e030ab5a5ebe8cf1c5eb732ae466d628b00dcd662a8ef7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-04T16:51:31Z","title_canon_sha256":"f0714f608fa1bd79c0325b2cec372eae43cf39b7cc7f2a8c5dcf8245384450c5"},"schema_version":"1.0","source":{"id":"1503.01382","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01382","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01382v2","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01382","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"UMV227BXPE4C","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UMV227BXPE4CCMXN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UMV227BX","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:98d1878f7904840fcab4ef5a8daf8b2e70f985a874f59291ed11efd6d0c852bf","target":"graph","created_at":"2026-05-18T02:17:23Z","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":"The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable decryption key from the secret and publicly available information. A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret. For a given information flow policy, there will be many different possible chain-based enforcement schemes. In this paper, we provide a polynomial-","authors_text":"Gregory Gutin, Jason Crampton, Mark Jones, Naomi Farley","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-04T16:51:31Z","title":"Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01382","kind":"arxiv","version":2},"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:e85865ce9c37a3e065bb85455660749f9f6c60c33e935741f0018197bd5f356c","target":"record","created_at":"2026-05-18T02:17:23Z","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":"6aba7ee51679113342e030ab5a5ebe8cf1c5eb732ae466d628b00dcd662a8ef7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-04T16:51:31Z","title_canon_sha256":"f0714f608fa1bd79c0325b2cec372eae43cf39b7cc7f2a8c5dcf8245384450c5"},"schema_version":"1.0","source":{"id":"1503.01382","kind":"arxiv","version":2}},"canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","first_computed_at":"2026-05-18T02:17:23.902778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:23.902778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E2Ma377OyoA5IWy5N35NxDYtpmRMM3IsU7s/K9l41802/NAC6BIGBUBJwWWD778hEkbqn8u/cW106KrIBtdCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:23.903420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01382","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e85865ce9c37a3e065bb85455660749f9f6c60c33e935741f0018197bd5f356c","sha256:98d1878f7904840fcab4ef5a8daf8b2e70f985a874f59291ed11efd6d0c852bf"],"state_sha256":"fb1533121c67b2f5b521c629b4ce117e781044dfd17c22b2484c56d22fcf327c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqSzmrlExBxTDBcTcUITRquFdhhIru8KrsXEEJ9t7Y34EZrmdcG0+qqB4u+87r+Zc7fej7bH/8hdKG85QFSzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:46:52.473221Z","bundle_sha256":"9d583570887d05cbc0d33924cbf3298866e59e4294d02f2dee8a2aa070e655c0"}}