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

DOI10.1007/11787006_5zbMath1133.94343OpenAlexW2160291410MaRDI QIDQ3591421

Kaoru Kurosawa, Jun Furukawa, Hiroshi 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

efficientconstant-round\(\Sigma\)-protocoldeniableresettable 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)

Related Items (2)

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