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.
|Title of host publication
|Advances in Cryptology — CRYPTO 1989, Proceedings
|Number of pages
|Published - 1990
|Conference on the Theory and Applications of Cryptology, CRYPTO 1989 - Santa Barbara, United States
Duration: 20 Aug 1989 → 24 Aug 1989
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|Conference on the Theory and Applications of Cryptology, CRYPTO 1989
|20/08/89 → 24/08/89
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.