Formulations and properties of proving possession of knowledge in interactive protocols are investigated. A four-move protocol for quadratic residuosity is proposed and a new notion of practical soundness is introduced based on its application to a cryptographic identification scheme. The role of cryptographic assumptions in arguments (i.e., computationally convincing proofs) of knowledge is also explored.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)