A Lattice-Based Batch Identification Scheme

Abstract : This paper presents a batch version of the lattice-based identification scheme known as CLRS. Our version consists of a method for allowing a user to authenticate himself with different levels of clearance upon the choice of a subset of keys in his possession. It bears similarity with the Schnorr batch scheme, in the sense that the communication costs are kept constant, regardless of the number of keys involved. We use the hardness of a lattice problem, namely the Inhomogeneous Small Integer Solution problem (I-SIS), as security assumption.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-00664911
Contributor : Pierre-Louis Cayrel <>
Submitted on : Tuesday, January 31, 2012 - 4:36:17 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:31 PM
Long-term archiving on : Tuesday, May 1, 2012 - 2:46:03 AM

File

2011_-_A_Lattice-Based_Batch_I...
Files produced by the author(s)

Identifiers

  • HAL Id : ujm-00664911, version 1

Collections

Citation

Rosemberg Silva, Pierre-Louis Cayrel, Richard Lindner. A Lattice-Based Batch Identification Scheme. IEEE Information Theory Workshop (ITW 2011), Oct 2011, paraty, Brazil. pp.215 - 219. ⟨ujm-00664911⟩

Share

Metrics

Record views

304

Files downloads

355