Seminars

View all Seminars  |  Download ICal for this event

Locally Reconstructable Non-Malleable Secret Sharing

Series: M.Tech (Research) Colloquium- ONLINE

Speaker: Ms. Jenit Tomy M.Tech(Research) Student Dept. of CSA

Date/Time: Jan 25 15:00:00

Location: Microsoft Teams - ONLINE

Faculty Advisor: Prof. Bhavana Kanukurthi

Abstract:
Non-malleable secret sharing (NMSS) schemes, introduced by Goyal and Kumar (STOC 2018), ensure that a secret m can be distributed into shares m1,...,mn (for some n), such that any t (a parameter <= n) shares can be reconstructed to recover the secret m, any t-1 shares doesnt leak information about m and even if the shares that are used for reconstruction are tampered, it is guaranteed that the reconstruction of these tampered shares will either result in the original m or something independent of m. Since their introduction, non-malleable secret sharing schemes sparked a very impressive line of research. In this talk, we present a new feature of local reconstructablility in NMSS, which allows reconstruction of any portion of a secret by reading just a few locations of the shares. This is a useful feature, especially when the secret is long or when the shares are stored in a distributed manner on a communication network. In this talk, we give a compiler that takes in any non-malleable secret sharing scheme and compiles it into a locally reconstructable non-malleable secret sharing scheme. To secret share a message consisting of k blocks of length r each, our scheme would only require reading r + log k bits (in addition to a few more bits, whose quantity is independent of r and k) from each partys share (of a reconstruction set) to locally reconstruct a single block of the message. Microsoft Teans Link: https://teams.microsoft.com/l/meetup-join/19%3ameeting_OTg2OGMwOGQtOTgxYi00OGEyLWE3M2MtOTgzMDNkMGQ0ODUy%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%225f3273b8-8838-46b7-b675-b1e9eab4d8ef%22%7d

Speaker Bio:

Host Faculty: