{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YB2VYFTAZALGIC5DSGLGNTBNVV","short_pith_number":"pith:YB2VYFTA","schema_version":"1.0","canonical_sha256":"c0755c1660c816640ba3919666cc2dad52757e906508ec348accef5cecffede0","source":{"kind":"arxiv","id":"1807.03720","version":3},"attestation_state":"computed","paper":{"title":"sAVSS: Scalable Asynchronous Verifiable Secret Sharing in BFT Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alin Tomescu, Dahlia Malkhi, Emin G\\\"un Sirer, Ittai Abraham, Michael K. Reiter, Soumya Basu","submitted_at":"2018-07-10T15:44:00Z","abstract_excerpt":"This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarantee of classical Byzantine Fault Tolerant algorithms to include privacy as well. This provides applications with a powerful primitive: a threshold trusted third party, which simplifies many difficult problems such as a fair exchange. In order to incorporate VSS into BFT, we introduced sAVSS, a framework that transforms any VSS scheme into an asynchronous VSS scheme with constant overhead. By incorporating Kate et al.'s"},"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":"1807.03720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-10T15:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"045aebcc63c4b155b209e95809f973d9615370d096efec092573b7d333f6c9f9","abstract_canon_sha256":"6a5413e227a9e3f3f2817ea13aeb3feb033e4a952dbbfe844423d4e7663cb4da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:31.660663Z","signature_b64":"GKrlBj9yxqP/oNv0kL2QfgcpVpTJn7jV9jtd2mz9RaBE9Z5qGq6MDzItSabg1fk5KtE1juxBC+iYtD6UCVjWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0755c1660c816640ba3919666cc2dad52757e906508ec348accef5cecffede0","last_reissued_at":"2026-05-17T23:57:31.660182Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:31.660182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"sAVSS: Scalable Asynchronous Verifiable Secret Sharing in BFT Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alin Tomescu, Dahlia Malkhi, Emin G\\\"un Sirer, Ittai Abraham, Michael K. Reiter, Soumya Basu","submitted_at":"2018-07-10T15:44:00Z","abstract_excerpt":"This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarantee of classical Byzantine Fault Tolerant algorithms to include privacy as well. This provides applications with a powerful primitive: a threshold trusted third party, which simplifies many difficult problems such as a fair exchange. In order to incorporate VSS into BFT, we introduced sAVSS, a framework that transforms any VSS scheme into an asynchronous VSS scheme with constant overhead. By incorporating Kate et al.'s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03720","kind":"arxiv","version":3},"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":"1807.03720","created_at":"2026-05-17T23:57:31.660256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03720v3","created_at":"2026-05-17T23:57:31.660256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03720","created_at":"2026-05-17T23:57:31.660256+00:00"},{"alias_kind":"pith_short_12","alias_value":"YB2VYFTAZALG","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YB2VYFTAZALGIC5D","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YB2VYFTA","created_at":"2026-05-18T12:33:04.347982+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/YB2VYFTAZALGIC5DSGLGNTBNVV","json":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV.json","graph_json":"https://pith.science/api/pith-number/YB2VYFTAZALGIC5DSGLGNTBNVV/graph.json","events_json":"https://pith.science/api/pith-number/YB2VYFTAZALGIC5DSGLGNTBNVV/events.json","paper":"https://pith.science/paper/YB2VYFTA"},"agent_actions":{"view_html":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV","download_json":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV.json","view_paper":"https://pith.science/paper/YB2VYFTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03720&json=true","fetch_graph":"https://pith.science/api/pith-number/YB2VYFTAZALGIC5DSGLGNTBNVV/graph.json","fetch_events":"https://pith.science/api/pith-number/YB2VYFTAZALGIC5DSGLGNTBNVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV/action/storage_attestation","attest_author":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV/action/author_attestation","sign_citation":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV/action/citation_signature","submit_replication":"https://pith.science/pith/YB2VYFTAZALGIC5DSGLGNTBNVV/action/replication_record"}},"created_at":"2026-05-17T23:57:31.660256+00:00","updated_at":"2026-05-17T23:57:31.660256+00:00"}