activity
20032006
most citedDealing With Curious Players in Secure Networks

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

math.CT2006

Premonoidal categories associated with representations of finite groups and their quantum doubles

L. D. Wagner, J. Links, P. S. Isaac +2

We study the construction of premonoidal categories, where the pentagon relation fails, through representations of finite group algebras and their quantum doubles. Both finite grou…

math.CT2005

Ribbon Structure in Symmetric Pre-monoidal Categories

Liam Wagner, Jon Links, Phil Isaac

Let U(g) denote the universal enveloping algebra of a Lie algebra g. We show the existence of a ribbon algebra in a particular deformation of U(g) which leads to a symmetric pre-mo…

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

Using Simulated Annealing to Calculate the Trembles of Trembling Hand Perfection

Stuart McDonald, Liam Wagner

Within the literature on non-cooperative game theory, there have been a number of attempts to propose logorithms which will compute Nash equilibria. Rather than derive a new algori…

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…