( en | de | ru )

 

Disambiguation of "Ravi, Divya"

Author of the publication

copydeleteadd this publication to your clipboard
Broadcast-Optimal Four-Round MPC in the Plain Model.

, , , , , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 3-32. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Divya Parmar

Divya Prasad

Ravi Walli

Divya Sekar

Divya Mangotra

 

Other publications of authors with the same name

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels., , , and . LATINCRYPT, volume 14168 of Lecture Notes in Computer Science, page 87-106. Springer, (2023)Broadcast-Optimal Four-Round MPC in the Plain Model., , , , , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 3-32. Springer, (2023)On the Exact Round Complexity of Secure Three-Party Computation., and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 425-458. Springer, (2018)On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation., , and . ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 60-91. Springer, (2020)Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)., , , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 55-71. Springer, (2018)On the Power of Hybrid Networks in Multi-Party Computation., and . IEEE Trans. Inf. Theory, 64 (6): 4207-4227 (2018)Taming Adaptivity in YOSO Protocols: The Modular Way., , , , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 33-62. Springer, (2023)On the Round Complexity of Fully Secure Solitary MPC with Honest Majority., , , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 124-155. Springer, (2023)Towards Efficient YOSO MPC Without Setup., , and . IACR Cryptol. ePrint Arch., (2022)Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation., and . ASIACRYPT (1), volume 11921 of Lecture Notes in Computer Science, page 456-487. Springer, (2019)