Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  design the first computationally efficient codes for simultaneously reliable and deniable communication over a Binary Symmetric Channel (BSC). Our setting is as follows. A transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is deniable from an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and deniably transmit O(√n) bits over n channel uses without any shared secrets beten Alice and Bob. One drawback of prior works is that the computational complexity of the codes designed scales as 2 Θ(√n) . In this work  provide the first computationally tractable codes with provable guarantees on both reliability and deniability, while simultaneously achieving the best known throughput for the problem.
['Qiaosheng Eric Zhang', 'Mayank Bakshi', 'Sidharth Jaggi']
I am writing a research paper on a idea Computationally efficient deniable communication
[{"from": "human", "value": "I am writing a research paper on a idea Computationally efficient deniable communication"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  design the first computationally efficient codes for simultaneously reliable and deniable communication over a Binary Symmetric Channel (BSC). Our setting is as follows. A transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is deniable from an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and deniably transmit O(\u221an) bits over n channel uses without any shared secrets beten Alice and Bob. One drawback of prior works is that the computational complexity of the codes designed scales as 2 \u0398(\u221an) . In this work  provide the first computationally tractable codes with provable guarantees on both reliability and deniability, while simultaneously achieving the best known throughput for the problem."}]