Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
<18>This paper fundamentally establishes the relationship between two independently studied research problems and identifies how previous work in each area can be harnessed to further our understanding of both. It was the subject of a plenary talk at the MITACS Network Security and Cryptography Workshop in Toronto, and has been presented at the University of Bristol. Some of the concepts have since been used to investigate the security of outsourced computation (Loftus and Smart, 2011) and the work has inspired further study of robust secret sharing schemes (Jhanwar and Safavi-Naini).