Answers are grounded in this paper and cite their sources.
In peer-to-peer poker, the host may also be a player at the table. If that host prepares a plaintext deck, it can inspect the cards dealt to opponents and the community cards still to come. CoronaPoker blocks this distributing deck construction and opening among the participants. They apply secret permutations and commutative scalar locks over Ristretto255, then replace the locks on community positions with independent keys. The host coordinates the exchanges, while participants verify construction evidence and authorize partial openings against their own stored deck and the stage of play. This paper specifies those operations and examines the guarantees of the implemented proof composition. We establish conditional card reconstruction and a soundness bound for the community rotation in an ideal random-oracle model. For the shuffle, we derive aggregate bounds and identify the additional representation and extraction arguments needed to obtain a complete soundness result. We also show how a public aggregate distinguishes two candidate permutations, and explain the consequence for zero knowledge when the input points are fixed independently of the simulator. These results clarify both the evidence available during a hand and the limits of the present analysis. Full shuffle soundness and privacy of the complete poker execution remain open.
No takes yet. Share an insight, caveat, or question.
Antonio Lopez Vivar (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: