{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ULYPLKLUVZ72AMES4RDYD3OE4B","short_pith_number":"pith:ULYPLKLU","schema_version":"1.0","canonical_sha256":"a2f0f5a974ae7fa03092e44781edc4e07d13a7c769ca22fc48fbc80e5753278c","source":{"kind":"arxiv","id":"2501.13733","version":1},"attestation_state":"computed","paper":{"title":"Post-Quantum Stealth Address Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Marija Mikic, Mihajlo Srbakoski, Strahinja Praska","submitted_at":"2025-01-23T15:09:49Z","abstract_excerpt":"The Stealth Address Protocol (SAP) allows users to receive assets through stealth addresses that are unlinkable to their stealth meta-addresses. The most widely used SAP, Dual-Key SAP (DKSAP), and the most performant SAP, Elliptic Curve Pairing Dual-Key SAP (ECPDKSAP), are based on elliptic curve cryptography, which is vulnerable to quantum attacks. These protocols depend on the elliptic curve discrete logarithm problem, which could be efficiently solved on a sufficiently powerful quantum computer using the Shor algorithm. In this paper three novel post-quantum SAPs based on lattice-based cryp"},"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":"2501.13733","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-01-23T15:09:49Z","cross_cats_sorted":[],"title_canon_sha256":"ddef7b8ae75cce64cb8a205e61b4f40f6fbb3956e71f93718fb99cce3ed15df3","abstract_canon_sha256":"67373f1cc8be90f1e0e4848dc3ad863fe3b16b02d2519ac25956bfb49f8443b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:33.267701Z","signature_b64":"dTHhEsdOszM13h6rCXTxQY2YSSSdB8f4ABn+NYtndotbD2nnL1dBWqZ914A7jnaDI38cf2B6MARuAJg6A4SyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f0f5a974ae7fa03092e44781edc4e07d13a7c769ca22fc48fbc80e5753278c","last_reissued_at":"2026-07-05T10:04:33.267260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:33.267260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Post-Quantum Stealth Address Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Marija Mikic, Mihajlo Srbakoski, Strahinja Praska","submitted_at":"2025-01-23T15:09:49Z","abstract_excerpt":"The Stealth Address Protocol (SAP) allows users to receive assets through stealth addresses that are unlinkable to their stealth meta-addresses. The most widely used SAP, Dual-Key SAP (DKSAP), and the most performant SAP, Elliptic Curve Pairing Dual-Key SAP (ECPDKSAP), are based on elliptic curve cryptography, which is vulnerable to quantum attacks. These protocols depend on the elliptic curve discrete logarithm problem, which could be efficiently solved on a sufficiently powerful quantum computer using the Shor algorithm. In this paper three novel post-quantum SAPs based on lattice-based cryp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13733","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.13733/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":"2501.13733","created_at":"2026-07-05T10:04:33.267325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13733v1","created_at":"2026-07-05T10:04:33.267325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13733","created_at":"2026-07-05T10:04:33.267325+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULYPLKLUVZ72","created_at":"2026-07-05T10:04:33.267325+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULYPLKLUVZ72AMES","created_at":"2026-07-05T10:04:33.267325+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULYPLKLU","created_at":"2026-07-05T10:04:33.267325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21097","citing_title":"Singularity Cipher: A Topology-Driven Cryptographic Scheme Based on Visual Paradox and Klein Bottle Illusions","ref_index":141,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B","json":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B.json","graph_json":"https://pith.science/api/pith-number/ULYPLKLUVZ72AMES4RDYD3OE4B/graph.json","events_json":"https://pith.science/api/pith-number/ULYPLKLUVZ72AMES4RDYD3OE4B/events.json","paper":"https://pith.science/paper/ULYPLKLU"},"agent_actions":{"view_html":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B","download_json":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B.json","view_paper":"https://pith.science/paper/ULYPLKLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13733&json=true","fetch_graph":"https://pith.science/api/pith-number/ULYPLKLUVZ72AMES4RDYD3OE4B/graph.json","fetch_events":"https://pith.science/api/pith-number/ULYPLKLUVZ72AMES4RDYD3OE4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B/action/storage_attestation","attest_author":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B/action/author_attestation","sign_citation":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B/action/citation_signature","submit_replication":"https://pith.science/pith/ULYPLKLUVZ72AMES4RDYD3OE4B/action/replication_record"}},"created_at":"2026-07-05T10:04:33.267325+00:00","updated_at":"2026-07-05T10:04:33.267325+00:00"}