Reference health

Secure communication in minimal connectivity models

https://doi.org/10.1007/bfb0054138
CiteStamped reference-health badge
16/16 checkable references clean · checked 2026-09-03

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

1 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 16 checked references that resolve
resolves10.1145/73007.73033
On the complexity of radio communication
resolves10.1007/0-387-34805-0_49
Multiparty Protocols Tolerating Half Faulty Processors
resolves10.1145/167088.167109
Asynchronous secure computation
resolves10.1145/62212.62213
Completeness theorems for non-cryptographic fault-tolerant distributed computation
resolves10.1145/4221.214134
Asynchronous consensus and broadcast protocols
resolves10.1090/dimacs/038/08
Trust and security: A new look at the Byzantine generals problem
resolves10.1145/62212.62214
Multiparty unconditionally secure protocols
resolves10.1145/214438.214439
Distributed process groups in the V Kernel
resolves10.1016/0196-6774(82)90004-9
The Byzantine generals strike again
resolves10.1145/138027.138036
Perfectly secure message transmission
resolves10.1145/225058.225077
Secure hypergraphs
resolves10.1109/SFCS.1991.185405
Fault-tolerant computation in the full information model
resolves10.1145/322186.322188
Reaching Agreement in the Presence of Faults
resolves10.1145/58564.59294
Reliable scheduling in a TMR database system
resolves10.1145/195613.195621
Robust sharing of secrets when the dealer is honest or cheating
resolves10.1145/73007.73014
Verifiable secret sharing and multiparty protocols with honest majority
The 1 reference without a DOI — listed, not checked
no DOI — not checkedA. Beimel and M. Franklin, “Reliable communication over partially authenticated networks,” Proc. Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 1320, 1997, 245–259.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-09-03 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/bfb0054138"><img src="https://citestamp.com/citestamped/10.1007/bfb0054138/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bfb0054138/badge.svg)](https://citestamp.com/citestamped/10.1007/bfb0054138)