Untrapable password entry in the form of a solution graph. puzzles?

Question

Passwords

Some time ago I saw a message about the development of a password entry method that cannot be intercepted either by keyloggers or even by a video capture from the screen - the point is that the user needs to solve a simple puzzle, but watching the password enterer will not be able to restore the logic of the solution and enter the password with his try.
I didn’t manage to google, apparently due to the prevalence of the words I googled. Perhaps one of you can provide a link to the material? Thank you!

Answer 1

There, if I remember correctly, it was necessary to connect the vertices of the graph. The authors of the method proved that it is impossible for an observer to reverse it. I think they even patented it.

Answer 2

I remember one idea. The screen displays a lot of different pictures in random order.
The user password consists of two memorized pictures.
Entering the password, the user must select a picture in the middle of the two memorized ones.