A Protocol to Achieve Independence in Constant Rounds

Authors:
Rosario Gennaro
Affiliations:
-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2000

Citing 14
Cited 7

Achieving independence in logarithmic number of rounds

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Zero-knowledge proofs of identity

Journal of Cryptology
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Noninteractive zero-knowledge

SIAM Journal on Computing
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
How to share a secret

Communications of the ACM
Collective Coin Tossing Without Assumptions nor Broadcasting

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Incoercible multiparty computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Simultaneous broadcast revisited

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal communication complexity of generic multicast key distribution

IEEE/ACM Transactions on Networking (TON)
Efficient simultaneous broadcast

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Cyberdice: peer-to-peer gambling in the presence of cheaters

Security'08 Proceedings of the 16th International conference on Security protocols
Adaptively secure broadcast

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Universally composable simultaneous broadcast

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Attacking and fixing Helios: An analysis of ballot secrecy

Journal of Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Independence is a fundamental property needed to achieve security in fault-tolerant distributed computing. In practice, distributed communication networks are neither fully synchronous or fully asynchronous, but rather loosely synchronized. By this, we mean that in a communication protocol, messages at a given round may depend on messages from other players at the same round.These possible dependencies among messages create problems if we need $n$ players to announce independently chosen values. This task is called simultaneous broadcast. In this paper, we present the first constant round protocol for simultaneous broadcast in a reasonable computation model (which includes a common shared random string among the players). The protocol is provably secure under general cryptographic assumptions. In the process, we develop a new and stronger formal definition for this problem. Previously known protocols for this task required either $O(\log n)$ or expected constant rounds to complete (depending on the computation model considered).