On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Proxy-based security protocols in networked mobile devices
Proceedings of the 2002 ACM symposium on Applied computing
Computer Networks
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Fast Server-Aided RSA Signatures Secure Against Active Attacks
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
How to construct optimal one-time signatures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure Proxy Signature Schemes for Delegation of Signing Rights
Journal of Cryptology
A server-aided signature scheme for mobile commerce
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A survey of electronic signature solutions in mobile devices
Journal of Theoretical and Applied Electronic Commerce Research
A mobile network operator-independent mobile signature service
Journal of Network and Computer Applications
Information Sciences: an International Journal
A survey on mobile digital signature models
Proceedings of the 12th International Conference on Electronic Commerce: Roadmap for the Future of Electronic Business
| Hi-index | 0.00 |
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.