Abstract
In the present paper, we answer a question raised in the paper Constructions and Bounds for Unconditionally Secure Non- Interactive Commitment Schemes, by Blundo et al, 2002, showing that there is a close relation between unconditionally secure commitment schemes and unconditionally secure authentication schemes, and that an unconditionally secure commitment scheme can be built from such an authentication scheme and an unconditionally secure cipher system.
To investigate the opposite direction, we define optimal commitment systems and show that these must be resolvable design commitment schemes. Then, a proof is given that the resolvable design commitment schemes are a composition of an authentication system and a cipher system and the conclusion follows that this is the case for all optimal commitment systems.
We also show how to build optimal schemes from transversal designs that are easy to build and can be more efficiently implemented than the proposal in the previously cited paper.
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
Anderson, I., Honkala, I.: A Short Course in Combinatorial Designs (Spring 1997), http://www.utu.fi/~honkala/designs.ps
Blum, M.: Coin flipping by telephone: a protocol for solving impossible problems. In: 24th IEEE Spring Computer Conference, pp. 133–137. IEEE Press, Los Alamitos (1982)
Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Designs, Codes and Cryptography 26 (2002)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)
Lidl, R., Niederreiter, H.: Finite Fields, pp. 50–51, 89–91. Cambridge University Press, Cambridge (1983)
Maurer, U.: Authentication theory and hypothesis testing. IEEE Transactions on Information Theory 46(4), 1350–1356 (2000)
McGrew, D., Viega, J.: The Galois/Counter Mode of Operation (GCM). Submission to NIST Modes of Operation Process (January 2004)
Nascimento, A.C.A., Otsuka, A., Imai, H., Müller-Quade, J.: Unconditionally Secure Homomorphic Pre-distributed Commitments. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 87–97. Springer, Heidelberg (2003)
Rivest, R.L. (ed.): Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer (unpublished manuscript) (November 1999), http://citeseer.ifi.unizh.ch/rivest99unconditionally.html
Simmons, G.J.: Authentication Theory / Coding Theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–431. Springer, Heidelberg (1985)
Simmons, G.J.: Message authentication: a game on hypergraphs. Congressus Numerantium 45, 161–192 (1984)
Simmons, G.J.: A Natural Taxonomy for Digital Information Authentication Schemes. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 269–288. Springer, Heidelberg (1988)
Stinson, D.R.: Combinatorial Characterization of Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 62–73. Springer, Heidelberg (1992)
Stinson, D.R.: Some Constructions and Bounds for Authentication Codes. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 418–425. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinto, A., Souto, A., Matos, A., Antunes, L. (2009). Commitment and Authentication Systems. In: Desmedt, Y. (eds) Information Theoretic Security. ICITS 2007. Lecture Notes in Computer Science, vol 4883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10230-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-10230-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10229-5
Online ISBN: 978-3-642-10230-1
eBook Packages: Computer ScienceComputer Science (R0)