BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1721
DTSTAMP:20260519T060745Z
SUMMARY:Towards Provable Leakage-Resilience of Additive and Inner-Product M
 asking under Hamming-weight Model
DESCRIPTION:Speaker: Jihun Hwang (Jimmy) (Purdue University)\n\nAbstract: \
 nAdditive secret sharing achieves perfect secrecy: even if a strict subset
  of shares is leaked\, the secret remains completely hidden. But is this s
 till the case when partial information on every share leaks?We study the l
 ocal leakage resilience of additive secret sharing (and its variants) agai
 nst Hamming-weight leakage in two settings.\nOver binary extension fields 
 (Boolean hypercubes)\, we show that inner-product secret sharing  (where 
 the secret is reconstructed as an inner product of the shares with a fixed
  vector) is secure against Hamming-weight leakage unless the reconstructio
 n vector is constant. We also introduce an efficiently computable score fu
 nction that quantifies and certifies the security afforded by a given reco
 nstruction vector.\nOver near-dyadic-order groups\, we show that additive 
 secret sharing is secure against Hamming-weight leakage. We prove matching
  upper and lower bounds on insecurity\, establishing that our bounds are t
 ight. As a byproduct\, we obtain a ternary representation result: the Cayl
 ey graphs of near-central Hamming slices have diameter at most three.\nOur
  analysis is Fourier-analytic\, combining techniques from Krawtchouk polyn
 omials\, additive combinatorics\, and spectral methods.\n
URL:https://www.tcs.tifr.res.in/web/events/1721
DTSTART;TZID=Asia/Kolkata:20260522T160000
DTEND;TZID=Asia/Kolkata:20260522T170000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR