Abstract. The dining cryptographers protocol provides strong
anonymity and low latency, without requiring a trusted third party. A
problem of the protocol is that a malicious participant can disrupt com-
munication by deliberately creating collisions. We propose a computa-
tionally secure dining cryptographers protocol, wherein it is possible to
verify that a participant correctly executes a collision resolution algo-
rithm. Further, we show that a maximum stable throughput of 0.924
messages per transmission slot can be achieved.