Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra

DOI10.1007/978-3-642-19379-8_24zbMath1291.94153OpenAlexW1483367930MaRDI QIDQ3084360

Jae Hong Seo

Publication date: 15 March 2011

Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_24

zbMATH Keywords

linear algebraround-efficient zero-knowledge argumentssub-linear zero-knowledge arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs

This page was built for publication: Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra