New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust-Reference-Cited by-同舟云学术

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust

Published:2020 Issue: Volume: Page:674-703
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2020
language:
Short-container-title:

Author:

Ball Marshall,Dachman-Soled Dana,Kulkarni Mukul

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-56877-1_24

Reference65 articles.

1. Ananth, P., Deshpande, A., Kalai, Y.T., Lysyanskaya, A.: Fully homomorphic NIZK and NIWI proofs. Cryptology ePrint Archive, Report 2019/732 (2019). https://eprint.iacr.org/2019/732

2. Information Security and Cryptography;B Applebaum,2014

3. Applebaum, B., Raykov, P.: On the relationship between statistical zero-knowledge and statistical randomized encodings. In: Robshaw and Katz [63], pp. 449–477

4. Badrinarayan, S., Fernando, R., Jain, A., Khurana, D., Sahai, A.: Statistical ZAP arguments. Cryptology ePrint Archive, Report 2019/780 (2019). https://eprint.iacr.org/2019/780

5. Ball, M., Dachman-Soled, D., Kulkarni, M.: New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions and interaction. Cryptology ePrint Archive, Report 2019/1464 (2019). https://eprint.iacr.org/2019/1464

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

1. Fine-grained polynomial functional encryption;Theoretical Computer Science;2024-10

2. Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions;Lecture Notes in Computer Science;2024

3. Fine-Grained Secure Attribute-Based Encryption;Journal of Cryptology;2023-08-03

4. Unconditionally Secure NIZK in the Fine-Grained Setting;Advances in Cryptology – ASIACRYPT 2022;2022

5. Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security;Advances in Cryptology – EUROCRYPT 2022;2022