1. Michel Boyer, Gilles Brassard, Peter HØyer and Alain Tapp, “Tight bounds on quantum searching”, Proceedings of Fourth Workshop on Physics and Computation — PhysComp '96, November 1996, pp. 36–43. Final version to appear in Fortschritte Der Physik.
2. Gilles Brassard, David Chaum and Claude Crépeau, “Minimum disclosure proofs of knowledge”, Journal of Computer and System Sciences, Vol. 37, no. 2, October 1988, pp. 156–189.
3. Gilles Brassard and Peter HØyer, “An exact quantum polynomial-time algorithm for Simon's problem”, Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems — ISTCS '97, June 1997, IEEE Computer Society Press, pp. 12–23.
4. J. Larry Carter and Mark N. Wegman, “Universal classes of hash functions”, Journal of Computer and System Sciences, Vol. 18, no. 2, 1979, pp. 143–154.
5. Shafi Goldwasser, Silvio Micali and Ronald L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks”, SIAM Journal on Computing, Vol. 17, 1988, pp. 281–308.