Perfect NIZK with Adaptive Soundness-Reference-Cited by-同舟云学术

Perfect NIZK with Adaptive Soundness

Published: Issue: Volume: Page:118-136
ISSN:
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Abe Masayuki,Fehr Serge

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70936-7_7.pdf

Reference34 articles.

1. Abe, M., Fehr, S.: Perfect NIZK with adaptive soundness. Cryptology ePrint Archive, Report, 2006/423 (2006), http://eprint.iacr.org

2. Adleman, L.M.: Two theorems on random polynomial time. In: 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos (1978)

3. Aiello, W., Håstad, J.: Perfect zero-knowledge languages can be recognized in two rounds. In: 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos (1987)

4. Lecture Notes in Computer Science;D. Beaver,1992

5. Lecture Notes in Computer Science;M. Bellare,2004

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

1. DARS: Empowering Trust in Blockchain-Based Real-World Applications with a Decentralized Anonymous Reputation System;Lecture Notes on Data Engineering and Communications Technologies;2024

2. Delegable zk-SNARKs with proxies;Frontiers of Computer Science;2023-12-23

3. Triply Adaptive UC NIZK;Advances in Cryptology – ASIACRYPT 2022;2022

4. Towards Witness Encryption Without Multilinear Maps;Information Security and Cryptology – ICISC 2021;2022

5. New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries;Information and Computation;2021-12