Characterizing deterministic-prover zero knowledge

DOI10.1007/978-3-030-64375-1_19MaRDI QIDQ2055736zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Arka Rai Choudhuri

Publication date 1 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-64375-1_19

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Cited in

(4)

• Provably Hard Zero-Way Functions
• Explainable arguments
• Resettable statistical zero-knowledge for NP
• (Commit-and-prove) predictable arguments with privacy

This page was built for publication: Characterizing deterministic-prover zero knowledge

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