Feige-Fiat-Shamir identification scheme

Feige-Fiat-Shamir identification scheme
Name	Feige–Fiat–Shamir identification scheme
Type	Cryptographic identification protocol
Introduced	1988
Inventors	Amos Feige, Adi Shamir, Uriel Fiat
Field	Public-key cryptography
Related	Schnorr identification protocol, Fiat–Shamir heuristic, Zero-knowledge proof, RSA

Feige-Fiat-Shamir identification scheme is an interactive cryptographic identification protocol introduced in 1988 by Amos Feige, Adi Shamir, and Uriel Fiat that enables a prover to authenticate to a verifier without revealing a secret. The scheme relies on modular arithmetic and hardness assumptions tied to integer factorization and has influenced later work in zero-knowledge proofs, digital signatures, and authentication systems. It played a role in shaping research at institutions such as the Weizmann Institute, Massachusetts Institute of Technology, and Bell Labs during the late 20th century.

Introduction

The protocol emerged amid contemporaneous developments in public-key cryptography at Bell Labs, Massachusetts Institute of Technology, Weizmann Institute of Science, Stanford University, and University of California, Berkeley where researchers like Ron Rivest, Adi Shamir, Leonard Adleman, Shafi Goldwasser, and Silvio Micali explored identification and zero-knowledge concepts. It was presented alongside advances exemplified by RSA (cryptosystem), DES, and work that led to the NIST standards movement. The scheme's designers sought an efficient, non-interactive-friendly identification primitive compatible with smart cards and constrained devices developed in industry laboratories such as IBM, Intel, and Siemens.

Mathematical Foundations

The security and correctness depend on number-theoretic constructs familiar from RSA (cryptosystem), Euler's totient theorem, and properties of quadratic residues used in the Goldwasser–Micali cryptosystem and analyses by Don Coppersmith and Michael O. Rabin. Let n be a composite modulus whose factorization relates to problems studied by Carl Friedrich Gauss and modern algorithmic number theory from research groups at European Organisation for Nuclear Research and University of Cambridge. Key elements include modular squaring, multiplicative inverses in Z_n^*, and assumptions comparable to the intractability underpinning algorithms investigated by Peter Shor and integer factorization methods pioneered by John Pollard and Carl Pomerance. Security reductions reference complexity-theoretic frameworks used by Oded Goldreich and Silvio Micali.

Protocol Description

Setup: a trusted setup or trusted-key-generation phase echoes practices from RSA (cryptosystem) key generation at institutions such as MIT and Stanford. The prover selects secret values and publishes public commitments derived by squaring modulo n, paralleling commitments in constructions used by David Chaum and Moni Naor. Authentication proceeds through repeated challenge–response rounds similar in spirit to interactive proofs introduced by Goldwasser–Micali–Rackoff and later formalized in work by László Babai and Shafi Goldwasser. Each round uses random challenges from the verifier, drawn analogously to randomness sources studied by Donald Knuth and Leslie Lamport in secure protocol design. The verifier checks congruences using arithmetic methods related to algorithms by Eric Bach and Andrew Odlyzko.

Security Properties and Proofs

The protocol achieves a form of zero-knowledge under the honest-verifier model, reflecting theoretical frameworks developed by Shafi Goldwasser, Silvio Micali, and Charles Rackoff. Soundness reduces to the difficulty of extracting square roots modulo composites, a hardness linked to factorization research by R. P. Brent and H. W. Lenstra Jr.. Impersonation probabilities decrease exponentially with the number of rounds, a combinatorial analysis method used by Richard Karp and Michael Rabin. Formal proofs employ simulation techniques from the literature of Oded Goldreich and hardness assumptions comparable to those in analyses by Moni Naor and Ronald Rivest.

Implementation and Performance Considerations

Practical deployments consider constraints of smart-card platforms from Gemalto and embedded environments influenced by processors from Intel and ARM Holdings. Performance metrics measure modular exponentiation costs characterized in work by Mihir Bellare and Philippe Flajolet, with fast algorithms like Montgomery multiplication attributed to Peter L. Montgomery reducing latency. Key storage, randomness generation, and side-channel mitigation reference engineering practices from Jean-Jacques Quisquater and countermeasures studied at Cryptographic Hardware and Embedded Systems (CHES) conferences. Implementation choices weigh trade-offs similarly to optimizations in Secure Hash Standard and elliptic-curve deployments promoted by Certicom and SECG.

Variants and Extensions

Extensions include non-interactive transforms via the Fiat–Shamir heuristic popularized in contexts related to Thomas H. Cormen-style algorithmic frameworks and later formalized by researchers at University of California, Berkeley and European Research Consortium. Variants adapt the protocol to work with elliptic-curve groups studied by Neal Koblitz and Victor S. Miller, and to lattice-based settings explored by Oded Regev and Chris Peikert for post-quantum resilience, paralleling transitions seen in research by Daniel J. Bernstein. Threshold and multi-party adaptations draw on techniques from Andrew Yao and Yao's Millionaires' Problem-inspired secure computation, while composition with digital-signature schemes reflects integrations seen with DSS and ECDSA research.

Applications and Practical Use Cases

Historically targeted at smart-card authentication in telecommunications companies like Nokia and financial systems influenced by Mastercard and Visa, the scheme also informed anonymity systems researched by David Chaum and identity protocols evaluated by IETF working groups. Use cases span access control deployments in enterprises such as Microsoft and Oracle Corporation, and prototype anonymous credential systems explored at Carnegie Mellon University and ETH Zurich. Academic testbeds at MIT Media Lab and Stanford Computer Science used the scheme to demonstrate low-overhead authentication in sensor networks and Internet-of-Things scenarios, echoing later standards activity at IETF and IEEE.

Category:Cryptographic protocols