Search results
Results: 5
Number of items: 5
-
Ciampi, M., Ravi, D., Siniscalchi, L., & Xia, Y. (2026). Broadcast-Optimal Secure Computation from Black-Box Oblivious Transfer. In G. Hanaoka, & B.-Y. Yang (Eds.), Advances in Cryptology - ASIACRYPT 2025: 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8–12, 2025 : proceedings (Vol. V, pp. 133-162). (Lecture Notes in Computer Science; Vol. 16249). Springer. https://doi.org/10.1007/978-981-95-5116-3_5
-
Ciampi, M., Damgárd, I., Ravi, D., Siniscalchi, L., & Yakoubov, S. (2026). Information-Theoretic Broadcast-Optimal MPC. In B. Applebaum, & H. Lin (Eds.), Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025 : proceedings (Vol. I, pp. 152-181). (Lecture Notes in Computer Science; Vol. 16268). Springer. https://doi.org/10.1007/978-3-032-12287-2_6
-
Canetti, R., Damgård, I., Kolby, S., Ravi, D., & Yakoubov, S. (2026). Deniable Secret Sharing. In B. Applebaum, & H. Lin (Eds.), Theory of Cryptography : 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings (Vol. II, pp. 399-427). (Lecture Notes in Computer Science; Vol. 16269 ). Springer. https://doi.org/10.1007/978-3-032-12293-3_13
-
Kondi, Y., & Ravi, D. (2025). Separating Broadcast from Cheater Identification. In CCS '25: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security : October 13-17, 2025, Taipei, Taiwan (pp. 3664-3677). Association for Computing Machinery. https://doi.org/10.1145/3719027.3765041 -
Karmakar, B., Koti, N., Patra, A., Patranabis, S., Paul, P., & Ravi, D. (2024). Asterisk: Super-fast MPC with a Friend. In 45th IEEE Symposium on Security and Privacy : SP 2024: 20-23 May 2024, San Francisco, California : proceedings (pp. 542-560). IEEE Computer Society. https://doi.org/10.1109/SP54263.2024.00128
Page of