On the efficiency of one-time digital signatures-Reference-Cited by-同舟云学术

On the efficiency of one-time digital signatures

Published:1996 Issue: Volume: Page:145-158
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bleichenbacher Daniel,Maurer Ueli

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0034843

Reference14 articles.

1. Lecture Notes in Computer Science;D. Bleichenbacher,1994

2. D. Bleichenbacher and U.M. Maurer, Optimal tree-based one-time digital signature schemes, Proc. 13th Symp. on Theoretical Aspects of Computer Science (STACS'96), C. Puech and R. Reischuk (eds.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1046, pp. 363–374, 1996.

3. Lecture Notes in Computer Science;J.N.E. Bos,1993

4. N. de Brujin, C. A. van Ebbenhorst Tengebergen, and D. R. Kruyswijk, “On the set of divisors of a number,” Nieuw Arch. Wisk, vol. 23, pp. 191–193, 1952.

5. Lecture Notes in Computer Science;S. Even,1990

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

1. Quantum-defended Digital Signature on Lattice for IoT-enabled Systems;Lecture Notes in Networks and Systems;2023

2. Efficient Zero-Knowledge Arguments for Matrix Relations over Rings and Non-malleable Enhancement;Provable and Practical Security;2023

3. Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to $$\text {SPHINCS}^+$$ and XMSS;Advances in Cryptology – CRYPTO 2023;2023

4. Practical Constant-Size Ring Signature;Journal of Computer Science and Technology;2018-05

5. Asymptotically Efficient Lattice-Based Digital Signatures;Journal of Cryptology;2017-10-30