Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits

Mike Rosulek, Lawrence Roy. Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. In Tal Malkin, Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I. Volume 12825 of Lecture Notes in Computer Science, pages 94-124, Springer, 2021. [doi]

@inproceedings{RosulekR21-0,
  title = {Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits},
  author = {Mike Rosulek and Lawrence Roy},
  year = {2021},
  doi = {10.1007/978-3-030-84242-0_5},
  url = {https://doi.org/10.1007/978-3-030-84242-0_5},
  researchr = {https://researchr.org/publication/RosulekR21-0},
  cites = {0},
  citedby = {0},
  pages = {94-124},
  booktitle = {Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I},
  editor = {Tal Malkin and Chris Peikert},
  volume = {12825},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-84242-0},
}