loading
Documents

Research.Publish.Connect.

Paper

Authors: Takeshi Shingu 1 ; Keiichi Iwaumura 1 and Kitahiro Kaneda 2

Affiliations: 1 Tokyo University of Science, Japan ; 2 Osaka Prefecture University, Japan

ISBN: 978-989-758-196-0

Keyword(s): Secrecy Computation, Secrecy Multiplication, Secrecy Division, Secrecy Addition, Secrecy Subtraction, (K, N) Secret Sharing Scheme.

Related Ontology Subjects/Areas/Topics: Information and Systems Security ; Network Security ; Wireless Network Security

Abstract: In This Paper, We Propose a New Secrecy Multiplication Scheme without Changing the Degree in Shamir’s (K, N) Secret Sharing Scheme. This Scheme Generates a Scalar Value Called Concealed Secret, Which Multiplies a Secret by a Random Number, and Distributes the Concealed Secret by using a Secret Sharing Scheme. When Secrecy Multiplying, We Temporarily Reconstruct the Concealed Secret, and Multiply It with a Share. Therefore, We Can Perform Secrecy Multiplication without Changing the Degree of Polynomials by Multiplying a Polynomial and Scalar Value. Our Scheme Can Extend to Secrecy Division by Dividing a Share with the Concealed Secret. in Addition, We Propose Secrecy Addition and Subtraction Schemes. We Evaluate the Security of Our Schemes, and Show a Possible Application That Cannot Realized using the Conventional Scheme.

PDF ImageFull Text

Download
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 54.92.160.119

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:
Shingu T., Iwaumura K. and Kaneda K. (2016). Secrecy Computation without Changing Polynomial Degree in Shamir’s (K, N) Secret Sharing Scheme.In Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 1: DCNET, (ICETE 2016) ISBN 978-989-758-196-0, pages 89-94. DOI: 10.5220/0005998800890094

@conference{dcnet16,
author={Takeshi Shingu and Keiichi Iwaumura and Kitahiro Kaneda},
title={Secrecy Computation without Changing Polynomial Degree in Shamir’s (K, N) Secret Sharing Scheme},
booktitle={Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 1: DCNET, (ICETE 2016)},
year={2016},
pages={89-94},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005998800890094},
isbn={978-989-758-196-0},
}

TY - CONF

JO - Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 1: DCNET, (ICETE 2016)
TI - Secrecy Computation without Changing Polynomial Degree in Shamir’s (K, N) Secret Sharing Scheme
SN - 978-989-758-196-0
AU - Shingu T.
AU - Iwaumura K.
AU - Kaneda K.
PY - 2016
SP - 89
EP - 94
DO - 10.5220/0005998800890094

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.