Abstract
Large scale networked information systems are referred to as critical information infrastructures when they provide critical services to the critical physical infrastructures. Critical information infrastructures contain specific nodes that provide security services, like authentication servers; those are called security or trust centres. The goal of this research is to fmd an algorithm for enabling those centres to become sustainable by sharing their (superfluous) security resources and to resist Byzantine failures. The proposed secret sharing algorithm takes care of allocating in advance the secret content of the suffering centre to other healthy centres, so that only an arbitrary majority of them can reconstruct the content. This perfect t,n- threshold scheme is suitable in dynamic networks as it has an adaptive access structure. It is compared to existing schemes rather simple as it is purely based on permutations. It is efficient, i.e. favourable information rate, as all shares are much shorter than the secret itself. Secondarily, each secret share is even additionally protected (encrypted) against the holder as well against any outsider.
Chapter PDF
References
S. Daskapan, W.G. Vree, A. Ali Eldin, “Trust metrics for survivable security systems”, Proc. of the IEEE International Conference on Systems, Man & Cybernetics, Washindon, 2003.
A.E. Barbour, A. S. Wojcik, “A General Constructive Approach to Fault Tolerant Design Using Redundancy”, IEEE Transactions on Computers, pp. 15–29,1989.
Matti A. Hiltunen, Richard D. Schlichting, Carlos A. Ugarte, “Enhancing Survivability of Security Services Using Redundancy”, The International Conference on Dependable Systems and Networks, Sweden, 2001.
Bruno Dutertre, Valentin Crettaz, Victoria Stavridou, “Intrusion-Tolerant Enclaves”, IEEE Symposium on Security and Privacy, California, 2002.
L. Lamport, R. Shostak, M. Pease, “The Byzantine Generals Problem” ACM Transactions on Programming Languages and Systems, vol.4(3) pp.382–401, July 1982.
Jean-Claude Laprie, “Dependable Computing and Fault Tolerance Concepts and Terminology,” 15th International Symposium on Fault Tolerant Computing, pp. 2–11, 1985.
L. Gong, “Increasing Availability and Security of an Authenticatio Service”, IEEE Journal on Selected Areas in Communications, Vol 11(5) pp.657–662, 1993.
M. Reiter, “Secure Agreement Protocols: Reliable and Atomic Groul Multicast in Rampart”, Proc. of 2nd ACM Conference on Computer and Communications Security. pp. 68–80, 1994.
Thomas Hardjono, Jennifer Seberry, “Replicating the Kupere authentication server for increased security and reliability”, A ustralas ian Conference on Information Security and Privacy, pp.14–26, 1996.
Matti A. Hiltunen, Richard D. Schlichting, Carlos A. Ugarte, “Building Survivable Services Using Redundancy and Adaptation”, IEE Transactions on Computers, Vol. 52(2), pp. 181–194, 2003.
Vivek Pathak, Liviu Iftode, “Byzantine Fault Tolerant Authentication” Rutgers University, Department of Computer Science Technical Report DC S-TR-492, June 2002.
P. Veríssimo, NF Neves, M. Correia, “The middleware architecture o MAFTIA: A Blueprint”, Proc. of the IEEE Third Informatior Survivability Workshop, Boston, pp. 24–26, 2000.
C. Cachin, J. Poritz, “Secure Intrusion Tolerant Replication on the Internet”, Proc. of the 2002 International Conference on Dependable Systems and Networks, Washington, pp. 167–176, 2002.
Lidong Zhou, Fred B. Schneider, Robbert van Renesse, “COCA: A Secure Distributed On-line Certification Authority”, Technical Repor TR2000–1828, 2000.
Ohad Rodeh, Kenneth P. Birman, Danny Dolev, “The architecture and performance of security protocols in the ensemble group communicatior system: Using diamonds to guard the castle”, ACM Transactions on Information and System Security, Vol. 4(3), pp.289–319, 2001.
R. Canetti and T. Rabin, “Fast asynchronous Byzantine agreement wit optimal resilience”, Proc. 25th Annual ACM Symposium on Theory of Computing, pp. 42–51.1993.
M. J. Fischer, N. A. Lynch, M. S. Paterson, “Impossibility of distributec consensus with one faulty process”, Journal of the ACM, Vol. 32(2), pp.374–382, 1985.
G. Bracha. “An asynchronous [(n -1)/3]-resilient consensus protocol”, Proc. of 3rd ACM Symposium on Principles of Distributed Computing, pp. 154–162, 1984.
A. Shamir, “How to Share a Secret”, Communications of the ACM, Vol 22(11), pp.612–613, 1979.
K. Kurosawa, K. Okada, H. Saido, D. Stinson, “New combinatorial bounds for authentication codes and key predistribution schemes”, Designs, Codes and Cryptography, Vol 15(1), pp.87–100, 1998.
Y. Desmedt, “Threshold cryptography”, European Transactions on Telecommunications, Vol 5(4), pp. 449–457, 1994.
J. Seberry, C. Charnes, J. Pieprzyk and R. Safavi-Naini, “Crypto Topics And Applications II”, Algorithms and Theory of Computation Handbook, CRC Press, 1999.
G. J. Simmons, “An Introduction to Shared Secret and/or Shared Control Schemes and their Application”, Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons (Ed.), IEEE Press, pp.441–497, 1991.
G. R. Blakley, “Safeguarding cryptographic keys”, Proc. of American Federation of Information Processing Societies 1979 National Computer Conference, Vol.48, pp. 313–317, 1979.
C. Cachin, On-line secret sharing, in “Cryptography and Coding V”, C. Boyd (ed.), Lecture Notes in Computer Science, Vol. 1025, pp. 190–198, 1996
E.F. Brickell, D.R. Stinson, “Some improved bounds on the information rate of perfect secret sharing schemes”, Journal of Cryptology, Vol. 5(3), pp. 153–166, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Daskapan, S. (2004). Dependable Security by Twisted Secret Sharing. In: Deswarte, Y., Cuppens, F., Jajodia, S., Wang, L. (eds) Security and Protection in Information Processing Systems. SEC 2004. IFIP — The International Federation for Information Processing, vol 147. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8143-X_13
Download citation
DOI: https://doi.org/10.1007/1-4020-8143-X_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-8016-1
Online ISBN: 978-1-4020-8143-9
eBook Packages: Springer Book Archive