A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement-Reference-Cited by-同舟云学术

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

A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement

Published:2019 Issue: Volume: Page:111-130
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Friolo Daniele,Masny Daniel,Venturi Daniele

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-36030-6_5

Reference54 articles.

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

2. Alekhnovich, M.: More on average case vs approximation complexity. In: IEEE FOCS, pp. 298–307 (2003)

3. Lecture Notes in Computer Science;P Ananth,2017

4. Lecture Notes in Computer Science;S Badrinarayanan,2018

5. Lecture Notes in Computer Science;M Bellare,1993

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

1. Round-Optimal Oblivious Transfer and MPC from Computational CSIDH;Lecture Notes in Computer Science;2023

2. Reusable Secure Computation in the Plain Model;Advances in Cryptology – CRYPTO 2023;2023

3. Round-Optimal Black-Box MPC in the Plain Model;Advances in Cryptology – CRYPTO 2023;2023

4. Minicrypt Primitives with Algebraic Structure and Applications;Journal of Cryptology;2022-12-01

5. Knowledge Encryption and Its Applications to Simulatable Protocols with Low Round-Complexity;Advances in Cryptology – ASIACRYPT 2022;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP