An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge

DOI10.1007/11787006_5MaRDI QIDQ3591421zbMATH OpenOpenAlexFDO

Authors Jun Furukawa, Kaoru Kurosawa, Hideki Imai

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

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

zbMATH Keywords

\(\Sigma\)-protocolconstant-rounddeniableefficientresettable zero-knowledgeresettably-sound argument of knowledgethe random oracle model

Mathematics Subject Classification ID

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

Recommendations

• Advances in Cryptology - CRYPTO 2003
• An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
• 3-Move Undeniable Signature Scheme
• Concurrent zero-knowledge
• scientific article; zbMATH DE number 1559559

Cited in

(3)

• Automatic generation of -protocols
• An efficient and secure two-flow zero-knowledge identification protocol
• A Generic Construction for Universally-Convertible Undeniable Signatures

This page was built for publication: An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge

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