For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Royal Holloway, University of London

Return to search Previous output Next output
Output 41 of 90 in the submission
Article title

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Type
D - Journal article
Title of journal
Cryptography and Communications
Article number
-
Volume number
3
Issue number
2
First page of article
65
ISSN of journal
1936-2447
Year of publication
2011
Number of additional authors
2
Additional information

<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).

Interdisciplinary
-
Cross-referral requested
-
Research group
E - Information Security Group
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-