On the Round Complexity of OT Extension-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Round Complexity of OT Extension

Published:2018 Issue: Volume: Page:545-574
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Garg Sanjam,Mahmoody Mohammad,Masny Daniel,Meckler Izaak

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96878-0_19

Reference45 articles.

1. Lecture Notes in Computer Science;W Aiello,2001

2. Lecture Notes in Computer Science;G Asharov,2012

3. Lecture Notes in Mathematics;D Aldous,1983

4. Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, Berlin, Germany, 4–8 November 2013, pp. 535–548. ACM Press (2013)

5. Lecture Notes in Computer Science;G Asharov,2015

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower-Bounds on Public-Key Operations in PIR;Lecture Notes in Computer Science;2024

2. Benchmarking the Setup of Updatable Zk-SNARKs;Progress in Cryptology – LATINCRYPT 2023;2023

3. Updatable NIZKs from Non-Interactive Zaps;Cryptology and Network Security;2022

4. An Algebraic Framework for Universal and Updatable SNARKs;Advances in Cryptology – CRYPTO 2021;2021

5. New Constructions of Hinting PRGs, OWFs with Encryption, and More;Advances in Cryptology – CRYPTO 2020;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP