1. N. Barić, and B. Pfitzmann. Collision-free accumulators and Fail-stop signature schemes without trees. In Advances in Cryptology — Eurocrypt’ 97, LNCS vol. 1233, Springer, 1997, pages 480–494.
2. M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In 1st Conf. on Computer and Communications Security, ACM, pages 62–73, 1993.
3. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures: How to Sign with RSA and Rabin. In Advances in Cryptology — Eurocrypt’ 96, LNCS vol. 1070, Springer-Verlag, 1996, pages 399–416.
4. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156–189, 1988.
5. R. Canetti, O. Goldreich and S. Halevi. The Random Oracle Methodology, Revisited. STOC’ 98, ACM, 1998, pages ???-???.