Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Shared randomness is an important resource in cryptography. It is ll-known that in the information-theoretic setting there is no protocol that allows two parties who do not trust each other to obtain a uniformly distributed shared bit string solely by exchanging messages such that a dishonest party can not influence the result. On the other hand, in the situation where the two parties already share a random bit string and want to use it in order to construct a longer random bit string, it is only known to be impossible when the protocols are restricted in the number of messages to be exchanged.   prove that it is also impossible when arbitrarily many messages are allod.
['Gregor Seiler', 'Ueli Maurer']
I am writing a research paper on a idea On the impossibility of information-theoretic composable coin toss extension
[{"from": "human", "value": "I am writing a research paper on a idea On the impossibility of information-theoretic composable coin toss extension"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Shared randomness is an important resource in cryptography. It is ll-known that in the information-theoretic setting there is no protocol that allows two parties who do not trust each other to obtain a uniformly distributed shared bit string solely by exchanging messages such that a dishonest party can not influence the result. On the other hand, in the situation where the two parties already share a random bit string and want to use it in order to construct a longer random bit string, it is only known to be impossible when the protocols are restricted in the number of messages to be exchanged.   prove that it is also impossible when arbitrarily many messages are allod."}]