Concurrent zero knowledge in the public-key model

DOI10.1007/11523468_66MaRDI QIDQ5716830zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Ivan Visconti

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network protocols (68M12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• 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
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption

Cited in

(26)

• Concurrent knowledge extraction in public-key models
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Constant-round concurrent zero knowledge in the bounded player model
• On round-optimal zero knowledge in the bare public-key model
• On constant-round concurrent zero-knowledge from a knowledge assumption
• Optimistic concurrent zero knowledge
• Efficient concurrent zero-knowledge in the auxiliary string model
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Concurrent knowledge extraction in the public-key model
• Efficient Zero Knowledge on the Internet
• Co-sound Zero-Knowledge with Public Keys
• Concurrent zero knowledge in the bounded player model
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• On concurrent zero-knowledge with pre-processing. (Extended abstract)
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• Magic adversaries versus individual reduction: science wins either way
• On the composition of public-coin zero-knowledge protocols
• Theory of Cryptography
• Theory of Cryptography
• From laconic zero-knowledge to public-key cryptography. Extended abstract
• Lower bounds for concurrent zero knowledge

This page was built for publication: Concurrent zero knowledge in the public-key model

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