{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YM5LF7S7M5Z4NGTKOQF2AOGE2A","short_pith_number":"pith:YM5LF7S7","canonical_record":{"source":{"id":"1402.5371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-21T17:53:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3f8c750a31a4588702c258f16645d33b0d806a2955c8e63fa68febdcf0f5625f","abstract_canon_sha256":"dfb52413aa1c21c1cf74100de54f4f4912bd8f01f707f120b56c5717280c8b6b"},"schema_version":"1.0"},"canonical_sha256":"c33ab2fe5f6773c69a6a740ba038c4d0186f5397e90362ff87fa4b0071db8390","source":{"kind":"arxiv","id":"1402.5371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5371","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5371v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5371","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"YM5LF7S7M5Z4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YM5LF7S7M5Z4NGTK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YM5LF7S7","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YM5LF7S7M5Z4NGTKOQF2AOGE2A","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-21T17:53:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3f8c750a31a4588702c258f16645d33b0d806a2955c8e63fa68febdcf0f5625f","abstract_canon_sha256":"dfb52413aa1c21c1cf74100de54f4f4912bd8f01f707f120b56c5717280c8b6b"},"schema_version":"1.0"},"canonical_sha256":"c33ab2fe5f6773c69a6a740ba038c4d0186f5397e90362ff87fa4b0071db8390","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.609308Z","signature_b64":"IoPXMt53q7ShCM2fD782kzoCeCjiITzK9zstDQJwVcCLdY+x2xbyRSFYnHK4W+HRyWKwBuS9kJfEPn/gio/TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c33ab2fe5f6773c69a6a740ba038c4d0186f5397e90362ff87fa4b0071db8390","last_reissued_at":"2026-05-18T01:34:55.608657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.608657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5371","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-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfkomqvfVEypDr/+bRsg8N1QdqnJDN2ij9ILgKuCHAMGebaw++pkG7o9viqPy27BYq8ldVR3rdfxxcfqAqZRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:00:33.591757Z"},"content_sha256":"5efe77f2bab40b948923a9bbc3605544adeb8017c58fc529a07f7ddac2d274e4","schema_version":"1.0","event_id":"sha256:5efe77f2bab40b948923a9bbc3605544adeb8017c58fc529a07f7ddac2d274e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YM5LF7S7M5Z4NGTKOQF2AOGE2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes in the Unconditional Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Barbara Masucci, Massimo Cafaro, Roberto Civino","submitted_at":"2014-02-21T17:53:58Z","abstract_excerpt":"The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierarchical key assignment schemes has been traditionally considered in two different settings, i.e., the unconditionally secure and the computationally secure setting, and with respect to two different notions: security against key recovery (KR-security) and security with respect to key indistinguishability (KI-security), with the latter notion being cryptographically stronger. Recent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5371","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-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JT6M5Tro65a/OA/3AGxKuTZhK7ahztXPxI9bi8/H+HtFA0gpLyaCBn5n0qcjmqiFo5No4NfUXEGOVWAnpMYvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:00:33.592153Z"},"content_sha256":"e7a8c3911b41abde476fbd4a239c9988b0f97b487ab19b3926609b73d8c5cf74","schema_version":"1.0","event_id":"sha256:e7a8c3911b41abde476fbd4a239c9988b0f97b487ab19b3926609b73d8c5cf74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/bundle.json","state_url":"https://pith.science/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/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-04T04:00:33Z","links":{"resolver":"https://pith.science/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A","bundle":"https://pith.science/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/bundle.json","state":"https://pith.science/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YM5LF7S7M5Z4NGTKOQF2AOGE2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YM5LF7S7M5Z4NGTKOQF2AOGE2A","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":"dfb52413aa1c21c1cf74100de54f4f4912bd8f01f707f120b56c5717280c8b6b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-21T17:53:58Z","title_canon_sha256":"3f8c750a31a4588702c258f16645d33b0d806a2955c8e63fa68febdcf0f5625f"},"schema_version":"1.0","source":{"id":"1402.5371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5371","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5371v2","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5371","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"YM5LF7S7M5Z4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YM5LF7S7M5Z4NGTK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YM5LF7S7","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:e7a8c3911b41abde476fbd4a239c9988b0f97b487ab19b3926609b73d8c5cf74","target":"graph","created_at":"2026-05-18T01:34:55Z","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 access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierarchical key assignment schemes has been traditionally considered in two different settings, i.e., the unconditionally secure and the computationally secure setting, and with respect to two different notions: security against key recovery (KR-security) and security with respect to key indistinguishability (KI-security), with the latter notion being cryptographically stronger. Recent","authors_text":"Barbara Masucci, Massimo Cafaro, Roberto Civino","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-21T17:53:58Z","title":"On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes in the Unconditional Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5371","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:5efe77f2bab40b948923a9bbc3605544adeb8017c58fc529a07f7ddac2d274e4","target":"record","created_at":"2026-05-18T01:34:55Z","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":"dfb52413aa1c21c1cf74100de54f4f4912bd8f01f707f120b56c5717280c8b6b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-21T17:53:58Z","title_canon_sha256":"3f8c750a31a4588702c258f16645d33b0d806a2955c8e63fa68febdcf0f5625f"},"schema_version":"1.0","source":{"id":"1402.5371","kind":"arxiv","version":2}},"canonical_sha256":"c33ab2fe5f6773c69a6a740ba038c4d0186f5397e90362ff87fa4b0071db8390","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c33ab2fe5f6773c69a6a740ba038c4d0186f5397e90362ff87fa4b0071db8390","first_computed_at":"2026-05-18T01:34:55.608657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:55.608657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IoPXMt53q7ShCM2fD782kzoCeCjiITzK9zstDQJwVcCLdY+x2xbyRSFYnHK4W+HRyWKwBuS9kJfEPn/gio/TCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:55.609308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5efe77f2bab40b948923a9bbc3605544adeb8017c58fc529a07f7ddac2d274e4","sha256:e7a8c3911b41abde476fbd4a239c9988b0f97b487ab19b3926609b73d8c5cf74"],"state_sha256":"aefc517a8d199e22e4a4e6b1c528caa1e584e5eb3eca5d91584d61cd67777d65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeGNhXL4Ca8uWw5KVgMPr65KklWDEPo07SF3UP2KoGIJEjoXz20FyhJd2gOv+hA9DpTxNlOvtWZX/nHYbUELAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:00:33.595931Z","bundle_sha256":"9e1e8976699c39bbbca8a1c2e95ff381f7d6e4d8d9f24bc82a93df894f572682"}}