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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.