Impossibility and Feasibility Results for Zero Knowledge with Public Keys

DOI10.1007/11535218_9zbMath1145.94456OpenAlexW1516766811MaRDI QIDQ5451023

Ivan Visconti, Joël Alwen, Giuseppe Persiano

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Smooth zero-knowledge hash functions ⋮ Individual simulations

This page was built for publication: Impossibility and Feasibility Results for Zero Knowledge with Public Keys