Efficient zero-knowledge identification based on matrix completion problem

DOI10.14188/J.1671-8836.2020.0230MaRDI QIDQ3381608zbMATH OpenFDO

Authors

Publication date 29 September 2021

Full work available at URL https://doi.org/10.14188/J.1671-8836.2020.0230

zbMATH Keywords

authentication protocolmatrix completion problemnon-deterministic polynomial complete problemzero-knowledge proof

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• An efficient statistical zero-knowledge authentication protocol for smart cards
• scientific article; zbMATH DE number 2081078
• Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric

Cited in

(3)

• An efficient statistical zero-knowledge authentication protocol for smart cards
• Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
• Efficient and reliable post-quantum authentication

This page was built for publication: Efficient zero-knowledge identification based on matrix completion problem

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