Chain Reductions for Multi-signatures and the HBMS Scheme-Reference-Cited by-同舟云学术

Chain Reductions for Multi-signatures and the HBMS Scheme

Published:2021 Issue: Volume: Page:650-678
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bellare Mihir,Dai Wei

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-92068-5_22

Reference35 articles.

1. Lecture Notes in Computer Science;H Kılınç Alper,2021

2. Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 449–458. ACM Press, Oct. (2008)

3. Lecture Notes in Computer Science;M Bellare,2020

4. Bellare, M., Dai, W.: Chain reductions for multi-signatures and the HBMS scheme. Cryptology ePrint Archive, Report 2021/404 (2021)

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

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

1. Improving efficiency and security of Camenisch–Lysyanskaya signatures for anonymous credential systems;Computer Standards & Interfaces;2025-01

2. An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures;IACR Communications in Cryptology;2024-07-08

3. Twinkle: Threshold Signatures from DDH with Full Adaptive Security;Lecture Notes in Computer Science;2024

4. Toothpicks: More Efficient Fork-Free Two-Round Multi-signatures;Lecture Notes in Computer Science;2024

5. The Analysis of Schnorr Multi-Signatures and the Application to AI;Lecture Notes in Computer Science;2024