Round-efficient sub-linear zero-knowledge arguments for linear algebra

DOI10.1007/978-3-642-19379-8_24MaRDI QIDQ3084360zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• scientific article; zbMATH DE number 1559559

Cited in

(4)

• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Computational integrity with a public random string from quasi-linear PCPs
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Algebraic reductions of knowledge

This page was built for publication: Round-efficient sub-linear zero-knowledge arguments for linear algebra

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