{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6IH4JHK6DLW3CZFB6AXNLACNIN","short_pith_number":"pith:6IH4JHK6","canonical_record":{"source":{"id":"1005.4993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-27T06:30:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a59915dfb282c53aa8e08f7c6f7c4cb67808c87c4ecee4c7763d37d8c3c3f749","abstract_canon_sha256":"0791183ec02b55ab2a91cc2861cc00b314637d2cf483d3d0774d4e3c43e27b30"},"schema_version":"1.0"},"canonical_sha256":"f20fc49d5e1aedb164a1f02ed5804d4344b5506bbd12ba7c2a27a0a2dd54f807","source":{"kind":"arxiv","id":"1005.4993","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4993","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4993v2","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4993","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"6IH4JHK6DLW3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6IH4JHK6DLW3CZFB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6IH4JHK6","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6IH4JHK6DLW3CZFB6AXNLACNIN","target":"record","payload":{"canonical_record":{"source":{"id":"1005.4993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-27T06:30:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a59915dfb282c53aa8e08f7c6f7c4cb67808c87c4ecee4c7763d37d8c3c3f749","abstract_canon_sha256":"0791183ec02b55ab2a91cc2861cc00b314637d2cf483d3d0774d4e3c43e27b30"},"schema_version":"1.0"},"canonical_sha256":"f20fc49d5e1aedb164a1f02ed5804d4344b5506bbd12ba7c2a27a0a2dd54f807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:27.072290Z","signature_b64":"TxBjul8P7DG83yOscro/q4Q9RDb8EmI6VroWU/a5hDVuktW/V8VuGJjCNQI2fgpCEEv3EsSSLMauzqETt25oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20fc49d5e1aedb164a1f02ed5804d4344b5506bbd12ba7c2a27a0a2dd54f807","last_reissued_at":"2026-05-18T04:27:27.071797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:27.071797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.4993","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-18T04:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Je+x9sqCcz+JySiIuGyznVJmly4T7Iv5Za/kvmDjZy6Z9GcxHnmzKXHM1shsUZszNoQFOFd/lLKNXWY/yt5NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:39:45.569394Z"},"content_sha256":"5f15f2f9c77ffc65a2a944dc2ddb23a0c7524c7ec0d810981bba5fdacaaba8c1","schema_version":"1.0","event_id":"sha256:5f15f2f9c77ffc65a2a944dc2ddb23a0c7524c7ec0d810981bba5fdacaaba8c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6IH4JHK6DLW3CZFB6AXNLACNIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Constructions for the Efficient Cryptographic Enforcement of Interval-Based Access Control Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Jason Crampton","submitted_at":"2010-05-27T06:30:16Z","abstract_excerpt":"The enforcement of access control policies using cryptography has received considerable attention in recent years and the security of such enforcement schemes is increasingly well understood. Recent work in the area has considered the efficient enforcement of temporal and geo-spatial access control policies, and asymptotic results for the time and space complexity of efficient enforcement schemes have been obtained. However, for practical purposes, it is useful to have explicit bounds for the complexity of enforcement schemes.\n  In this paper, we consider interval-based access control policies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4993","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-18T04:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbr5YtKXbW63NRuiTygGLSDODHtG9o8HCrzC9bmhtfpX5Ln1frj0C3DPTHQqUa83zFu8HZIGl5tspqhYwTJACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:39:45.570049Z"},"content_sha256":"a46d4bf241f679fa1942dcc19e1a6ea986161bb936630b77adc7651a473d9607","schema_version":"1.0","event_id":"sha256:a46d4bf241f679fa1942dcc19e1a6ea986161bb936630b77adc7651a473d9607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/bundle.json","state_url":"https://pith.science/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/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-31T03:39:45Z","links":{"resolver":"https://pith.science/pith/6IH4JHK6DLW3CZFB6AXNLACNIN","bundle":"https://pith.science/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/bundle.json","state":"https://pith.science/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IH4JHK6DLW3CZFB6AXNLACNIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6IH4JHK6DLW3CZFB6AXNLACNIN","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":"0791183ec02b55ab2a91cc2861cc00b314637d2cf483d3d0774d4e3c43e27b30","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-27T06:30:16Z","title_canon_sha256":"a59915dfb282c53aa8e08f7c6f7c4cb67808c87c4ecee4c7763d37d8c3c3f749"},"schema_version":"1.0","source":{"id":"1005.4993","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4993","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4993v2","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4993","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"6IH4JHK6DLW3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6IH4JHK6DLW3CZFB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6IH4JHK6","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:a46d4bf241f679fa1942dcc19e1a6ea986161bb936630b77adc7651a473d9607","target":"graph","created_at":"2026-05-18T04:27:27Z","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 enforcement of access control policies using cryptography has received considerable attention in recent years and the security of such enforcement schemes is increasingly well understood. Recent work in the area has considered the efficient enforcement of temporal and geo-spatial access control policies, and asymptotic results for the time and space complexity of efficient enforcement schemes have been obtained. However, for practical purposes, it is useful to have explicit bounds for the complexity of enforcement schemes.\n  In this paper, we consider interval-based access control policies","authors_text":"Jason Crampton","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-27T06:30:16Z","title":"Practical Constructions for the Efficient Cryptographic Enforcement of Interval-Based Access Control Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4993","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:5f15f2f9c77ffc65a2a944dc2ddb23a0c7524c7ec0d810981bba5fdacaaba8c1","target":"record","created_at":"2026-05-18T04:27:27Z","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":"0791183ec02b55ab2a91cc2861cc00b314637d2cf483d3d0774d4e3c43e27b30","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-27T06:30:16Z","title_canon_sha256":"a59915dfb282c53aa8e08f7c6f7c4cb67808c87c4ecee4c7763d37d8c3c3f749"},"schema_version":"1.0","source":{"id":"1005.4993","kind":"arxiv","version":2}},"canonical_sha256":"f20fc49d5e1aedb164a1f02ed5804d4344b5506bbd12ba7c2a27a0a2dd54f807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f20fc49d5e1aedb164a1f02ed5804d4344b5506bbd12ba7c2a27a0a2dd54f807","first_computed_at":"2026-05-18T04:27:27.071797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:27.071797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TxBjul8P7DG83yOscro/q4Q9RDb8EmI6VroWU/a5hDVuktW/V8VuGJjCNQI2fgpCEEv3EsSSLMauzqETt25oBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:27.072290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.4993","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f15f2f9c77ffc65a2a944dc2ddb23a0c7524c7ec0d810981bba5fdacaaba8c1","sha256:a46d4bf241f679fa1942dcc19e1a6ea986161bb936630b77adc7651a473d9607"],"state_sha256":"195dd3c8a8b537366123637f1598d626fc452ae243a19690b0ccd9a5a829f83b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFRPdFaFxbkDIBS1FtRk6GM5CArhwaNAcGM67ASOL8vCTN1+V8+w+/fUse8FiGd5WffahHmnjJFmzZkdXYJWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:39:45.573363Z","bundle_sha256":"9a11cb3d4a0bf00952898bf8be4e44af19110577edf9085ddae19c466418247a"}}