k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits-Reference-Cited by-同舟云学术

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

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

Published:2018 Issue: Volume: Page:500-532
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2018
language:
Short-container-title:

Author:

Benhamouda Fabrice^ORCID,Lin Huijia

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-78375-8_17

Reference46 articles.

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

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

3. Lecture Notes in Computer Science;S Badrinarayanan,2016

4. Lecture Notes in Computer Science;B Barak,2001

5. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp. 503–513. ACM Press, May 1990

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

1. On the Communication Complexity of Secure Multi-Party Computation With Aborts;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Time Is Money, Friend! Timing Side-Channel Attack Against Garbled Circuit Constructions;Lecture Notes in Computer Science;2024

3. R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications;Lecture Notes in Computer Science;2024

4. Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate;Lecture Notes in Computer Science;2024

5. mrNISC from LWE with polynomial modulus;Information and Computation;2023-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3