Efficient Simultaneous Broadcast
PKC'08: Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography(2008)
摘要
We present an efficient simultaneous broadcast protocol v-SimCast that allows n players to announce independently chosen values, even if up to t < n/2 players are corrupt. Independence is guaranteed in the partially synchronous communication model, where communication is structured into rounds, while each round is asynchronous. The v-SimCast protocol is more efficient than previous constructions. For repeated executions, we reduce the communication and computation complexity by a factor O(n). Combined with a deterministic extractor, v-SimCast provides a particularly efficient solution for distributed coin-flipping. The protocol does not require any zero-knowledge proofs and is shown to be secure in the standard model under the Decisional Diffie Hellman assumption.
更多查看译文
关键词
SimCast protocol,efficient simultaneous broadcast protocol,efficient solution,synchronous communication model,n player,standard model,Decisional Diffie Hellman assumption,computation complexity,deterministic extractor,factor O
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络