Lapin: An efficient authentication protocol based on Ring-LPN
| Autor: | Stefan Heyse, Krzysztof Pietrzak, Vadim Lyubashevsky, Christof Paar, Eike Kiltz |
|---|---|
| Přispěvatelé: | Horst Gortz Institute for IT Security, Ruhr University Bochum (RUB), Ruhr-Universität Bochum [Bochum], Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Institute of Science and Technology [Austria] (IST Austria), Anne Canteaut, Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria) |
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: |
Ring (mathematics)
Otway–Rees protocol Computer science business.industry Byte 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] 010201 computation theory & mathematics Authentication protocol Universal composability 0202 electrical engineering electronic engineering information engineering Noise (video) business Communication complexity Protocol (object-oriented programming) Computer network |
| Zdroj: | Fast Software Encryption-19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012 Fast Software Encryption-19th International Workshop, FSE 2012, Washington, DC, USA, March 19-21, 2012, Mar 2012, Washington DC, United States. pp.346-365, ⟨10.1007/978-3-642-34047-5_20⟩ Lecture Notes in Computer Science Fast Software Encryption ISBN: 9783642340468 FSE |
| DOI: | 10.1007/978-3-642-34047-5_20⟩ |
| Popis: | International audience; We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt'11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices. Performance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt'11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|