Home // SECURWARE 2016, The Tenth International Conference on Emerging Security Information, Systems and Technologies // View article

A Novel Verifiable Multi-Secret Sharing Scheme Based on Elliptic Curve Cryptography

Authors:
Nisha Patel
Prakash D. Vyavahare
Manish Panchal

Keywords: Multi-Secret Sharing Scheme; Double Knapsack Algorithm; Shamir's Threshold Scheme; Malicious Participant Detection; ECDLP

Abstract:
Multi-secret sharing schemes are used to protect multiple secrets by distributing them among many participants in such a manner that they can be reconstructed only by certain authorized group of participants. The scheme proposed by Lin-Yeh is one such method, which is based on Shamir's threshold scheme. In this paper a Verifiable Multi-Secret Sharing Scheme is proposed which is based on Shamir's threshold scheme, Elliptic Curve Discrete Logarithm Problem (ECDLP), and Double knapsack algorithm. The proposed scheme exhibits all the advantages of Lin-Yeh's scheme in which each participant has only one secret share for reconstructing multiple secrets. Additionally, the scheme does not require secure channel in secret share distribution phase since each participant's share is selected by participant himself. The scheme can also detect malicious participants during verification phase. The main advantage of ECDLP as compared to Rivest, Shamir and Adleman (RSA) and Discrete Logarithm Problem (DLP) is that it offers the same level of security for a smaller key size, thereby reducing processing overheads with lesser requirement of memory and bandwidth with faster implementation. Therefore, it can provide an efficient and secure mechanism for key management in public key systems.

Pages: 230 to 234

Copyright: Copyright (c) IARIA, 2016

Publication date: July 24, 2016

Published in: conference

ISSN: 2162-2116

ISBN: 978-1-61208-493-0

Location: Nice, France

Dates: from July 24, 2016 to July 28, 2016