Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099MaRDI QIDQ5311536zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

Publication date 23 August 2005

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

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• On round-optimal zero knowledge in the bare public-key model
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

Cited in

(23)

• scientific article; zbMATH DE number 2009952 (Why is no real title available?)
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Concurrent knowledge extraction in public-key models
• scientific article; zbMATH DE number 1842510 (Why is no real title available?)
• scientific article; zbMATH DE number 1952909 (Why is no real title available?)
• Random walks and concurrent zero-knowledge
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Delayed-input cryptographic protocols
• Improved OR-composition of sigma-protocols
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Concurrent non-malleable commitments (and more) in 3 rounds
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• Hybrid commitments and their applications to zero-knowledge proof systems
• On round-optimal zero knowledge in the bare public-key model
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Resettably-sound resettable zero knowledge in constant rounds
• 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
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
• Co-sound Zero-Knowledge with Public Keys
• scientific article; zbMATH DE number 1722687 (Why is no real title available?)

This page was built for publication: Advances in Cryptology – CRYPTO 2004

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