A fast signature scheme based on new on-line computation
From MaRDI portal
Publication:3404397
DOI10.1007/10958513_9zbMATH Open1185.94063OpenAlexW1766160141MaRDI QIDQ3404397FDOQ3404397
Authors: Takeshi Okamoto, Hirofumi Katsuno, Eiji Okamoto
Publication date: 9 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/10958513_9
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (7)
- Title not available (Why is that?)
- Cryptanalysis of the OTM signature scheme from FC'02
- Development of a sigma-lognormal representation for on-line signatures
- An improved fast signature scheme without online multiplication
- Online/offline verification of short signatures
- The GPS Identification Scheme Using Frobenius Expansions
- Title not available (Why is that?)
This page was built for publication: A fast signature scheme based on new on-line computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404397)