On Multiparty Garbling of Arithmetic Circuits
Author:
Publisher
Springer International Publishing
Link
https://link.springer.com/content/pdf/10.1007/978-3-030-03332-3_1
Reference34 articles.
1. Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 120–129. IEEE Computer Society (2011)
2. Ball, M., Malkin, T., Rosulek, M.: Garbling gadgets for Boolean and arithmetic circuits. In: Proceedings of the 23rd Conference on Computer and Communications Security, ACM CCS, pp. 565–577 (2016)
3. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: PODC (1989)
4. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 503–513 (1990)
5. Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, 19–22 May 2013, pp. 478–492 (2013)
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards Practical Multi-key TFHE: Parallelizable, Key-Compatible, Quasi-linear Complexity;Lecture Notes in Computer Science;2024
2. Scalable Multiparty Garbling;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
3. Concretely efficient secure multi-party computation protocols: survey and more;Security and Safety;2022
4. Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling;Progress in Cryptology – LATINCRYPT 2021;2021
5. Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing;Applied Cryptography and Network Security;2019
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3