Efficient identification schemes using two prover interactive proofs

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 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 languageAmerican English
Title of host publicationAdvances in Cryptology — CRYPTO 1989, Proceedings
EditorsGilles Brassard
PublisherSpringer Verlag
Pages498-506
Number of pages9
ISBN (Print)9780387973173
DOIs
StatePublished - 1990
EventConference on the Theory and Applications of Cryptology, CRYPTO 1989 - Santa Barbara, United States
Duration: 20 Aug 198924 Aug 1989

Publication series

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

Conference

ConferenceConference on the Theory and Applications of Cryptology, CRYPTO 1989
Country/TerritoryUnited States
CitySanta Barbara
Period20/08/8924/08/89

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.

Fingerprint

Dive into the research topics of 'Efficient identification schemes using two prover interactive proofs'. Together they form a unique fingerprint.

Cite this