Galindo-Garcia Identity-Based Signature Revisited-Reference-Cited by-同舟云学术

Galindo-Garcia Identity-Based Signature Revisited

Published:2013 Issue: Volume: Page:456-471
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chatterjee Sanjit,Kamath Chethan,Kumar Vikas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-37682-5_32

Reference20 articles.

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

2. Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 390–399. ACM, New York (2006)

3. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, CCS 1993, pp. 62–73. ACM, New York (1993)

4. Boldyreva, A., Palacio, A., Warinschi, B.: Secure proxy signature schemes for delegation of signing rights. Journal of Cryptology 25, 57–115 (2012)

5. Lecture Notes in Computer Science;D. Boneh,2004

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

1. Pairing-Free ID-Based Signatures as Secure as Discrete Logarithm in AGM;Lecture Notes in Computer Science;2024

2. Toward Tight Security of the Galindo–Garcia Identity-based Signature;Interdisciplinary Information Sciences;2023

3. A Tightly Secure ID-Based Signature Scheme Under DL Assumption in AGM;Information Security and Privacy;2023

4. Look Before You Leap: Secure Connection Bootstrapping for 5G Networks to Defend Against Fake Base-Stations;Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security;2021-05-24

5. A Provably Secure Scalable Revocable Identity-Based Signature Scheme Without Bilinear Pairings;Security with Intelligent Computing and Big-data Services;2019-04-17