1. L. Adleman and K. Kompella. Fast Checkers for Cryptography. In A. J. Menezes and S. Vanstone, editors, Advances in Cryptology — Crypto '90, pages 515–529, Berlin, 1990. Springer-Verlag. Lecture Notes in Computer Science No. 537.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proc. 33rd Annual Symposium on Foundations of Computer Science, pages 14–23. IEEE, 1992.
3. M. Bellare, J. Garay, and T. Rabin. Distributed Pseudo-Random Bit Generators—A New Way to Speed-Up Shared Coin Tossing. In Proceedings Fifteenth Annual Symposium on Principles of Distributed Computing, pages 191–200. ACM, 1996.
4. M. Beller and Y. Yacobi. Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications. In R. Rueppel, editor, Advances in Cryptology — Eurocrypt '92, pages 208–220, Berlin, 1992. Springer-Verlag. Lecture Notes in Computer Science No. 658.
5. E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.