Volume 1, Issue 2, March 2013, Page: 17-25
Secure Communication with Secret Sharing for the S-Network Using a Large Set of Mistrust-Parties
Johannes Viehmann, Fraunhofer Institut FOKUS (MOTION), Berlin, Germany
Received: Feb. 22, 2013;       Published: Mar. 20, 2013
DOI: 10.11648/j.net.20130102.11      View  2853      Downloads  118
Abstract
This article presents a solution to ensure secure communication in computer networks by using secret sharing and multiple parties mistrusting each other instead of relying on a “trusted party” or a “web of trust”. In contrast to other solutions requiring asymmetric encryption, this concept can provide security even after any possible advance in cryptanalysis and even if unlimited calculation power was available to attack it. But this solution requires the computer network to have special properties. The S Network, a trustworthy repository, is presented as a potential application. A multi-partition-routing protocol is introduced to optimize the concept for secure communication with secret sharing in the context of the S Network.
Keywords
Secret Sharing; Trust; Mistrust; Secure Communication; PSMT; S Network
To cite this article
Johannes Viehmann, Secure Communication with Secret Sharing for the S-Network Using a Large Set of Mistrust-Parties, Advances in Networks. Vol. 1, No. 2, 2013, pp. 17-25. doi: 10.11648/j.net.20130102.11
Reference
[1]
AmitabhaBagchie et al.: Constructing Disjoint Paths for Secure Communication; Lecture Notes in Computer Science, 2003, Volume 2848/2003 pp. 181-195; Springer 2003
[2]
Paul Baran: On Distributed Communications Networks; RAND Corporation Santa Monica 1962;
[3]
Alex Biryukov, Dmitry Khovratovich: Related-key Crypta-nalysis of the Full AES-192 and AES-256; Cryptology ePrint Archive 2009; http://eprint.iacr.org/2009/317
[4]
J. Callas et al.: OpenPGP Message Format; The Internet Society 2007; http://tools.ietf.org/html/rfc4880 (2011-02-02)
[5]
Joan Daemen, Vincent Rijmen: The design of Rijndael: AES – theadvanced encryption standard; Springer 2002
[6]
D. Dolev, C. Dwork, O. Waarts, M. Yung: Perfectly secure message transmission; 31st Annual Symposium on Founda-tions of Computer Science (FOCS 1990) 1990
[7]
Niels Ferguson, Bruce Schneier, Tadayoshi Kohno: Crypto-graphy Enineering; Wiley Publishing, Indianapolis 2010
[8]
IBM Research Division; IBM's Test-Tube Quantum Computer Makes History; First Demonstration Of Shor's Historic Factoring Algorithm; ScienceDaily 2001
[9]
J. Kohl, C. Neuman: The Kerberos Network Authentication Service; Massachusetts Institute ofTechnology 1993; www.ietf.org/rfc/rfc1510.txt(2011-02-02)
[10]
RSA Laboratories: PKCS #1 v2.1: RSA Cryptography Standard; RSA Security Inc. 2002;
[11]
Adi Shamir: How to share a secret; Communications of the ACM v.22 issue 11 pp. 612-613; ACM New York 1979
[12]
C. E. Shannon: Communication theory of secrecy systems; Bell System Technical Journal 28 pp. 656 - 715; Bell Labs 1949
[13]
Peter W. Shor: Polynomial time algorithms for prime facto-rization and discrete logarithms on a quantum computer; Bell Labs 1994
[14]
Alexander Sotirov et al.: MD5 considered harmful today: Creating a rogue CA certificate; 25th Annual Chaos Com-munication Congress in Berlin 2008
[15]
J.Viehmann: Secure communication with secret sharing in static computer networks with partition in mistrust-parties, proc. of the NinthAnnual Conference on Privacy, Security and Trust (PST)Montreal,pp. 205-212, IEEE 2011
[16]
J.Viehmann: The Theory of Creating Trust with a Set of Mistrust-Parties and its Exemplary Application for the S-Network, proc. of the Tenth Annual Conference on Privacy, Security and Trust (PST) Paris, pp. 185-194, IEEE 2012
Browse journals by subject