Secret Sharing-based Authenticated Key Agreement Protocol

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F21%3APU141158" target="_blank" >RIV/00216305:26220/21:PU141158 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/doi/10.1145/3465481.3470057" target="_blank" >https://dl.acm.org/doi/10.1145/3465481.3470057</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3465481.3470057" target="_blank" >10.1145/3465481.3470057</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Secret Sharing-based Authenticated Key Agreement Protocol

Popis výsledku v původním jazyce

In this article, we present two novel authenticated key agreement (AKA) schemes that are easily implementable and efficient even onconstrained devices. Both schemes are constructed over elliptic curves and extend Schonorr’s signature of knowledge protocol. To thebest of our knowledge, we introduce a first AKA protocol based on the proof of knowledge concept. This concept allows a client toprove its identity to a server via secret information while the server can learn nothing about the secret. Furthermore, we extend ourprotocol via secret sharing to support client multi-device authentication and multi-factor authentication features. In particular, thesecret of the client can be distributed among the client’s devices.The experimental analysis shows that our secret sharing AKA (SSAKA) can establish a secure communication channel in less than600 ms for one secondary device and 128-bit security strength. The protocol is fast even on very constrained secondary devices, wherein most of cases takes less than 500 ms. Note that the time consumption depends on the computational capabilities of the hardware.

Název v anglickém jazyce

Secret Sharing-based Authenticated Key Agreement Protocol

Popis výsledku anglicky

In this article, we present two novel authenticated key agreement (AKA) schemes that are easily implementable and efficient even onconstrained devices. Both schemes are constructed over elliptic curves and extend Schonorr’s signature of knowledge protocol. To thebest of our knowledge, we introduce a first AKA protocol based on the proof of knowledge concept. This concept allows a client toprove its identity to a server via secret information while the server can learn nothing about the secret. Furthermore, we extend ourprotocol via secret sharing to support client multi-device authentication and multi-factor authentication features. In particular, thesecret of the client can be distributed among the client’s devices.The experimental analysis shows that our secret sharing AKA (SSAKA) can establish a secure communication channel in less than600 ms for one secondary device and 128-bit security strength. The protocol is fast even on very constrained secondary devices, wherein most of cases takes less than 500 ms. Note that the time consumption depends on the computational capabilities of the hardware.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/TM02000036" target="_blank" >TM02000036: Umělá inteligence pro praxi</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Workshop on Security and Privacy in Intelligent Infrastructures (SP2I 2021) at the 16th International Conference on Availability (ARES 2021).

ISBN

978-1-4503-9051-4

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

1-10

Název nakladatele

Neuveden

Místo vydání

neuveden

Místo konání akce

All-Digital Conference

Datum konání akce

17. 8. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000749539200101