On the length of cryptographic hash-values used in identification schemes
Authors:
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 202-215
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)2001
- Efficient Identification and Signatures for Smart Cards2001
- An alternative to the Fiat-Shamir protocolLecture Notes in Computer Science, 1990
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory1988
- An efficient solution of the congruencex^2 + ky^2 = mpmod{n}IEEE Transactions on Information Theory, 1987
- The knowledge complexity of interactive proof-systems1985