On the Efficiency of One-Time Digital Signatures
暂无分享,去创建一个
[1] David Chaum,et al. Provably Unforgeable Signatures , 1992, CRYPTO.
[2] de Ng Dick Bruijn,et al. On the set of divisors of a number , 1951 .
[3] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[4] Ueli Maurer,et al. Directed Acyclic Graphs, One-way Functions and Digital Signatures , 1994, CRYPTO.
[5] Ueli Maurer,et al. Optimal Tree-Based One-Time Digital Signature Schemes , 1996, STACS.
[6] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[7] Abraham Bookstein,et al. Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .
[8] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[9] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[10] Serge Vaudenay. One-Time Identification with Low Memory , 1993 .
[11] Stephen M. Matyas,et al. Cryptography: A New Dimension in Computer Data Security--A Guide for the Design and Implementation of Secure Systems , 1982 .
[12] Silvio Micali,et al. On-Line/Off-Line Digital Schemes , 1989, CRYPTO.
[13] Claus-Peter Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1990, EUROCRYPT.