Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home


Technical Reports


printable version
» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

  Click here for full text: PDF

RSA-based Undeniable Signatures for General Moduli

Galbraith, Steven D.; Mao, Wenbo; Paterson, Kenneth G.

HPL-2001-304

Keyword(s): undeniable signatures; RSA-based undeniable signatures

Abstract: Gennaro, Krawczyk and Rabin gave the first undeniable signature scheme based on RSA signatures. However, their solution required the use of RSA moduli which are a product of safe primes. This paper gives techniques which allow RSA-based undeniable signatures for general moduli. Notes: Steven D. Galbraith, Pure Mathematics Department, Royal Holloway University of London, Egham, Surrey TW20 0EX, UK Kenneth G. Paterson, Information Security Group, Mathematics Department, Royal Holloway University of London, Egham, Surrey TW20 0EX, UK

18 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.