Improved Setup Assumptions for 3-Round Resettable Zero Knowledge

DOI10.1007/978-3-540-30539-2_37MaRDI QIDQ5465836zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

Publication date 12 August 2005

Full work available at URL https://doi.org/10.1007/978-3-540-30539-2_37

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• scientific article; zbMATH DE number 1722687
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• scientific article; zbMATH DE number 2009952

Cited in

(12)

• Delayed-input cryptographic protocols
• scientific article; zbMATH DE number 1722687 (Why is no real title available?)
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Co-sound Zero-Knowledge with Public Keys
• scientific article; zbMATH DE number 1952909 (Why is no real title available?)
• scientific article; zbMATH DE number 2009952 (Why is no real title available?)
• scientific article; zbMATH DE number 1842510 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

This page was built for publication: Improved Setup Assumptions for 3-Round Resettable Zero Knowledge

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