Security evaluation on secret computation without changing the polynomial degree

Ken Aoi, Takeshi Shingu, Keiichi Iwamura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Our previous work led to the proposal of a method for secret computation without changing the polynomial degree in Shamir's (k,n) secret sharing scheme. This scheme realizes secret computation for n < 2k - 1. However, it is known that secret computation for n < 2k - 1 is not secure unconditionally. So we try to clarify the condition for secure computation. This paper presents our detailed evaluation of the security of our secret computation, and shows that the secret input and the result of the secret computation are not revealed at all when an operation of the same type is repeated under the following conditions: (1) multiplication by zero is excluded; (2) a set of shares using a different random number is used for an operation of a different type.

Original languageEnglish
Title of host publicationProceedings - 31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017
EditorsTomoya Enokido, Makoto Takizawa, Chi-Yi Lin, Hui-Huang Hsu, Leonard Barolli
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages56-61
Number of pages6
ISBN (Electronic)9781509062300
DOIs
Publication statusPublished - 16 May 2017
Event31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017 - Taipei, Taiwan, Province of China
Duration: 27 Mar 201729 Mar 2017

Publication series

NameProceedings - 31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017

Conference

Conference31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017
CountryTaiwan, Province of China
CityTaipei
Period27/03/1729/03/17

    Fingerprint

Keywords

  • N <2k - 1
  • Repetition of operations of the same type
  • Secret computation
  • Security evaluation

Cite this

Aoi, K., Shingu, T., & Iwamura, K. (2017). Security evaluation on secret computation without changing the polynomial degree. In T. Enokido, M. Takizawa, C-Y. Lin, H-H. Hsu, & L. Barolli (Eds.), Proceedings - 31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017 (pp. 56-61). [7929654] (Proceedings - 31st IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WAINA.2017.108