{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2LAZ2XQEZCKFA4VTBDAC66MKJ6","short_pith_number":"pith:2LAZ2XQE","schema_version":"1.0","canonical_sha256":"d2c19d5e04c8945072b308c02f798a4fbb55bcffc634d73a69f281f2aa19e524","source":{"kind":"arxiv","id":"1505.03040","version":1},"attestation_state":"computed","paper":{"title":"Multi-Prover Commitments Against Non-Signaling Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Max Fillinger, Serge Fehr","submitted_at":"2015-05-12T14:53:03Z","abstract_excerpt":"We reconsider the concept of multi-prover commitments, as introduced in the late eighties in the seminal work by Ben-Or et al. As was recently shown by Cr\\'{e}peau et al., the security of known two-prover commitment schemes not only relies on the explicit assumption that the provers cannot communicate, but also depends on their information processing capabilities. For instance, there exist schemes that are secure against classical provers but insecure if the provers have quantum information processing capabilities, and there are schemes that resist such quantum attacks but become insecure when"},"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":"1505.03040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-12T14:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"3d23dc2cae44a78dd957da770530639ad311d27e24e3f2141d9ce2634c5fa1ca","abstract_canon_sha256":"88a621b460df89fe63e33570aa6627c62f3c5d4a1b87e1b6dc02173c4b32bad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:09.229619Z","signature_b64":"NYm/Brc5TKF9GdPXxYyQZkxpKXifm2RdbwjnuRaANaEJp0j7COlr0o7dN0gLjnmWnR6YVT92VhGJCD7PEDp4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c19d5e04c8945072b308c02f798a4fbb55bcffc634d73a69f281f2aa19e524","last_reissued_at":"2026-05-18T02:14:09.229138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:09.229138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Prover Commitments Against Non-Signaling Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Max Fillinger, Serge Fehr","submitted_at":"2015-05-12T14:53:03Z","abstract_excerpt":"We reconsider the concept of multi-prover commitments, as introduced in the late eighties in the seminal work by Ben-Or et al. As was recently shown by Cr\\'{e}peau et al., the security of known two-prover commitment schemes not only relies on the explicit assumption that the provers cannot communicate, but also depends on their information processing capabilities. For instance, there exist schemes that are secure against classical provers but insecure if the provers have quantum information processing capabilities, and there are schemes that resist such quantum attacks but become insecure when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03040","kind":"arxiv","version":1},"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":"1505.03040","created_at":"2026-05-18T02:14:09.229210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03040v1","created_at":"2026-05-18T02:14:09.229210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03040","created_at":"2026-05-18T02:14:09.229210+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LAZ2XQEZCKF","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LAZ2XQEZCKFA4VT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LAZ2XQE","created_at":"2026-05-18T12:29:02.477457+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/2LAZ2XQEZCKFA4VTBDAC66MKJ6","json":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6.json","graph_json":"https://pith.science/api/pith-number/2LAZ2XQEZCKFA4VTBDAC66MKJ6/graph.json","events_json":"https://pith.science/api/pith-number/2LAZ2XQEZCKFA4VTBDAC66MKJ6/events.json","paper":"https://pith.science/paper/2LAZ2XQE"},"agent_actions":{"view_html":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6","download_json":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6.json","view_paper":"https://pith.science/paper/2LAZ2XQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03040&json=true","fetch_graph":"https://pith.science/api/pith-number/2LAZ2XQEZCKFA4VTBDAC66MKJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/2LAZ2XQEZCKFA4VTBDAC66MKJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6/action/storage_attestation","attest_author":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6/action/author_attestation","sign_citation":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6/action/citation_signature","submit_replication":"https://pith.science/pith/2LAZ2XQEZCKFA4VTBDAC66MKJ6/action/replication_record"}},"created_at":"2026-05-18T02:14:09.229210+00:00","updated_at":"2026-05-18T02:14:09.229210+00:00"}