One-Time Identification with Low Memory

In this paper, a practical cryptosystem based on an authentication tree is described. It is an extension of Ralph Merkle's results. The security of the system depends on assumptions on a one-way function . This cryptosystem allows to make interactive proofs of knowledge using keys only once. Thus, it can be used to prove one's identity or to sign some message. Moreover, we can use it to achieve an electronic cash system. A very efficient implementation can be done on a low-cost smart card. This cryptosystem is thus an alternative to the zero-knowledge algorithms.


Editor(s):
Camion, P.
Charpin, P.
Harari, S.
Published in:
EUROCODE'92, 3, 217-228
Presented at:
EUROCODE'92, Udine, Italy, October 27-30, 1992
Year:
1993
Publisher:
Berlin, Springer
ISBN:
978-3-211-82519-8
Laboratories:




 Record created 2007-01-22, last modified 2018-03-17

n/a:
Vau93b - Download fulltextPS
Vau93b_2 - Download fulltextEPS
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)