scientific article; zbMATH DE number 176551

zbMATH Open0764.68042MaRDI QIDQ4035720FDOQ4035720

Authors: Dror Lapidot, Adi Shamir 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• A one-round, two-prover, zero-knowledge protocol for NP
• On the power of multi-prover interactive protocols
• Two prover protocols, low error at affordable rates
• On the Composition of Zero-Knowledge Proof Systems
• Fully parallelized multi-prover protocols for NEXP-time

zbMATH Keywords

soundnessHamiltonicityparallel two prover zero knowledge interactive proof for NP

Mathematics Subject Classification ID

Cryptography (94A60) Extremal problems in graph theory (05C35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (4)

• A one-round, two-prover, zero-knowledge protocol for NP
• Existence of 3-round zero-knowledge proof systems for NP
• Towards the parallel repetition conjecture
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035720)