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

Kouichi Sakurai

doi:10.1016/S0304-3975(96)00277-0

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

Kouichi Sakurai

Mathematical Informatics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	317-335
Number of pages	19
Journal	Theoretical Computer Science
Volume	181
Issue number	2
DOIs	https://doi.org/10.1016/S0304-3975(96)00277-0
Publication status	Published - Jul 30 1997

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/S0304-3975(96)00277-0

Cite this

@article{24309ca99d904bdeab99da22efd04f12,

title = "Practical proofs of knowledge without relying on theoretical proofs of membership on languages",

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.",

author = "Kouichi Sakurai",

year = "1997",

month = jul,

day = "30",

doi = "10.1016/S0304-3975(96)00277-0",

language = "English",

volume = "181",

pages = "317--335",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

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

AU - Sakurai, Kouichi

PY - 1997/7/30

Y1 - 1997/7/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0346580334&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346580334&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(96)00277-0

DO - 10.1016/S0304-3975(96)00277-0

M3 - Article

AN - SCOPUS:0346580334

SN - 0304-3975

VL - 181

SP - 317

EP - 335

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this