3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge

DOI10.1007/978-3-540-92182-0_55zbMath1183.94029OpenAlexW2157568248MaRDI QIDQ3596756

Giovanni Di Crescenzo, Helger Lipmaa

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_55

zbMATH Keywords

zero-knowledge argumentsresettable zero-knowledgebare public-key model for zero-knowledge protocolsresettable soundness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (1)

Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

This page was built for publication: 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge