Efficient identification schemes using two prover interactive proofs

Michael Ben-Or; Shafi Goldwasser; Joe Kilimt; Avi Wigderson

doi:10.1007/0-387-34805-0_44

Efficient identification schemes using two prover interactive proofs

Michael Ben-Or, Shafi Goldwasser, Joe Kilimt, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

We present two efficient identification schemes based on the difficulty of solving the subset sum problem and the circuit satisfiability problem. Both schemes use the two prover model introduced by [BGKW], where the verifier (e.g the Bank) interacts with two untrusted provers (e.g two bank identification cards) who have jointly agreed on a strategy to convince the verifier of their identity. To believe the validity of their identity proving procedure, the verifier must make sure that the two provers can not communicate with each other during the course of the proof process. In addition to the simplicity and efficiency of the schemes, the resulting two prover interactive proofs can be shown to be perfect zero knowledge, making no intractability assumptions.

Original language	English
Title of host publication	Advances in Cryptology — CRYPTO 1989, Proceedings
Editors	Gilles Brassard
Publisher	Springer Verlag
Pages	498-506
Number of pages	9
ISBN (Print)	9780387973173
DOIs	https://doi.org/10.1007/0-387-34805-0_44
State	Published - 1990
Event	Conference on the Theory and Applications of Cryptology, CRYPTO 1989 - Santa Barbara, United States Duration: 20 Aug 1989 → 24 Aug 1989

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	435 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Conference on the Theory and Applications of Cryptology, CRYPTO 1989
Country/Territory	United States
City	Santa Barbara
Period	20/08/89 → 24/08/89

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.

Access to Document

10.1007/0-387-34805-0_44

Cite this

Ben-Or, M., Goldwasser, S., Kilimt, J., & Wigderson, A. (1990). Efficient identification schemes using two prover interactive proofs. In G. Brassard (Ed.), Advances in Cryptology — CRYPTO 1989, Proceedings (pp. 498-506). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 435 LNCS). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_44

Ben-Or, Michael ; Goldwasser, Shafi ; Kilimt, Joe et al. / Efficient identification schemes using two prover interactive proofs. Advances in Cryptology — CRYPTO 1989, Proceedings. editor / Gilles Brassard. Springer Verlag, 1990. pp. 498-506 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e15eb2cd75a14098b0efc89b42ed29ff,

title = "Efficient identification schemes using two prover interactive proofs",

abstract = "We present two efficient identification schemes based on the difficulty of solving the subset sum problem and the circuit satisfiability problem. Both schemes use the two prover model introduced by [BGKW], where the verifier (e.g the Bank) interacts with two untrusted provers (e.g two bank identification cards) who have jointly agreed on a strategy to convince the verifier of their identity. To believe the validity of their identity proving procedure, the verifier must make sure that the two provers can not communicate with each other during the course of the proof process. In addition to the simplicity and efficiency of the schemes, the resulting two prover interactive proofs can be shown to be perfect zero knowledge, making no intractability assumptions.",

author = "Michael Ben-Or and Shafi Goldwasser and Joe Kilimt and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; Conference on the Theory and Applications of Cryptology, CRYPTO 1989 ; Conference date: 20-08-1989 Through 24-08-1989",

year = "1990",

doi = "10.1007/0-387-34805-0_44",

language = "אנגלית",

isbn = "9780387973173",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "498--506",

editor = "Gilles Brassard",

booktitle = "Advances in Cryptology — CRYPTO 1989, Proceedings",

address = "גרמניה",

}

Ben-Or, M, Goldwasser, S, Kilimt, J & Wigderson, A 1990, Efficient identification schemes using two prover interactive proofs. in G Brassard (ed.), Advances in Cryptology — CRYPTO 1989, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 435 LNCS, Springer Verlag, pp. 498-506, Conference on the Theory and Applications of Cryptology, CRYPTO 1989, Santa Barbara, United States, 20/08/89. https://doi.org/10.1007/0-387-34805-0_44

Efficient identification schemes using two prover interactive proofs. / Ben-Or, Michael; Goldwasser, Shafi; Kilimt, Joe et al.
Advances in Cryptology — CRYPTO 1989, Proceedings. ed. / Gilles Brassard. Springer Verlag, 1990. p. 498-506 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 435 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient identification schemes using two prover interactive proofs

AU - Ben-Or, Michael

AU - Goldwasser, Shafi

AU - Kilimt, Joe

AU - Wigderson, Avi

PY - 1990

Y1 - 1990

N2 - We present two efficient identification schemes based on the difficulty of solving the subset sum problem and the circuit satisfiability problem. Both schemes use the two prover model introduced by [BGKW], where the verifier (e.g the Bank) interacts with two untrusted provers (e.g two bank identification cards) who have jointly agreed on a strategy to convince the verifier of their identity. To believe the validity of their identity proving procedure, the verifier must make sure that the two provers can not communicate with each other during the course of the proof process. In addition to the simplicity and efficiency of the schemes, the resulting two prover interactive proofs can be shown to be perfect zero knowledge, making no intractability assumptions.

AB - We present two efficient identification schemes based on the difficulty of solving the subset sum problem and the circuit satisfiability problem. Both schemes use the two prover model introduced by [BGKW], where the verifier (e.g the Bank) interacts with two untrusted provers (e.g two bank identification cards) who have jointly agreed on a strategy to convince the verifier of their identity. To believe the validity of their identity proving procedure, the verifier must make sure that the two provers can not communicate with each other during the course of the proof process. In addition to the simplicity and efficiency of the schemes, the resulting two prover interactive proofs can be shown to be perfect zero knowledge, making no intractability assumptions.

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

U2 - 10.1007/0-387-34805-0_44

DO - 10.1007/0-387-34805-0_44

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84990834089

SN - 9780387973173

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 498

EP - 506

BT - Advances in Cryptology — CRYPTO 1989, Proceedings

A2 - Brassard, Gilles

PB - Springer Verlag

T2 - Conference on the Theory and Applications of Cryptology, CRYPTO 1989

Y2 - 20 August 1989 through 24 August 1989

ER -

Ben-Or M, Goldwasser S, Kilimt J, Wigderson A. Efficient identification schemes using two prover interactive proofs. In Brassard G, editor, Advances in Cryptology — CRYPTO 1989, Proceedings. Springer Verlag. 1990. p. 498-506. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/0-387-34805-0_44

Efficient identification schemes using two prover interactive proofs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this