Secure Distributed Linear Algebra in a Constant Number of Rounds
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-44647-8_7
Reference25 articles.
1. J. Bar-Ilan, D. Beaver: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, Proc. ACM PODC’ 89, pp. 201–209, 1989.
2. D. Beaver, S. Micali, P. Rogaway: The Round Complexity of Secure Protocols, Proc. 22nd ACM STOC, pp. 503–513, 1990.
3. Lect Notes Comput Sci;D. Beaver,2000
4. A. Beimel, A. Gál: On Arithmetic Branching Programs, J. Comp. & Syst. Se, 59, pp. 195–220, 1999.
5. M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proc. ACM STOC’ 88, pp. 1–10, 1988.
Cited by 39 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Secure Multi-Party Linear Algebra with Perfect Correctness;IACR Communications in Cryptology;2024-04-09
2. Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice;Proceedings of the ACM Asia Conference on Computer and Communications Security;2023-07-10
3. Threshold Private Set Intersection with Better Communication Complexity;Lecture Notes in Computer Science;2023
4. Privacy-Preserving Multi-Robot Task Allocation via Secure Multi-Party Computation;2022 European Control Conference (ECC);2022-07-12
5. Secure Distributed Matrix Computation With Discrete Fourier Transform;IEEE Transactions on Information Theory;2022-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3