Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

Communication-Efficient Secure Computation of Encrypted Inputs using (k, n) Threshold Secret Sharing

Keiichi Iwamura, Ahmad Akmal Aminuddin Mohd Kamal

Published Jan 1, 2023• 14 citations
Publisher

Abstract

Advancements in Internet of Things devices allow for the collection and analysis of big data. Moreover, cloud computing has emerged as an ideal platform for big data analysis because it quickly provides computing resources for analysis at scale. However, concerns exist regarding the privacy and security of this information. Secure computation is a technology that enables computation while maintaining data encryption. In this study, we present a new secure computation based on a client-server model, in which a set of servers perform computations using the inputs of multiple clients. We adopt the$(k, n)$threshold secret sharing approach, where an input$s$is divided into$n$shares and can be recovered from shares with a threshold$k$. However, conventional secure computation using$(k,n)$threshold secret sharing generally requires the condition$n \geq 2k-1$and communication among multiple servers for each multiplication. To the best of our knowledge, no previous study has solved this problem completely. We demonstrate that processes that require communication can be concentrated in the preprocessing phase and propose a secure computation using$(k,n)$threshold secret sharing that does not require communication during the secure computation phase, even when multiplication is performed. Moreover, we show that the number of communications does not depend on the number of multiplications, unlike in conventional methods. As communication often requires more processing time than the actual secure computation, our method makes it possible to realize faster overall processing than conventional methods. We also present an extensive security analysis and experimental simulation of the proposed method. Our proposed method achieves information-theoretic security against semi-honest adversaries under certain conditions with$n < 2k-1$.

DOI
10.1109/access.2023.3278995

Related papers

(Server-Aided) Two-Party Multiplication of Encrypted Shares Using ( k, n ) Threshold Secret Sharing With N ≥ k Servers

Ahmad Akmal Aminuddin Mohd Kamal, Keiichi Iwamura

Two-party computation allows two clients to jointly compute an arbitrary function of their inputs without revealing these inputs to each other. In this study, we adopt a server-aided model, in which a set of computing servers performs computation using the inputs of two clients. In the (k, n) threshold secret sharing scheme, input s is divided into n shares and can be recovered from k shares, where k is a threshold. Typically, the multiplication of shares increases the polynomial's degree from (k-1) to (2k-2), thus increasing the number of shares required from k to 2k-1. Because each server typically holds only one share, the number of servers required also increases to 2k-1. Therefore, a set of n servers can compute multiplication securely only if the adversary corrupts at most k-1 <; n/2 servers. In this study, we differentiate N, which is the number of required servers, and n, which is the parameter of the (k, n) threshold secret sharing scheme. We propose a method of multiplication by using only N ≥ k servers. This is implemented by sending two shares of the same input to each server. In a “normal” method, sending multiple shares to one server violates security because k shares can be leaked from k-1 servers. We overcome this by implementing a different functionality, where each share is first encrypted with a different random number (encrypted share) before being sent to a server. Instead of the “normal shares” of ab, our protocol computes the encrypted shares of ab using the encrypted shares of a and b. We show that the proposed method is secure against a non-colluding semi-honest adversary. Moreover, we implement our method in MATLAB and show its efficiency.

IEEE Access•Jan 1, 2021•12 citations

TTP-Aided Secure Computation using Secret Sharing With Only One Computing Server

Keiichi Iwamura, Ahmad Akmal Aminuddin Mohd Kamal, Masaki Inamura

Secure computation methods include methods that use homomorphic encryption (HE) and those that use secret sharing (SS). Secure computation based on HE can be realized using one server, and the computation process can be made public if the encryption key is kept secure. However, HE generally requires a substantial computation cost. In contrast, SS has the advantage of low computation cost, allowing for high-speed processing; however, all servers must be managed independently. And the process of k or more servers cannot be disclosed. In particular, secret input will be leaked when the same organization manages multiple servers to implement SS. Therefore, a complex model where each server is independently managed is required. Iwamura et al. proposed a secure computation that is information-theoretic secure in n≥k instead of n≥2k−1 by assuming a trusted third party (TTP). In this paper, by making more effective use of a TTP, we demonstrate that secure computation based on SS is possible with only one computing server. Moreover, we show that the entire computation process can be disclosed if the key is managed safely. We realize a method that solves the disadvantages of conventional approaches with a faster computation than those methods.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•May 24, 2022•3 citations

Secure User Authentication With Information Theoretic Security Using Secret Sharing-Based Secure Computation

Keiichi Iwamura, Ahmad Akmal Aminuddin Mohd Kamal

When using an insecure communication channel, the initial step involves authenticating the user (verifying the other party) to ensure the legitimacy of the communication partner, followed by encrypted communication. Public-key encryption-based digital signatures are widely utilized for user authentication; however, they is highly likely that it will be deciphered with the development of quantum computers. Studies are also being conducted on post-quantum cryptography, although it requires significant computational resources and is challenging to implement in Internet of Things (IoT) devices. Consequently, this study suggests the implementation of user authentication and secure communication that guarantees information-theoretic security through the use of a secure computation based on a computationally light (k, n) threshold secret sharing scheme. In this study, we first propose a user authentication system with information-theoretical security utilizing constantly changing information. Subsequently, we demonstrate that secure communication with information-theoretic security can be achieved without the need to distribute a substantial amount of true random numbers, by employing a secure computation based on (k, n) threshold secret sharing. Our proposed methods are suitable for implementation in an IoT environment, as they require minimal processing overhead. We also demonstrate the practical application of the proposed methods through implementation using C++. For example, the claimant’s average execution time is less than 0.1 [ms], and the proposed methods are very efficient.

IEEE Access•Jan 1, 2025•14 citations

Efficient Privacy-Preserving Computation Based on Additive Secret Sharing

Lizhi Xiong, Wenhao Zhou, Zhihua Xia +2 more

The emergence of cloud computing provides a new computing paradigm for users -- massive and complex computing tasks can be outsourced to cloud servers. However, the privacy issues also follow. Fully homomorphic encryption shows great potential in privacy-preserving computation, yet it is not ready for practice. At present, secure multiparty computation (MPC) remains mainly approach to deal with sensitive data. In this paper, following the secret sharing based MPC paradigm, we propose a secure 2-party computation scheme, in which cloud servers can securely evaluate functions with high efficiency. We first propose the multiplicative secret sharing (MSS) based on typical additive secret sharing (ASS). Then, we design protocols to switch shared secret between MSS and ASS, based on which a series of protocols for comparison and nearly all of the elementary functions are proposed. We prove that all the proposed protocols are Universally Composable secure in the honest-but-curious model. Finally, we will show the remarkable progress of our protocols on both communication efficiency and functionality completeness.

arXiv:2009.05356•Sep 11, 2020•18 citations

INFORMATION-THEORETIC SECURE USER AUTHENTICATION VIA SECRET SHARING COMPUTATION

BIRU SHIVA 1 , MULINTI VINAY 2 , KADIRA LOKESH REDDY 3 , KAMMARI BHANU PRASAD 4 , KATTA SHASHANK 5

When using an insecure communication channel, the initial step involves authenticating the user (verifying the other party) to ensure the legitimacy of the communication partner, followed by encrypted communication. With the advancement of quantum computers, many conventional cryptographic techniques are at risk of being deciphered. While postquantum cryptographic approaches are under development, they often demand substantial computational resources, making them difficult to implement in resourceconstrained environments such as the Internet of Things (IoT). This study proposes a user authentication and secure communication system that guarantees information-theoretic security by leveraging secure computation based on a computationally lightweight (k, n)-threshold secret sharing scheme. The proposed authentication approach utilizes constantly changing information to prevent replay attacks and enhance security. It is further demonstrated that secure communication with information-theoretic guarantees can be achieved without the need to distribute a large volume of true random numbers, relying instead on secret sharing-based secure computation. The proposed methods are particularly suitable for IoT applications due to their minimal processing overhead and efficient performance.

International Journal of Engineering Research and Science & Technology•Jul 9, 2026•0 citations

Improvement of Secure Multi-Party Multiplication of (k, n) Threshold Secret Sharing Using Only N = k Servers

Ahmad Akmal Aminuddin Mohd Kamal, Keiichi Iwamura

e realize MPC of multiplication with the setting of N=k,n≥2k-1. We also show that our proposed method is information theoretic secure against a semi-honest adversary.

International Conference on Information Systems Security and Privacy (ICISSP)•Jan 1, 2021•2 citations
Advancements in Internet of Things devices allow for the collection and analysis of big data. Moreover, cloud computing has emerged as an ideal platform for big data analysis because it quickly provides computing resources for analysis at scale. However, concerns exist regarding the privacy and security of this information. Secure computation is a technology that enables computation while maintaining data encryption. In this study, we present a new secure computation based on a client-server model, in which a set of servers perform computations using the inputs of multiple clients. We adopt the(k,n)(k, n)(k,n)threshold secret sharing approach, where an inputsssis divided intonnnshares and can be recovered from shares with a thresholdkkk. However, conventional secure computation using(k,n)(k,n)(k,n)threshold secret sharing generally requires the conditionn≥2k−1n \geq 2k-1n≥2k−1and communication among multiple servers for each multiplication. To the best of our knowledge, no previous study has solved this problem completely. We demonstrate that processes that require communication can be concentrated in the preprocessing phase and propose a secure computation using(k,n)(k,n)(k,n)threshold secret sharing that does not require communication during the secure computation phase, even when multiplication is performed. Moreover, we show that the number of communications does not depend on the number of multiplications, unlike in conventional methods. As communication often requires more processing time than the actual secure computation, our method makes it possible to realize faster overall processing than conventional methods. We also present an extensive security analysis and experimental simulation of the proposed method. Our proposed method achieves information-theoretic security against semi-honest adversaries under certain conditions withn<2k−1n < 2k-1n<2k−1.
Two-party computation allows two clients to jointly compute an arbitrary function of their inputs without revealing these inputs to each other. In this study, we adopt a server-aided model, in which a set of computing servers performs computation using the inputs of two clients. In the (k, n) threshold secret sharing scheme, input s is divided into n shares and can be recovered from k shares, where k is a threshold. Typically, the multiplication of shares increases the polynomial's degree from (k-1) to (2k-2), thus increasing the number of shares required from k to 2k-1. Because each server typically holds only one share, the number of servers required also increases to 2k-1. Therefore, a set of n servers can compute multiplication securely only if the adversary corrupts at most k-1 <; n/2 servers. In this study, we differentiate N, which is the number of required servers, and n, which is the parameter of the (k, n) threshold secret sharing scheme. We propose a method of multiplication by using only N ≥ k servers. This is implemented by sending two shares of the same input to each server. In a “normal” method, sending multiple shares to one server violates security because k shares can be leaked from k-1 servers. We overcome this by implementing a different functionality, where each share is first encrypted with a different random number (encrypted share) before being sent to a server. Instead of the “normal shares” of ab, our protocol computes the encrypted shares of ab using the encrypted shares of a and b. We show that the proposed method is secure against a non-colluding semi-honest adversary. Moreover, we implement our method in MATLAB and show its efficiency.
Secure computation methods include methods that use homomorphic encryption (HE) and those that use secret sharing (SS). Secure computation based on HE can be realized using one server, and the computation process can be made public if the encryption key is kept secure. However, HE generally requires a substantial computation cost. In contrast, SS has the advantage of low computation cost, allowing for high-speed processing; however, all servers must be managed independently. And the process of k or more servers cannot be disclosed. In particular, secret input will be leaked when the same organization manages multiple servers to implement SS. Therefore, a complex model where each server is independently managed is required. Iwamura et al. proposed a secure computation that is information-theoretic secure in n≥k instead of n≥2k−1 by assuming a trusted third party (TTP). In this paper, by making more effective use of a TTP, we demonstrate that secure computation based on SS is possible with only one computing server. Moreover, we show that the entire computation process can be disclosed if the key is managed safely. We realize a method that solves the disadvantages of conventional approaches with a faster computation than those methods.
When using an insecure communication channel, the initial step involves authenticating the user (verifying the other party) to ensure the legitimacy of the communication partner, followed by encrypted communication. Public-key encryption-based digital signatures are widely utilized for user authentication; however, they is highly likely that it will be deciphered with the development of quantum computers. Studies are also being conducted on post-quantum cryptography, although it requires significant computational resources and is challenging to implement in Internet of Things (IoT) devices. Consequently, this study suggests the implementation of user authentication and secure communication that guarantees information-theoretic security through the use of a secure computation based on a computationally light (k, n) threshold secret sharing scheme. In this study, we first propose a user authentication system with information-theoretical security utilizing constantly changing information. Subsequently, we demonstrate that secure communication with information-theoretic security can be achieved without the need to distribute a substantial amount of true random numbers, by employing a secure computation based on (k, n) threshold secret sharing. Our proposed methods are suitable for implementation in an IoT environment, as they require minimal processing overhead. We also demonstrate the practical application of the proposed methods through implementation using C++. For example, the claimant’s average execution time is less than 0.1 [ms], and the proposed methods are very efficient.
The emergence of cloud computing provides a new computing paradigm for users -- massive and complex computing tasks can be outsourced to cloud servers. However, the privacy issues also follow. Fully homomorphic encryption shows great potential in privacy-preserving computation, yet it is not ready for practice. At present, secure multiparty computation (MPC) remains mainly approach to deal with sensitive data. In this paper, following the secret sharing based MPC paradigm, we propose a secure 2-party computation scheme, in which cloud servers can securely evaluate functions with high efficiency. We first propose the multiplicative secret sharing (MSS) based on typical additive secret sharing (ASS). Then, we design protocols to switch shared secret between MSS and ASS, based on which a series of protocols for comparison and nearly all of the elementary functions are proposed. We prove that all the proposed protocols are Universally Composable secure in the honest-but-curious model. Finally, we will show the remarkable progress of our protocols on both communication efficiency and functionality completeness.
When using an insecure communication channel, the initial step involves authenticating the user (verifying the other party) to ensure the legitimacy of the communication partner, followed by encrypted communication. With the advancement of quantum computers, many conventional cryptographic techniques are at risk of being deciphered. While postquantum cryptographic approaches are under development, they often demand substantial computational resources, making them difficult to implement in resourceconstrained environments such as the Internet of Things (IoT). This study proposes a user authentication and secure communication system that guarantees information-theoretic security by leveraging secure computation based on a computationally lightweight (k, n)-threshold secret sharing scheme. The proposed authentication approach utilizes constantly changing information to prevent replay attacks and enhance security. It is further demonstrated that secure communication with information-theoretic guarantees can be achieved without the need to distribute a large volume of true random numbers, relying instead on secret sharing-based secure computation. The proposed methods are particularly suitable for IoT applications due to their minimal processing overhead and efficient performance.