Practical proofs of knowledge without relying on theoretical proofs of membership on languages

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)317-335
Number of pages19
JournalTheoretical Computer Science
Volume181
Issue number2
DOIs
Publication statusPublished - Jul 30 1997

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this