Abstract
A server-aided verification signature scheme consists of a digital signature scheme and a server-aided verification protocol. By executing the server-aided verification protocol with the server, one can perform the verification of signatures with less computational cost compared to the original verification algorithm. This mechanism is therefore indispensable for low-power devices such as smart cards. The contributions of this paper are manyfold. Firstly, we introduce and define the existential unforgeability of server-aided verification signatures. We prove that the new notion includes the existing security requirements in server-aided verification signatures. Then, we analyze the Girault-Lefranc scheme in Asiacrypt 2005 and show that their scheme can be made secure in our model, but the computational cost is more than the claimed in the original scheme. After that, we propose the first server-aided verification BLS, which is existentially unforgeable in the random oracle model under the Bilinear Diffie-Hellman assumption. Finally, we consider the collusion and adaptive chosen message attack in server-aided verification signatures. For the first time in the literature, the security of server-aided verification signatures against such attacks is defined. We provide a concrete construction of a server-aided verification BLS secure against the collusion and chosen message attack.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R.J.: An Attack on Server-Assisted Authentication Protocols. Electronic Letters 28(15), 1473 (1992)
Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 382–400. Springer, Heidelberg (2004)
Boneh, D., Lynn, G., Shacham, H.: Short Signature from The Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Burns, J., Mitchell, C.J.: Parameter Selection for Server-Aided RSA Computation Schemes. IEEE Transaction on Computers 43, 147–163 (1994)
Beguin, P., Quisquater, J.-J.: Fast Server-Aided RSA Signatures Secure Against Active Attacks. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 57–69. Springer, Heidelberg (1995)
Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)
Girault, M., Lefranc, D.: Server-Aided Verification: Theory and Practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605–623. Springer, Heidelberg (2005)
Girault, M., Quisquater, J.J.: GQ + GPS = new ideas + new protocols. In: Eurocrypt 2002 - Rump Session (2002)
Girault, M., Paillès, J.C.: On-line/Off-line RSA-like. In: International Workshop on Coding and Cryptography (2003)
Gennaro, R., Rabin, T., Krawczyk, H.: RSA-Based Undeniable Signatrues. Journal of Cryptology 13(4), 397–416 (2000)
Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2), 281–308 (1988)
Kawamura, S., Shimbo, A.: Fast Server-Aided Secret Computation Protocols for Modular Exponentiation. IEEE Journal on selected areas communications 11 (1993)
Lim, C.H., Lee, P.J.: Security and Performance of Server-Aided RSA Computation Protocols. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 70–83. Springer, Heidelberg (1995)
Matsumoto, T., Imai, H., Laih, C.-S., Yen, S.-M.: On Verifiable Implicit Asking Protocols for RSA Computation. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 296–307. Springer, Heidelberg (1993)
Matsumoto, T., Kato, K., Imai, H.: Speeding Up Secret Computation with Insecure Auxiliary Devices. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 497–506. Springer, Heidelberg (1990)
Nguyen, P., Stern, J.: The Béguin-Quisquater Server-Aided RSA Protocol from Crypto95 is not Secure. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 372–379. Springer, Heidelberg (1998)
Pfitamann, B., Waidner, M.: Attacks on Protocols for Sever-Aided RSA Computation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 153–162. Springer, Heidelberg (1993)
Quisquater, J.-J., De Soete, M.: Speeding Up Smart Card RSA Computation with Insecure Coprosessors. In: Proceedings of Smart Cards 2000 , pp. 191–197 (1989)
Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)
Yen, S.-M., Laih, C.-S.: More about the Active Attack on the Server-Aided Secret Computation Protocol. Electronic Letters, 2250 (1992)
Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairing and its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, W., Mu, Y., Susilo, W., Huang, X. (2008). Server-Aided Verification Signatures: Definitions and New Constructions. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds) Provable Security. ProvSec 2008. Lecture Notes in Computer Science, vol 5324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88733-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-88733-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88732-4
Online ISBN: 978-3-540-88733-1
eBook Packages: Computer ScienceComputer Science (R0)