3 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.CR2007★ 1 cited
Secure Two-party Protocols for Point Inclusion Problem
Tony Thomas
It is well known that, in theory, the general secure multi-party computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re…
cs.CR2006★ 3 cited
Group Signature Schemes Using Braid Groups
Tony Thomas, Arbind Kumar Lal
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy pro…
cs.CR2006★ 2 cited
Undeniable Signature Schemes Using Braid Groups
Tony Thomas, Arbind Kumar Lal
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first undeniable signature schemes using the conjugacy p…