Efficient Information Theoretic Multi-party Computation from Oblivious Linear Evaluation
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-20074-9_7
Reference13 articles.
1. Lecture Notes in Computer Science;D Beaver,1992
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988. ACM, New York (1988)
3. Lecture Notes in Computer Science;JC Benaloh,1987
4. Corniaux, C.L.F., Ghodosi, H.: An entropy-based demonstration of the security of Shamir’s secret sharing scheme. In: 2014 International Conference on Information Science, Electronics and Electrical Engineering, vol. 1, pp. 46–48, April 2014
5. Lecture Notes in Computer Science;Y-C Chang,2001
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information;Proceedings of Seventh International Congress on Information and Communication Technology;2022-07-27
2. Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results;Journal of Computer Science and Technology;2022-03-31
3. Secure Multi-Party Computation Using Pre-distributed Information from an Initializer;Communications in Computer and Information Science;2021
4. Cryptonomial: A Framework for Private Time-Series Polynomial Calculations;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3