The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-64378-2_20
Reference55 articles.
1. Agrawal, S.: Verifiable secret sharing in a total of three rounds. Inf. Process. Lett. 112(22), 856–859 (2012). https://doi.org/10.1016/j.ipl.2012.08.003
2. Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Round-optimal secure multiparty computation with honest majority. In: Advances in Cryptology - CRYPTO 2018–38th Annual International Cryptology Conference Proceedings, Part II. pp. 395–424, Santa Barbara, CA, USA, August 19–23 (2018)
3. Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. In: Advances in Cryptology - EUROCRYPT 2019–38th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, Part II. pp. 532–561, Darmstadt, Germany, May 19–23(2019)
4. Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. In: Theory of Cryptography - 16th International Conference Proceedings, Part I. TCC 2018, pp. 152–174, Panaji, India, November 11–14 (2018)
5. Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious MPC. In: Advances in Cryptology - EUROCRYPT 2019–38th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, Part II. pp. 504–531, Darmstadt, Germany, May 19–23(2019)
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Round Complexity of Statistical MPC with Optimal Resiliency;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience;Journal of Cryptology;2023-03-25
3. Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs;Theory of Cryptography;2023
4. Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority;Advances in Cryptology – CRYPTO 2022;2022
5. Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security;Theory of Cryptography;2022
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3