2012 | OriginalPaper | Buchkapitel
A Leakage-Resilient Zero Knowledge Proof for Lattice Problem
verfasst von : Yang Liu, Hongda Li, Qihua Niu
Erschienen in: Cyberspace Safety and Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Leakage-resilient cryptographic protocols have recently been evolving intensively, studying the question of designing protocol that maintain security even in the presence of side-channel attacks. Under leakage assumption(the verifier uses side-channel attacks to obtain some information about the secret state of the prover), the known zero knowledge protocol may not preserve zero knowledge any more. Garg et.al. first studied leakage-resilient zero knowledge and presented an excellent construction for NP. Unfortunately, the definition is not suitable for honest verifier leakage-resilient zero knowledge. In this paper, we give a new definition of leakage-resilient zero knowledge and construct a leakage-resilient zero knowledge proof for approximate version of the closest vector problem(
$\textsc{G}_{\textsc{AP}}\textsc{CVP}_\gamma$
). We also give a definition of leakage-resilient bit commitment scheme.