scientific article; zbMATH DE number 1136088

MaRDI QIDQ4381399zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Publication date 10 January 1999

zbMATH Keywords

constant-round protocolsrandom self-reducible languagesresult-indistinguishable perfect zero-knowledge proof

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1107670
• How to construct constant-round zero-knowledge proof systems for NP
• The knowledge complexity of quadratic residuosity languages
• On the Composition of Zero-Knowledge Proof Systems

Cited in

(1)

• scientific article; zbMATH DE number 1107670 (Why is no real title available?)

This page was built for publication:

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