Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length-Reference-Cited by-同舟云学术

Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length

Published: Issue: Volume: Page:367-391
ISSN:0302-9743
Container-title:Pairing-Based Cryptography – Pairing 2007
language:
Short-container-title:

Author:

Huang Xinyi,Mu Yi,Susilo Willy,Wu Wei

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73489-5_21.pdf

Reference43 articles.

1. Lecture Notes in Computer Science;J. Boyar,1991

2. Lecture Notes in Computer Science;D. Boneh,2001

3. Biehl, I., Paulus, S., Takagi, T.: Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. In: Designs, Codes and Cryptography, vol. 31(2), pp. 99–123. Springer, Netherlands (2004)

4. Lecture Notes in Computer Science;D. Chaum,1990

5. Lecture Notes in Computer Science;D. Chaum,1991

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

1. A Note on the Invisibility and Anonymity of Undeniable Signature Schemes;Information Security Applications;2020

2. Security-Mediated Certificateless Undeniable Signature Scheme;Advances in Intelligent Systems and Computing;2018-09-29

3. Cryptanalysis of an Identity-Based Convertible Undeniable Signature Scheme;Lecture Notes in Computer Science;2017

4. Provably secure strong designated verifier signature scheme based on coding theory;International Journal of Communication Systems;2016-07-21

5. Efficient strong designated verifier signature schemes without random oracle or with non-delegatability;International Journal of Information Security;2011-08-24