A General Approach to Authenticated Key Establishment Based on Homomorphic Secret Sharing

This paper addresses the problem of establishing a secure communication channels betweenparties in a multiparty environment. Most of well-known key establishment protocols used inpractice are based on Diffie–Hellman problems and require significant computational costs.Therefore, key pre-distribution protocols are preferred for resource-constrained devices. Inthis paper, we consider protocols of this type based on secret sharing and propose a generalapproach using the homomorphic property of secret sharing schemes. Examples of suchprotocols are given and their security properties are analyzed. We also prove some interestingside results — there are no perfectly secure two party key agreement and joint multipartythreshold decreasing protocols in a public channels setting. Finally, we rise a problem whosesolution will allow for lightweight and secure connections between any devices.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-10-21
DOI
https://doi.org/10.5281/zenodo.13960662
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A General Approach to Authenticated Key Establishment Based on Homomorphic Secret Sharing

Zenodo (CERN European Organization for Nuclear Research)
Cryptography and Data Security
article

A General Approach to Authenticated Key Establishment Based on Homomorphic Secret Sharing

article en

Abstract

This paper addresses the problem of establishing a secure communication channels betweenparties in a multiparty environment. Most of well-known key establishment protocols used inpractice are based on Diffie–Hellman problems and require significant computational costs.Therefore, key pre-distribution protocols are preferred for resource-constrained devices. Inthis paper, we consider protocols of this type based on secret sharing and propose a generalapproach using the homomorphic property of secret sharing schemes. Examples of suchprotocols are given and their security properties are analyzed. We also prove some interestingside results — there are no perfectly secure two party key agreement and joint multipartythreshold decreasing protocols in a public channels setting. Finally, we rise a problem whosesolution will allow for lightweight and secure connections between any devices.

Zenodo (CERN European Organization for Nuclear Research)
Peter the Great St. Petersburg Polytechnic University (RU)
Openalex Percentile: Top 59%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.