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

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

  • Published:2018-08-20 Issue:4 Volume:28 Page:573-616
  • ISSN:1016-3328
  • Container-title:computational complexity
  • language:en
  • Short-container-title:comput. complex.

Author:

Applebaum Benny,Raykov Pavel

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Reference41 articles.

1. Shweta Agrawal, Yuval Ishai, Dakshita Khurana & Anat Paskin-Cherniavsky (2015). Statistical Randomized Encodings: A Complexity Theoretic View. In Automata, Languages, and Programming—42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015, Proceedings, Part I, Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi & Bettina Speckmann, editors, volume 9134 of Lecture Notes in Computer Science, 1–13. Springer. ISBN 978-3-662-47671-0. http://dx.doi.org/10.1007/978-3-662-47672-7_1

2. William Aiello & Johan Håstad (1987). Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds. In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27–29 October 1987, 439–448. IEEE Computer Society. ISBN 0-8186-0807-2. http://dx.doi.org/10.1109/SFCS.1987.47

3. Applebaum, Benny: Cryptography in Constant Parallel Time. Springer, Information Security and Cryptography (2014). ISBN 978-3-642-17366-0. http://dx.doi.org/10.1007/978-3-642-17367-7

4. Benny Applebaum (2017). Garbled Circuits as Randomized Encodings of Functions: a Primer. In Tutorials on the Foundations of Cryptography., Yehuda Lindell, editor, 1–44. Springer International Publishing. ISBN 978-3-319-57047-1. https://doi.org/10.1007/978-3-319-57048-8_1

5. Benny Applebaum, Yuval Ishai & Eyal Kushilevitz (2004). Cryptography in $$\text{NC}^{0}$$ NC 0 . In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17–19 October 2004, Rome, Italy, Proceedings, 166–175. IEEE Computer Society. ISBN 0-7695-2228-9. http://dx.doi.org/10.1109/FOCS.2004.20

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

1. Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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