INTERACTIVE GRAPHICAL EDITOR FOR GARBLED CIRCUITS PROTOCOLS EVALUATION
DOI:
https://doi.org/10.24867/31BE11VukovicKeywords:
MPC, 2PC, Yao’s GC protocol, OT protocol, boolean circuit, interactive graphic editorAbstract
This paper presents the field of secure multiparty computation and Yao's Garbled Circuits protocol, which represents its basic implementation. It also descibes a secure ways of exchanging private data using the Oblivious Transfer protocols. The presented protocols were evaluated through an interactive graphical editor for the evaluation of logic circuits that adopts the previous concepts.
References
[1] Boudot, F., Schoenmakers, B., & Traore, J. (2001). A fair and efficient solution to the socialist millionaires’ problem. Discrete Applied Mathematics, 111(1-2), 23-36.
[2] Lindell, Y. (2020). Secure multiparty computation. Communications of the ACM, 64(1), 86-96.
[3] Lindell, Y., & Pinkas, B. (2009). A proof of security of Yao’s protocol for two-party computation. Journal of cryptology, 22, 161-188.
[4] Yadav, V. K., Andola, N., Verma, S., & Venkatesan, S. (2022). A survey of oblivious transfer protocol. ACM Computing Surveys (CSUR), 54(10s), 1-37.
[5] Evans, D., Kolesnikov, V., & Rosulek, M. (2018). A pragmatic introduction to secure multi-party computation. Foundations and Trends® in Privacy and Security, 2(2-3), 70-246.
[6] Malkhi, D., Nisan, N., Pinkas, B., & Sella, Y. (2004, August). Fairplay-Secure Two-Party Computation System. In USENIX security symposium (Vol. 4, p. 9).
[7] Yakoubov, S. (2017). A gentle introduction to yao’s garbled circuits. Dostupno na https://web. mit. edu/sonka89/www/papers/2017ygc.pdf (datum pristupa 10-09-2024)
[8] Beaver, D., Micali, S., & Rogaway, P. (1990, April). The round complexity of secure protocols. In Proceedings of the twenty-second annual ACM symposium on Theory of computing (pp. 503-513).
[9] Rabin, M. O. (2005). How to exchange secrets with oblivious transfer. Cryptology ePrint Archive.
[10] Hintjens, P. (2013). ZeroMQ: Messaging for Many Applications. O'Reilly Media.
[11] Beaver, D., Micali, S., & Rogaway, P. (1990, April). The round complexity of secure protocols. In Proceedings of the twenty-second annual ACM symposium on Theory of computing (pp. 503-513).
[12] Goldreich, O., Micali, S., & Wigderson, A. (2019). How to play any mental game, or a completeness theorem for protocols with honest majority. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali (pp. 307-328).
[13] Ben-Or, M., Goldwasser, S., & Wigderson, A. (2019). Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali (pp. 351-371).
[14] Kolesnikov V., (2005). Gate evaluation secret sharing and secure one-round two-party computation, Advances in Cryptology-ASIACRYPT.
