... proofsystems and the notion of zero-knowledge (ZK) proofs were formalized in 1985 by Gold-wasser, Micali, and Rackoff [481] in the context of an interactive proof of membership of a string x in a language ... maximal and equals the base-2 loga-rithm of the number of possible passwords. Handbook of Applied Cryptography by A. Menezes, P. van Oorschot and S. Vanstone.§10.3 Challenge-response identification ... attacks,55Both chosen-ciphertext and chosen-plaintext attacks are of concern for challenge-response techniques basedon symmetric-key encryption. Handbook of Applied Cryptography by A. Menezes,...