Skip to Main content Skip to Navigation
Conference papers

Almost-perfect Secret Sharing

Tarik Kaced 1, *
* Corresponding author
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : To split a secret s between several participants, we generate (for each value of s) shares for all participants. The goal: authorized groups of participants should be able to reconstruct the secret but forbidden ones get no information about it. We introduce several notions of non-perfect secret sharing, where some small information leak is permitted. We study its relation to the Kolmogorov complexity version of secret sharing (establishing some connection in both directions) and the effects of changing the secret size (showing that we can decrease the size of the secret and the information leak at the same time).
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Tarik Kaced <>
Submitted on : Thursday, September 27, 2012 - 4:05:59 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: : Friday, December 16, 2016 - 6:03:18 PM


Files produced by the author(s)




Tarik Kaced. Almost-perfect Secret Sharing. ISIT'11: International Symposium on Information Theory, Jul 2011, St. Petersburg, Russia. pp.1603-1607, ⟨10.1109/ISIT.2011.6033816⟩. ⟨lirmm-00736122⟩



Record views


Files downloads