An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions Joe KilianErez Petrank OriginalPaper 01 January 1998 Pages: 1 - 27
A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems Kouichi SakuraiHiroki Shizuya OriginalPaper 01 January 1998 Pages: 29 - 43
Attacks on Fast Double Block Length Hash Functions Lars R. KnudsenXuejia LaiBart Preneel OriginalPaper 01 January 1998 Pages: 59 - 72