Improved server assisted signatures

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2005-02, Vol.47 (3), p.351-366
• Main Authors: Bicakci, Kemal, Baykal, Nazife
• Format: Article
• Language: English
• Subjects: Applied sciences; Computer networks; Cryptography; Digital signature; Digital signatures; Exact sciences and technology; Information, signal and communications theory; Network security; Nonrepudiation; One-time signature; Server-assisted signature; Signal and communications theory; Studies; Telecommunications and information theory
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2004.08.008

It is well known that excessive computational demands of public key cryptography have made its use limited especially when constrained devices are of concern. To reduce the costs of generating public key signatures one viable method is to employ a third party; the server. In open networks, getting help from a verifiable-server has an advantage over proxy-based solutions since as opposed to proxy-server, verifiable-server’s cheating can be proven. Verifiable-server assisted signatures were proposed in the past but they could not totally eliminate public key operations for the signer. In this paper, we propose a new alternative called SAOTS (server assisted one-time signatures) where just like proxy signatures generating a public key signature is possible without performing any public key operations at all. This feature results in both computational efficiency and implementation simplicity (e.g. a reduction in the code size) of the proposed protocol. In addition, SAOTS is a more promising approach since the signature is indistinguishable from a standard signature, no storage is necessary for the signer to prove the server’s cheating and the protocol works in less number of rounds (two instead of three). On the other hand, the drawback of SAOTS is the increased bandwidth requirement between the sender and server.