[11704] in cryptography@c2.net mail archive
Re: unforgeable optical tokens?
daemon@ATHENA.MIT.EDU (Perry E. Metzger)
Fri Sep 20 13:09:45 2002
To: Nelson Minar <nelson@monkey.org>
Cc: cryptography@wasabisystems.com
From: "Perry E. Metzger" <perry@piermont.com>
Date: 20 Sep 2002 13:04:39 -0400
In-Reply-To: <15755.21584.338763.275492@cabernet.nelson.monkey.org>
Nelson Minar <nelson@monkey.org> writes:
> More details are here:
> http://web.media.mit.edu/~pappu/htm/res/resPOWF.htm
> http://web.media.mit.edu/~pappu/htm/pubs/PappuPhDThesis01.pdf
>
> Ravi's PhD has a section on replay attacks - section 10.3, page 135.
> The claim there is you can't store all possible challenge/response
> pairs because the keyspace is too big and that the actual system is
> too complex to simulate.
But if you can't simulate the system, that implies that the challenger
has to have stored the challenge-response pairs because he can't just
generate them, right? That means that only finitely many are likely to
be stored. Or was this thought of too?
--
Perry E. Metzger perry@piermont.com
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
