One-Time Identification with Low Memory

• Presented at: EUROCODE'92, Udine, Italy, October 27-30, 1992
• Published in: EUROCODE'92, vol. 3, p. 217-228
• Series: CISM Courses and Lectures, International Centre for Mechanical Sciences 339
• Berlin: Springer, 1993

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.

Reference

• LASEC-CONF-2007-047
• doi:10.1007/978-3-7091-2786-5_19

Record created on 2007-01-22, modified on 2017-06-21