Cryptology ePrint Archive: Report 2005/389
How to Generate Universally Verifiable Signatures in Ad-Hoc Networks
KyungKeun Lee and JoongHyo Oh and SangJae Moon
Abstract: This paper addresses the problem of making signatures of one domain (an ad-hoc network) available in another domain (the Internet).
Universal verifiability is a highly desirable property when signed documents need to be permanently non-repudiable so as to prevent dishonest signers from disavowing signatures they have produced. As a practical solution, we construct a new signature scheme where a valid signature should be generated by a couple of distinct signing keys. In the random oracle model, the signature scheme is provably secure in the sense of existential unforgeability under adaptive chosen message attacks assuming the hardness of the computational Diffie-Hellman problem in the Gap Diffie-Hellman groups.
Category / Keywords: cryptographic protocols / digital signatures, bilinear maps, ad-hoc networks,
Publication Info: An extended abstract of this paper is published in the proceeding of MADNES'05.
Date: received 26 Oct 2005, last revised 2 Nov 2005
Contact author: skywalker at mail knu ac kr
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20051103:043959 (All versions of this report)
Short URL: ia.cr/2005/389
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]