Publication

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Bolívar Cevallos Manzano
2012
Conference paper

Abstract

We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shares are incorrect. The interesting setting is n/3

Official source

https://infoscience.epfl.ch/record/181702?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Graph Chatbot

Chat with Graph Search

Optimal Symmetric Ratcheting for Secure Communication

Power Yoga: Variable-Stretch Security of CCM for Energy-Efficient Lightweight IoT

Optimal Symmetric Ratcheting for Secure Communication

Power Yoga: Variable-Stretch Security of CCM for Energy-Efficient Lightweight IoT