{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UMV227BXPE4CCMXNEHJV5C2BJW","short_pith_number":"pith:UMV227BX","schema_version":"1.0","canonical_sha256":"a32bad7c3779382132ed21d35e8b414da93a46b3dce474a5e559540762e1866d","source":{"kind":"arxiv","id":"1503.01382","version":2},"attestation_state":"computed","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-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01382","created_at":"2026-05-18T02:17:23.902864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01382v2","created_at":"2026-05-18T02:17:23.902864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01382","created_at":"2026-05-18T02:17:23.902864+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMV227BXPE4C","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMV227BXPE4CCMXN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMV227BX","created_at":"2026-05-18T12:29:44.643036+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/UMV227BXPE4CCMXNEHJV5C2BJW","json":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW.json","graph_json":"https://pith.science/api/pith-number/UMV227BXPE4CCMXNEHJV5C2BJW/graph.json","events_json":"https://pith.science/api/pith-number/UMV227BXPE4CCMXNEHJV5C2BJW/events.json","paper":"https://pith.science/paper/UMV227BX"},"agent_actions":{"view_html":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW","download_json":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW.json","view_paper":"https://pith.science/paper/UMV227BX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01382&json=true","fetch_graph":"https://pith.science/api/pith-number/UMV227BXPE4CCMXNEHJV5C2BJW/graph.json","fetch_events":"https://pith.science/api/pith-number/UMV227BXPE4CCMXNEHJV5C2BJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/action/storage_attestation","attest_author":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/action/author_attestation","sign_citation":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/action/citation_signature","submit_replication":"https://pith.science/pith/UMV227BXPE4CCMXNEHJV5C2BJW/action/replication_record"}},"created_at":"2026-05-18T02:17:23.902864+00:00","updated_at":"2026-05-18T02:17:23.902864+00:00"}