A new scheme for deniable/repudiable authentication

Authors:
Song Y. Yan;Carsten Maple;Glyn James
Affiliations:
Institute for Research in Applicable Computing, University of Bedfordshire, UK and School of Computer Science and Engineering, South China University of Technology, Guangzhou, China;Institute for Research in Applicable Computing, University of Bedfordshire, UK;Department of Mathematical Sciences, Coventry University, UK
Venue:
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Year:
2007

Citing 4
Cited 0

Number Theory for Computing

Number Theory for Computing
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
New directions in cryptography

IEEE Transactions on Information Theory
An overview of public key cryptography

IEEE Communications Magazine - Part Anniversary

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most important features of authentication is the non-repudiation property, implemented by digital signatures. This useful feature of authentication may, however, not be necessary in some cases, such as e-voting, and should indeed be avoided. In this paper, by a combined use of public-key encryption, digital signatures, coding, quadratic residues, and randomness, a new scheme for deniable/repudiable authentication is proposed and analyzed, and a complete example of the scheme is given. The security of the scheme is based on the intractability of the quadratic residuosity problem.