Improved Zero-Knowledge Identification with Lattices
From MaRDI portal
Publication:4906264
DOI10.2478/V10127-012-0038-4zbMATH Open1306.94038OpenAlexW2068719709MaRDI QIDQ4906264FDOQ4906264
Authors: Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva 
Publication date: 11 February 2013
Published in: Tatra Mountains Mathematical Publications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/v10127-012-0038-4
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Lattice ideals, congruence relations (06B10) Network protocols (68M12)
Cited In (5)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Improved Zero-Knowledge Identification with Lattices
- A lightweight identification protocol based on lattices
This page was built for publication: Improved Zero-Knowledge Identification with Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906264)
