Abstract
Unconditionally secure signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures. Unlike digital signatures, USS schemes require both different signing and different verification algorithms for each user in the system. Thus, any viable security definition for a USS scheme must carefully treat the subject of what constitutes a valid signature. That is, it is important to distinguish between signatures that are created using a user’s signing algorithm and signatures that may satisfy one or more user verification algorithms. Moreover, given that each verifier has his own distinct verification algorithm, a USS scheme must necessarily handle the event of a disagreement. In this paper, we present a new security model for USS schemes that incorporates these notions, as well as give a formal treatment of dispute resolution and the trust assumptions required. We provide formal definitions of non-repudiation and transferability in the context of dispute resolution, and give sufficient conditions for a USS scheme to satisfy these properties. Finally, we present the results of an analysis of Hanaoka et al.’s construction in our security model.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brickell, E., Stinson, D.: Authentication Codes with Multiple Arbiters. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 51–55. Springer, Heidelberg (1988)
Chaum, D., Roijakkers, S.: Unconditionally Secure Digital Signatures. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 206–214. Springer, Heidelberg (1991)
Desmedt, Y., Yung, M.: Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s Attacks. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 177–188. Springer, Heidelberg (1991)
Desmedt, Y., Frankl, Y., Yung, M.: Multi-receiver / Multi-sender Network Security: Efficient Authenticated Multicast / Feedback. In: INFOCOM 1992, pp. 2045–2054 (1992)
Hanaoka, G., Shikata, J., Zheng, Y., Imai, H.: Unconditionally Secure Digital Signature Schemes Admitting Transferability. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 130–142. Springer, Heidelberg (2000)
Hanaoka, G., Shikata, J., Zheng, Y., Imai, H.: Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 64–79. Springer, Heidelberg (2002)
Hara, Y., Seito, T., Shikata, J., Matsumoto, T.: Unconditionally Secure Blind Signatures. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol. 4883, pp. 23–43. Springer, Heidelberg (2009)
Johansson, T.: On the Construction of Perfect Authentication Codes that Permit Arbitration. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 343–354. Springer, Heidelberg (1994)
Johansson, T.: Further Results on Asymmetric Authentication Schemes. Information and Computation 151, 100–133 (1999)
Safavi–Naini, R., McAven, L., Yung, M.: General Group Authentication Codes and Their Relation to “Unconditionally-Secure Signatures”. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 231–247. Springer, Heidelberg (2004)
Safavi-Naini, R., Wang, H.: Broadcast Authentication in Group Communication. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 399–412. Springer, Heidelberg (1999)
Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security Notions for Unconditionally Secure Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 434–449. Springer, Heidelberg (2002)
Simmons, G.: Message Authentication with Arbitration of Transmitter/Receiver Disputes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 151–165. Springer, Heidelberg (1988)
Simmons, G.: A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration. J. Cryptology 2, 77–104 (1990)
Swanson, C., Stinson, D.: Unconditionally Secure Signature Schemes Revisited. Full version to appear in IACR eprint archive http://eprint.iacr.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swanson, C.M., Stinson, D.R. (2011). Unconditionally Secure Signature Schemes Revisited. In: Fehr, S. (eds) Information Theoretic Security. ICITS 2011. Lecture Notes in Computer Science, vol 6673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20728-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-20728-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20727-3
Online ISBN: 978-3-642-20728-0
eBook Packages: Computer ScienceComputer Science (R0)