One-time identification with low memory
From MaRDI portal
Recommendations
- An extremely small and efficient identification scheme
- Short one-time signatures
- Designing identification schemes with keys of short size
- On the security of a practical identification scheme
- On the security of a practical identification scheme
- Capacity/Storage Tradeoff in High-Dimensional Identification Systems
- One-time programs with limited memory
- A new ID-based identification scheme
Cited in
(5)- An efficient post-quantum one-time signature scheme
- One-time password tree
- Public Key Authentication with Memory Tokens
- Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
- At the top of the hypercube -- better size-time tradeoffs for hash-based signatures
This page was built for publication: One-time identification with low memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276338)