This paper introduces the concept of interactive proofs of knowledge, extending the notion of interactive proofs of assertions to demonstrate that a prover can reveal no computational information while proving their knowledge of a solution to a computational problem. The authors define unrestricted input zero-knowledge proofs of knowledge, where the prover does not reveal any computational information, not even a single bit. They demonstrate the relevance of these proofs to identification schemes, where parties prove their identity without revealing any computational information. The paper presents a novel identification scheme that is provably secure if factoring is difficult and is significantly faster than RSA-based schemes. The scheme uses zero-knowledge proofs of knowledge, allowing the prover to convince the verifier of their knowledge without revealing it. The authors also discuss the advantages of using proofs of knowledge over proofs of assertions, providing two efficient variants of the scheme: one that does not require a directory and another based on parallel interactive proofs. The paper concludes with a detailed analysis of the security and efficiency of the proposed identification scheme.This paper introduces the concept of interactive proofs of knowledge, extending the notion of interactive proofs of assertions to demonstrate that a prover can reveal no computational information while proving their knowledge of a solution to a computational problem. The authors define unrestricted input zero-knowledge proofs of knowledge, where the prover does not reveal any computational information, not even a single bit. They demonstrate the relevance of these proofs to identification schemes, where parties prove their identity without revealing any computational information. The paper presents a novel identification scheme that is provably secure if factoring is difficult and is significantly faster than RSA-based schemes. The scheme uses zero-knowledge proofs of knowledge, allowing the prover to convince the verifier of their knowledge without revealing it. The authors also discuss the advantages of using proofs of knowledge over proofs of assertions, providing two efficient variants of the scheme: one that does not require a directory and another based on parallel interactive proofs. The paper concludes with a detailed analysis of the security and efficiency of the proposed identification scheme.