Efficient and secure secret sharing-based data outsourcing suitable for Internet of Things environments

Advancements in the Internet of Things (IoT) environment and cloud computing have opened new business opportunities, such as cloud-based IoT data outsourcing, in which data collected by IoT devices are outsourced to cloud servers for further processing. However, concerns regarding the privacy and security of the collected data exist. Moreover, IoT devices often operate with low power and possess restricted memory, processing capability, and storage capacity. Consequently, a secure method for data outsourcing with minimal computational requirements is essential. Secret sharing schemes are recognized for providing robust security while necessitating minimal computational resources. Hence, secret sharing schemes have recently been utilized as an alternative method to address privacy protection concerns. In a perfect ( k , n ) threshold secret sharing scheme, a secret is converted into n different shares, thereby requiring a total share size of n times the secret. A ( k , L , n ) ramp secret sharing scheme provides better storage efficiency, albeit at the cost of realizing only weak security. In this study, we propose a new protocol for a secure and storage-efficient ( k , L , n ) ramp secret sharing scheme that combines the idea of encrypting each secret with a random number. By introducing new randomization steps based on the one-time pad encryption approach to randomize the inputs, we prove that even if part of the information can be leaked because of the nature of ( k , L , n ) ramp secret sharing, the actual secret remains secure provided that the product of the random numbers is not leaked from unauthorized shares. Furthermore, we perform an experimental evaluation of the distribution phase of the proposed method with C++ using a Raspberry Pi 4 Model B as an IoT device and show that the proposed method can be executed in significantly less time than most conventional secret haring schemes, particularly when the parameter k increases. • An efficient data outsourcing suitable for resource-constrained IoT devices is proposed. • The combination of secret sharing scheme and the one-time pad encryption approach enables strongly secure data outsourcing. • The evaluation performed with a Raspberry Pi 4 demonstrates that the proposed method is efficient and suitable for IoT settings.

Authors

Institutions

Publication Details

Journal
Internet of Things
Published
2025-05-25
DOI
https://doi.org/10.1016/j.iot.2025.101645
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and secure secret sharing-based data outsourcing suitable for Internet of Things environments

Ahmad Akmal Aminuddin Mohd Kamal, Masaya Fujisawa
Internet of Things
Cryptography and Data Security
article

Efficient and secure secret sharing-based data outsourcing suitable for Internet of Things environments

Ahmad Akmal Aminuddin Mohd Kamal, Masaya Fujisawa
article en

Abstract

Advancements in the Internet of Things (IoT) environment and cloud computing have opened new business opportunities, such as cloud-based IoT data outsourcing, in which data collected by IoT devices are outsourced to cloud servers for further processing. However, concerns regarding the privacy and security of the collected data exist. Moreover, IoT devices often operate with low power and possess restricted memory, processing capability, and storage capacity. Consequently, a secure method for data outsourcing with minimal computational requirements is essential. Secret sharing schemes are recognized for providing robust security while necessitating minimal computational resources. Hence, secret sharing schemes have recently been utilized as an alternative method to address privacy protection concerns. In a perfect ( k , n ) threshold secret sharing scheme, a secret is converted into n different shares, thereby requiring a total share size of n times the secret. A ( k , L , n ) ramp secret sharing scheme provides better storage efficiency, albeit at the cost of realizing only weak security. In this study, we propose a new protocol for a secure and storage-efficient ( k , L , n ) ramp secret sharing scheme that combines the idea of encrypting each secret with a random number. By introducing new randomization steps based on the one-time pad encryption approach to randomize the inputs, we prove that even if part of the information can be leaked because of the nature of ( k , L , n ) ramp secret sharing, the actual secret remains secure provided that the product of the random numbers is not leaked from unauthorized shares. Furthermore, we perform an experimental evaluation of the distribution phase of the proposed method with C++ using a Raspberry Pi 4 Model B as an IoT device and show that the proposed method can be executed in significantly less time than most conventional secret haring schemes, particularly when the parameter k increases. • An efficient data outsourcing suitable for resource-constrained IoT devices is proposed. • The combination of secret sharing scheme and the one-time pad encryption approach enables strongly secure data outsourcing. • The evaluation performed with a Raspberry Pi 4 demonstrates that the proposed method is efficient and suitable for IoT settings.

Internet of ThingsVol. 32
Tokyo University of Science (JP)
University of Tokyo, Japan Society for the Promotion of Science
Industry, innovation and infrastructure
Openalex Percentile: Top 95%
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.