1. Ben-Or M, Goldwasser S, Kilian J, Wigderson A (1988a) Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the 20th annual ACM symposium on theory of computing, Chicago, IL. ACM, New York, pp 113–122
2. Ben-Or M, Goldwasser S, Wigderson A (1988b) Completeness theorems for fault-tolerant distributed computing. In: Proceedings of the 20th ACM symposium on theory of computing, Chicago, 1988. ACM, New York, pp 1–10
3. Blum M (1982) Coin flipping by telephone. In: Gersho A (ed) Advances in cryptography. University of California, Santa Barbara, pp 11–15
4. Brassard G, Crépeau C, Jozsa R, Langlois D (1993) A quantum bit commitment scheme provably unbreakable by both parties. In: Twenty-ninth symposium on foundations of computer science. IEEE, Piscataway, pp 42–52
5. Brassard G, Chaum D, Crépeau C (1998) Minimum disclosure proofs of knowledge. J Comput Syst Sci 37:156–189