Impossibility and Feasibility Results for Zero Knowledge with Public Keys

DOI10.1007/11535218_9zbMATH Open1145.94456OpenAlexW1516766811MaRDI QIDQ5451023FDOQ5451023

Authors: Joël Alwen, Giuseppe Persiano, Ivan Visconti 

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

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• On round-optimal zero knowledge in the bare public-key model
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Automata, Languages and Programming

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)

Cited In (9)

• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Smooth zero-knowledge hash functions
• Title not available (Why is that?)
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• Individual simulations
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

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

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