| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429258 | Information Processing Letters | 2006 | 7 Pages |
Abstract
In this paper, we present an improved Dwork–Naor 2-round timed deniable authentication scheme with reduced computational and communication complexity. The improved protocol is convenient for authenticating arbitrarily large files (e.g., the contents of a large data-base or a large software), and its first message (from the verifier to the authenticator) is independent on the message to be authenticated by the authenticator.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
