I want to use PAKE for key exchange between two parties (Alice and Bob) which share a low entropy secret (a password they exchanged on a piece of papers).
Alice and Bob use a software on there computer, and log in only occasionally.
Alice gives the password to Bob on a piece of paper, which Bob than (at home) inputs into the Software.
Now, if I would use for example J-PAKE, the password could only be verified at round 2.
The Problem is, if BOB inputs the wrong password because he makes a typo, I want to tell him that right away. The next time Alice logs in could be 24 hours or more later. For reasons of user-friendliness, giving Bob an error at that point is just to late.
Is what I want possible at all? Maybe with a different PAKE algorithm?
If the password would be compromised and could not be used afterwards anymore, that would be a price I would be willing to pay.