Scheme for authentication of at least one prover by a verifier

摘要: A new procedure for authentication of at least one prover by a verifier, the being based on public and secret key cryptographic techniques making use zero-knowledge protocol. In addition, this protocol is established using problem constrained linear equations finds applications in cryptography. This uses published matrix M dimension m×n where coefficients are chosen random from integers 0 to d-1, d generally prime number close square c. The "prover" authenticates itself "verifier" performing hashing functions randomly vector U m V n, results which called commitments sent prover. then chooses several predefined requests that verifier perform function. When receives result function, it compares with determine if has provided correct set responses. also can be repeated other vectors increased security.