Method and apparatus for user identification based on permuted kernels.

摘要

A method and apparatus for identification of a prover to a verifier in which the prover demonstrates his knowledge of a secret permutation pi such that V pi ELEMENT K(A) for publicly known A and V where all the arithmetic operations are carried out modulo p. The actual proof does not reveal any knowledge of pi , and thus it cannot be misused by dishonest verifiers or eavesdroppers to later misrepresent themselves as the prover. The new scheme is much faster than the RSA and Fiat-Shamir identification schemes.