Paper 2018/151
Adaptively Secure Garbling with Near Optimal Online Complexity
Sanjam Garg and Akshayaram Srinivasan
Abstract
We construct an adaptively secure garbling scheme with an online communication complexity of
Metadata
- Available format(s)
-
PDF
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2018
- Contact author(s)
- akshayaram @ berkeley edu
- History
- 2018-02-11: received
- Short URL
- https://ia.cr/2018/151
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/151, author = {Sanjam Garg and Akshayaram Srinivasan}, title = {Adaptively Secure Garbling with Near Optimal Online Complexity}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/151}, year = {2018}, url = {https://eprint.iacr.org/2018/151} }