1. Arora, S.: Probabilistic Checking of Proofs and Hardness of Approximation Problems. PhD Thesis, CS Division, UC Berkeley (August 1994)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computing. In: Proc. ACM STOC 1988, pp. 1–10. ACM Press, New York (1988)
3. Lecture Notes in Computer Science;M. Burmester,1998
4. Dolev, D.: The Byzantine generals strike again. J. of Algorithms 3, 14–30 (1982)
5. Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. of the ACM 40(1), 17–47 (1993)