Can We Beat Three Halves Lower Bound?: (Im)Possibility of Reducing Communication Cost for Garbled Circuits. - Chunghun Baek; Taechan Kim (IACR Cryptol. ePrint Arch., 2024)

Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits. - Chunghun Baek; Taechan Kim 001 (Des. Codes Cryptogr., 2025)