A new NP-complete problem and public-key identification

DOI10.1023/A:1021835718426zbMath1024.94007MaRDI QIDQ1866023

Guillaume Poupard, David Pointcheval

Publication date: 3 April 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

NP-completenesszero-knowledgepermuted perceptrons problemsecure identification scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (4)

Cryptography from Learning Parity with Noise ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ Extended security arguments for signature schemes ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem

This page was built for publication: A new NP-complete problem and public-key identification