Adaptively Secure Garbling with Near Optimal Online Complexity

Sanjam Garg, Akshayaram Srinivasan. Adaptively Secure Garbling with Near Optimal Online Complexity. IACR Cryptology ePrint Archive, 2018:151, 2018. [doi]

@article{GargS18,
  title = {Adaptively Secure Garbling with Near Optimal Online Complexity},
  author = {Sanjam Garg and Akshayaram Srinivasan},
  year = {2018},
  url = {http://eprint.iacr.org/2018/151},
  researchr = {https://researchr.org/publication/GargS18},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2018},
  pages = {151},
}