Network Security Question:

In 59.6 Eavesdropping and Server Database Reading we asserted that it is extremely difficult, without public key cryptography, to have an authentication scheme which protects against both eavesdropping Alice's password. Alice types her password (say fiddlesticks) to her workstation. The following exchange takes place: Alice,fiddlesticks Alice knows Z- hash of Alice's password computes Y- hash of fiddlesticks picks random R hash(YR) compares hash(Z,R) with received value Is this an example of an authentication scheme that isn't based on public key cryptography and yet guards against both eavesdropping and server database disclosure? In 59.6 Eavesdropping and Server Database Reading we asserted that it is extremely difficult, without public key cryptography, to have an authentication scheme which protects against both eavesdropping Alice's password. Alice types her password (say fiddlesticks) to her workstation. The following exchange takes place: Alice,fiddlesticks Alice knows Z- hash of Alice's password computes Y- hash of fiddlesticks picks random R hash(YR) compares hash(Z,R) with received value Is this an example of an authentication scheme that isn't based on public key cryptography and yet guards against both eavesdropping and server database disclosure