1. Applebaum, B., Holenstein, T., Mishra, M., Shayevitz, O.: The communication complexity of private simultaneous messages, revisited. J. Cryptol. 33(3), 917–953 (2020)
2. Lecture Notes in Computer Science;L Assouline,2021
3. Ball, M., Holmgren, J., Ishai, Y., Liu, T., Malkin, T.; On the complexity of decomposable randomized encodings, or: how friendly can a garbling-friendly PRF be? In: ITCS 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020)
4. Ball, M., Randolph, T.: A note on the complexity of private simultaneous messages with many parties. In: ITC 2022. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022)
5. Lecture Notes in Computer Science;A Beimel,2014