scholarly journals Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage

2015 ◽  
pp. 311-328 ◽  
Author(s):  
Giuseppe Ateniese ◽  
Antonio Faonio ◽  
Seny Kamara
Keyword(s):  
Zero Knowledge ◽  
Identification Schemes ◽  
Leakage Resilient

Zero-Knowledge Reparation of the Véron and AGS Code-based Identification Schemes

2021 ◽  
Author(s):  
Slim Bettaieb ◽  
Loic Bidoux ◽  
Olivier Blazy ◽  
Philippe Gaborit
Keyword(s):  
Zero Knowledge ◽  
Identification Schemes

scholarly journals Efficient Zero-Knowledge Identification Schemes for Smart Cards

1992 ◽  
Vol 35 (1) ◽  
pp. 21-29 ◽  
Author(s):  
M. Burmester ◽  
Y. Desmedt ◽  
T. Beth
Keyword(s):  
Smart Cards ◽  
Zero Knowledge ◽  
Identification Schemes ◽  
Knowledge Identification

scholarly journals Improved Zero-Knowledge Identification with Lattices

2012 ◽  
Vol 53 (1) ◽  
pp. 33-63 ◽  
Author(s):  
Pierre-Louis Cayrel ◽  
Richard Lindner ◽  
Markus Rückert ◽  
Rosemberg Silva
Keyword(s):  
Hash Function ◽  
Communication Cost ◽  
Zero Knowledge ◽  
Worst Case ◽  
Identification Scheme ◽  
Identification Schemes ◽  
Additional Information ◽  
Commitment Scheme ◽  
Knowledge Identification

ABSTRACT Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be used by an impersonator. In this paper we propose a scheme whose security relies on the existence of a commitment scheme and on the hardness of worst-case lattice problems. We adapt a code- -based identification scheme devised by Cayrel, V´eron and El Yousfi, which constitutes an improvement of Stern’s construction. Our solution sports analogous improvements over the lattice adaption of Stern’s scheme which Kawachi et al. presented at ASIACRYPT ’08. Specifically, due to a smaller cheating probability close to 1/2 and a similar communication cost, any desired level of security will be achieved in fewer rounds. Compared to Lyubashevsky’s scheme presented at ASIACRYPT ’09, our proposal, like Kawachi’s, offers a much milder security assumption: namely, the hardness of SIS for trinary solutions. The same assumption was used for the SWIFFT hash function, which is secure for much smaller parameters than those proposed by Lyubashevsky.

Sign in / Sign up

Export Citation Format

Share Document