loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Keiichi Iwamura and Ahmad Akmal Aminuddin Mohd Kamal

Affiliation: Department of Electrical Engineering, Tokyo University of Science, Tokyo, Japan

Keyword(s): Secure Computation, Multiparty Computation, Secret Sharing, n<2k-1, Information-theoretical Security, Fast Computation.

Abstract: Typically, unconditionally secure computation using a (k,n) threshold secret sharing is considered impossible when n<2k-1. Therefore, in our previous work, we first took the approach of finding the conditions required for secure computation under the setting of n<2k-1 and showed that secure computation using a (k,n) threshold secret sharing can be realized with a semi-honest adversary under the following three preconditions: (1) the result of secure computation does not include 0; (2) random numbers reconstructed by each server are fixed; and (3) each server holds random numbers unknown to the adversary and holds shares of random numbers that make up the random numbers unknown to the adversary. In this paper, we show that by leaving condition (3), secure computation with information-theoretic security against a semi-honest adversary is possible with k≤n<2k-1. In addition, we clarify the advantage of using secret information that has been encrypted with a random number as input to sec ure computation. One of the advantages is the acceleration of the computation time. Namely, we divide the computation process into a preprocessing phase and an online phase and shift the cost of communication to the preprocessing phase. Thus, for computations such as inner product operations, we realize a faster online phase, compared with conventional methods. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.238.143.70

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Iwamura, K. and Kamal, A. (2021). Secure Computation by Secret Sharing using Input Encrypted with Random Number. In Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT; ISBN 978-989-758-524-1; ISSN 2184-7711, SciTePress, pages 540-547. DOI: 10.5220/0010552305400547

@conference{secrypt21,
author={Keiichi Iwamura. and Ahmad Akmal Aminuddin Mohd Kamal.},
title={Secure Computation by Secret Sharing using Input Encrypted with Random Number},
booktitle={Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT},
year={2021},
pages={540-547},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010552305400547},
isbn={978-989-758-524-1},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 18th International Conference on Security and Cryptography - SECRYPT
TI - Secure Computation by Secret Sharing using Input Encrypted with Random Number
SN - 978-989-758-524-1
IS - 2184-7711
AU - Iwamura, K.
AU - Kamal, A.
PY - 2021
SP - 540
EP - 547
DO - 10.5220/0010552305400547
PB - SciTePress