Adaptive Proofs of Knowledge in the Random Oracle Model-Reference-Cited by-同舟云学术

Adaptive Proofs of Knowledge in the Random Oracle Model

Published:2015 Issue: Volume: Page:629-649
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bernhard David,Fischlin Marc,Warinschi Bogdan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46447-2_28

Reference52 articles.

1. Abe, M.: Combining Encryption and Proof of Knowledge in the Random Oracle Model. The Computer Journal 47(1), 58–70 (2004)

2. Lecture Notes in Computer Science;M Abdalla,2001

3. Adida, B.: Helios: web-based open-audit voting. In: 17th USENIX security symposium, pp. 335–348. Helios website (2008). http://heliosvoting.org paper: http://www.usenix.org/events/sec08/tech/full_papers/adida/adida.pdf

4. Bagherzandi, A., Cheaon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: CCS 2008, pp. 449–458. ACM press (2008)

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

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

1. Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors;Journal of Cryptology;2023-05-25

2. Group signatures and more from isogenies and lattices: generic, simple, and efficient;Designs, Codes and Cryptography;2023-02-27

3. Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions;Advances in Cryptology – ASIACRYPT 2023;2023

4. Towards Data Redaction in Bitcoin;IEEE Transactions on Network and Service Management;2022-12

5. Practical dynamic group signatures without knowledge extractors;Designs, Codes and Cryptography;2022-10-18