{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VKHMIWTPT72MH2O6KLJNHGG2Q7","short_pith_number":"pith:VKHMIWTP","schema_version":"1.0","canonical_sha256":"aa8ec45a6f9ff4c3e9de52d2d398da87e1b3b92e52220dfc82f3665128e08f57","source":{"kind":"arxiv","id":"2106.07831","version":4},"attestation_state":"computed","paper":{"title":"Efficient Asynchronous Byzantine Agreement without Private Setups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Jing Xu, Qiang Tang, Yingzi Gao, Yuan Lu, Zhenfeng Zhang, Zhenliang Lu","submitted_at":"2021-06-15T01:34:11Z","abstract_excerpt":"Efficient asynchronous Byzantine agreement (BA) protocols were mostly studied with private setups, e.g., pre-setup threshold cryptosystem. Challenges remain to reduce the large communication in the absence of such setups. Recently, Abraham et al. (PODC'21) presented the first asynchronous validated BA (VBA) with expected $O(n^3)$ messages and $O(1)$ rounds, relying on only public key infrastructure (PKI) setup, but the design still costs $O({\\lambda}n^3 \\log n)$ bits. Here $n$ is the number of parties, and $\\lambda$ is a cryptographic security parameter.\n  In this paper, we reduce the communic"},"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":"2106.07831","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-06-15T01:34:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8319760d9c9a378340a8ed1e5a95adc04480b14c658c2f2843bce3d970d7642e","abstract_canon_sha256":"eb11563572bbb824bc417be2de63a38f9da322d8619d53eb80f30b154fa46265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:14.919388Z","signature_b64":"zKPE4PzBZZSwyIcac0eru1lYxkbH7KbbIwmz6dnv9dkRqsDi62/x0hG6rdLyEKoychtU9za2vKkeSVZA0H14Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa8ec45a6f9ff4c3e9de52d2d398da87e1b3b92e52220dfc82f3665128e08f57","last_reissued_at":"2026-07-05T04:18:14.918949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:14.918949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Asynchronous Byzantine Agreement without Private Setups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Jing Xu, Qiang Tang, Yingzi Gao, Yuan Lu, Zhenfeng Zhang, Zhenliang Lu","submitted_at":"2021-06-15T01:34:11Z","abstract_excerpt":"Efficient asynchronous Byzantine agreement (BA) protocols were mostly studied with private setups, e.g., pre-setup threshold cryptosystem. Challenges remain to reduce the large communication in the absence of such setups. Recently, Abraham et al. (PODC'21) presented the first asynchronous validated BA (VBA) with expected $O(n^3)$ messages and $O(1)$ rounds, relying on only public key infrastructure (PKI) setup, but the design still costs $O({\\lambda}n^3 \\log n)$ bits. Here $n$ is the number of parties, and $\\lambda$ is a cryptographic security parameter.\n  In this paper, we reduce the communic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07831","kind":"arxiv","version":4},"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/2106.07831/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":"2106.07831","created_at":"2026-07-05T04:18:14.919006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07831v4","created_at":"2026-07-05T04:18:14.919006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07831","created_at":"2026-07-05T04:18:14.919006+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKHMIWTPT72M","created_at":"2026-07-05T04:18:14.919006+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKHMIWTPT72MH2O6","created_at":"2026-07-05T04:18:14.919006+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKHMIWTP","created_at":"2026-07-05T04:18:14.919006+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/VKHMIWTPT72MH2O6KLJNHGG2Q7","json":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7.json","graph_json":"https://pith.science/api/pith-number/VKHMIWTPT72MH2O6KLJNHGG2Q7/graph.json","events_json":"https://pith.science/api/pith-number/VKHMIWTPT72MH2O6KLJNHGG2Q7/events.json","paper":"https://pith.science/paper/VKHMIWTP"},"agent_actions":{"view_html":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7","download_json":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7.json","view_paper":"https://pith.science/paper/VKHMIWTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07831&json=true","fetch_graph":"https://pith.science/api/pith-number/VKHMIWTPT72MH2O6KLJNHGG2Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/VKHMIWTPT72MH2O6KLJNHGG2Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7/action/storage_attestation","attest_author":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7/action/author_attestation","sign_citation":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7/action/citation_signature","submit_replication":"https://pith.science/pith/VKHMIWTPT72MH2O6KLJNHGG2Q7/action/replication_record"}},"created_at":"2026-07-05T04:18:14.919006+00:00","updated_at":"2026-07-05T04:18:14.919006+00:00"}