In
cryptography, the
Feige–Fiat–Shamir identification scheme is a type of parallel
zero-knowledge proof developed by
Uriel Feige,
Amos Fiat, and
Adi Shamir in 1988. Like all zero-knowledge proofs, it allows one party, Peggy, to prove to another party, Victor, that she possesses secret information without revealing to Victor what that secret information is. The Feige–Fiat–Shamir identification scheme, however, uses
modular arithmetic and a parallel verification process that limits the number of communications between Peggy and Victor.