Abstract
One-time proxy signatures are one-time signatures for which a primary signer can delegate his or her signing capability to a proxy signer. In this work we propose two one-time proxy signature schemes with different security properties. Unlike other existing one-time proxy signatures that are constructed from public key cryptography, our proposed schemes are based one-way functions without trapdoors and so they inherit the communication and computation efficiency from the traditional one-time signatures. Although from a verifier point of view, signatures generated by the proxy are indistinguishable from those created by the primary signer, a trusted authority can be equipped with an algorithm that allows the authority to settle disputes between the signers. In our constructions, we use a combination of one-time signatures, oblivious transfer protocols and certain combinatorial objects. We characterise these new combinatorial objects and present constructions for them.
Chapter PDF
Similar content being viewed by others
References
Abdalla, M., Reyzin, L.: A new forward-secure digital signature scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 116–129. Springer, Heidelberg (2000)
Bos, J.N.E., Chaum, D.: Provably unforgeable signature. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 1–14. Springer, Heidelberg (1993)
Bellare, M., Micali, S.: How to sign given any trapdoor function. Journal of Cryptology 39, 214–233 (1992)
Bleichenbacher, D., Maurer, U.: Directed acyclic graphs, one-way functions and digital signatures. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 75–82. Springer, Heidelberg (1994)
Bleichenbacher, D., Maurer, U.: On the efficiency of one-time digital signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 145–158. Springer, Heidelberg (1996)
Bleichenbacher, D., Maurer, U.: Optimal tree-based one-time digital signature schemes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 363–374. Springer, Heidelberg (1996)
Dwork, C., Naor, M.: An efficient existentially unforgeable signature scheme and its applications. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 234–246. Springer, Heidelberg (1994)
Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Eurocrypt 2000. LNCS, vol. 2000, pp. 122–138. Springer, Heidelberg (2001)
Even, S., Goldreich, O., Micali, S.: On-line/off-line digital signatures. Journal of Cryptology 9, 35–67 (1996)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17, 281–308 (1988)
Hevia, A., Micciancio, D.: The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 379–396. Springer, Heidelberg (2002)
Pedersen, T.P., Pfitzmann, B.: Fail-stop signatures. SIAM Journal on Computing 26(2), 291–330 (1997)
Hu, Y.-C., Perrig, A., Johnson, D.B.: Packet Leashes: A defense against wormhole attacks in wireless Ad Hoc Networks. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003 (2003) (to appear)
Kim, H., Baek, J., Lee, B., Kim, K.: Secret Computation with secrets for mobile agent using one-time proxy signature. In: The 2001 Symposium on Cryptography and Information Security, Oiso, Japan (2001)
Lamport, L.: Constructing digital signatures from a one way function. Technical Report CSL-98, SRI International (1979)
Lamport, L.: Password authentication with insecure communication. Communication of the ACM 24(11), 770–772 (1981)
Lee, B., Kim, H., Kim, K.: Strong proxy signature and its applications. In: The 2001 Symposium on Cryptography and Information Security, Oiso, Japan (2001)
Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures: Delegation of the power to sign messages. IEICE Trans. Fundamentals E79-A, 1338–1353 (1996)
Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)
Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the 31st ACM Symposium on Theory of Computing, pp. 245–254 (1999)
Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001 (2001)
Niederreiter, H., Xing, C.P.: Rational Points on Curves over Finite Fields: Theory and Applications. Cambridge University Press, LMS 285, Cambridge (2001)
Perrig: The BiBa one-time signature and broadcast authentication. In: Eighth ACM Conference on Computer and Communication Security, pp. 28–37. ACM, New York (2001)
Pieprzyk, J., Wang, H., Xing, C.: Multiple-time signature schemes secure against adaptive chosen message attacks. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004)
Rabin, M.O.: Digitalized signatures. Foundations of Secure Communication, pp. 155–168. Academic Press, London (1978)
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR- 81, Harvard University (1981)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM 21, 120–121 (1978)
Reyzin, L., Reyzin, N.: Better than biBa: Short one-time signatures with fast signing and verifying. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 144–153. Springer, Heidelberg (2002)
Rivest, R., Shamir, A.: PayWord and MicroMint: two simple micro payment schemes. Tech. Rep., MIT Lab. for Computer Science (1996)
Rohatgi, P.: A compact and fast hybrid signature scheme for multicast packet authentication. In: 6th ACM conference on Computer and Communication Security, pp. 93–100 (1999)
Tzeng, W.-G.: Efficient 1-out-n Oblivious Transfer Schemes. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 159–171. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Pieprzyk, J. (2003). Efficient One-Time Proxy Signatures. In: Laih, CS. (eds) Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40061-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-40061-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20592-0
Online ISBN: 978-3-540-40061-5
eBook Packages: Springer Book Archive