We prove a version of "Reversed Newman Theorem" in context of information complexity: every private-coin communication protocol with information complexity I and communication complexity C can be replaced by public-coin protocol with the same behavior so that it's information complexity does not exceed OIC . This result holds for unbounded-round communication whereas previous results in this area dealt with one-way protocols. As an application it gives an undirect way to prove a best-known compression theorem in Information Complexity.