1 citations · 1 across the 5 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2004★ 1 cited
Dealing With Curious Players in Secure Networks
Liam Wagner
In secure communications networks there are a great number of user behavioural problems, which need to be dealt with. Curious players pose a very real and serious threat to the int…
cs.CR2003
Finding Traitors in Secure Networks Using Byzantine Agreements
Liam Wagner, Stuart McDonald
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors i…
cs.CR2003
A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA
Liam Wagner
In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may ac…