Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Broadcast among n parties in the presence of t ges n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure, digital signatures, where so-called authenticated broadcast is achievable for any t  2 ) rounds. In particular,  obtain expected constant-round pivtocols for t = n/2 + O(1). ldr On the negative side,  show that even randomized protocols require Omega(2n/(n-t)) rounds. This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.
['Juan A. Garay', 'Jonathan Katz', 'Chiu-Yuen Koo', 'Rafail Ostrovsky']
I am writing a research paper on a idea Round Complexity of Authenticated Broadcast with a Dishonest Majority
[{"from": "human", "value": "I am writing a research paper on a idea Round Complexity of Authenticated Broadcast with a Dishonest Majority"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Broadcast among n parties in the presence of t ges n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure, digital signatures, where so-called authenticated broadcast is achievable for any t  2 ) rounds. In particular,  obtain expected constant-round pivtocols for t = n/2 + O(1). ldr On the negative side,  show that even randomized protocols require Omega(2n/(n-t)) rounds. This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant."}]