ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Short Leakage Resilient and Non-malleable Secret Sharing Schemes

Chandran, N and Kanukurthi, B and Obbattu, SLB and Sekar, S (2022) Short Leakage Resilient and Non-malleable Secret Sharing Schemes. In: 42nd Annual International Cryptology Conference, CRYPTO 2022, 15 - 18 August 2022, Santa Barbara, pp. 178-207.

Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-3-031-15802-5_7


Leakage resilient secret sharing (LRSS) allows a dealer to share a secret amongst n parties such that any authorized subset of the parties can recover the secret from their shares, while an adversary that obtains shares of any unauthorized subset of parties along with bounded leakage from the other shares learns no information about the secret. Non-malleable secret sharing (NMSS) provides a guarantee that even shares that are tampered by an adversary will reconstruct to either the original message or something independent of it. The most important parameter of LRSS and NMSS schemes is the size of each share. For LRSS, in the local leakage model (i.e., when the leakage functions on each share are independent of each other and bounded), Srinivasan and Vasudevan (CRYPTO 2019), gave a scheme for threshold access structures with share size of approximately (3·messagelength+μ), where μ is the number of bits of leakage tolerated from every share. For the case of NMSS, the best known result (again due to the above work) has share size of (11·messagelength). In this work, we build LRSS and NMSS schemes with much improved share size. Additionally, our LRSS scheme obtains optimal share and leakage size. In particular, we get the following results: We build an information-theoretic LRSS scheme for threshold access structures with a share size of (messagelength+μ).As an application of the above result, we obtain an NMSS with a share size of (4·messagelength). Further, for the special case of sharing random messages, we obtain a share size of (2·messagelength). © 2022, International Association for Cryptologic Research.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to Springer Science and Business Media Deutschland GmbH.
Keywords: Information theory, Leakage modeling; Learn+; Non-malleable; Optimal share; Secret sharing schemes; Secret-sharing; Threshold access structures, Cryptography
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 04 Jan 2023 07:07
Last Modified: 04 Jan 2023 07:07
URI: https://eprints.iisc.ac.in/id/eprint/78726

Actions (login required)

View Item View Item