{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FQLELL6HJCO7BYFEULSKUGDLXE","short_pith_number":"pith:FQLELL6H","schema_version":"1.0","canonical_sha256":"2c1645afc7489df0e0a4a2e4aa186bb9248179f8ca275b62521a726cc5c3374d","source":{"kind":"arxiv","id":"1901.05927","version":5},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Private User Authentication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahtab Mirmohseni, Mohammad Reza Aref, Narges Kazempour","submitted_at":"2019-01-17T17:50:13Z","abstract_excerpt":"Most of the security services in the connected world of cyber-physical systems necessitate authenticating a large number of nodes privately. In this paper, the private authentication problem is considered which consists of a certificate authority, a verifier (or some verifiers), many legitimate users (provers), and an arbitrary number of attackers. Each legitimate user wants to be authenticated (using his personal key) by the verifier(s), while simultaneously staying completely anonymous (even to the verifier). On the other hand, an attacker must fail to be authenticated. We analyze this probl"},"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":"1901.05927","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T17:50:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f6051f2617c2dd939cb6bb7736a484189befa2bc417bb129349a18eb765c6d07","abstract_canon_sha256":"e8843b4585728ff743c8323ed18dc17e49e37bf23abb8a0f42e57162503485a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:08.370804Z","signature_b64":"4VwNr4BJ4YBg/+zLVByfxg0km2CuHBIGP+GsLkifn9iV7wNlIjkWU5RSF7imbWKi07VJ5cFGu9bkyTRiVLQWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c1645afc7489df0e0a4a2e4aa186bb9248179f8ca275b62521a726cc5c3374d","last_reissued_at":"2026-07-05T04:56:08.370306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:08.370306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Private User Authentication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahtab Mirmohseni, Mohammad Reza Aref, Narges Kazempour","submitted_at":"2019-01-17T17:50:13Z","abstract_excerpt":"Most of the security services in the connected world of cyber-physical systems necessitate authenticating a large number of nodes privately. In this paper, the private authentication problem is considered which consists of a certificate authority, a verifier (or some verifiers), many legitimate users (provers), and an arbitrary number of attackers. Each legitimate user wants to be authenticated (using his personal key) by the verifier(s), while simultaneously staying completely anonymous (even to the verifier). On the other hand, an attacker must fail to be authenticated. We analyze this probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05927","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.05927/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.05927","created_at":"2026-07-05T04:56:08.370378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05927v5","created_at":"2026-07-05T04:56:08.370378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05927","created_at":"2026-07-05T04:56:08.370378+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQLELL6HJCO7","created_at":"2026-07-05T04:56:08.370378+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQLELL6HJCO7BYFE","created_at":"2026-07-05T04:56:08.370378+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQLELL6H","created_at":"2026-07-05T04:56:08.370378+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/FQLELL6HJCO7BYFEULSKUGDLXE","json":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE.json","graph_json":"https://pith.science/api/pith-number/FQLELL6HJCO7BYFEULSKUGDLXE/graph.json","events_json":"https://pith.science/api/pith-number/FQLELL6HJCO7BYFEULSKUGDLXE/events.json","paper":"https://pith.science/paper/FQLELL6H"},"agent_actions":{"view_html":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE","download_json":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE.json","view_paper":"https://pith.science/paper/FQLELL6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05927&json=true","fetch_graph":"https://pith.science/api/pith-number/FQLELL6HJCO7BYFEULSKUGDLXE/graph.json","fetch_events":"https://pith.science/api/pith-number/FQLELL6HJCO7BYFEULSKUGDLXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE/action/storage_attestation","attest_author":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE/action/author_attestation","sign_citation":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE/action/citation_signature","submit_replication":"https://pith.science/pith/FQLELL6HJCO7BYFEULSKUGDLXE/action/replication_record"}},"created_at":"2026-07-05T04:56:08.370378+00:00","updated_at":"2026-07-05T04:56:08.370378+00:00"}