Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication

DOI: 10.1007/978-3-540-72354-7_15


For ubiquitous communication self-organising adhoc networks become more and more important. We consider mobile phones as an
appropriate trusted gateway for external machines with low communication needs. A message-based approach is best in such a
scenario with moving mobile phones and machines. We propose a security model for access control to the communication infrastructure
that is also message-based. To meet the requirements of ubiquitous communicating machines, all algorithms on the sender’s
side are based on symmetric cryptography resulting in low computation needs. A sophisticated symmetric key infrastructure
for message authentication provides the necessary key management. The trustworthiness of the mobile phone is achieved by using
the SIM as a secure storage and computing module. This makes it possible to use the mobile phone not only as a user terminal
but also as a trusted infrastructure component of the mobile network.

1 Read
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently the study and implementation of elliptic curve cryptosystems (ECC) have developed rapidly and its achievements have become a center of attraction. ECC has the advantage of high-speed processing in software even on restricted environments such as smart cards. In this paper, we concentrate on implementation of ECC over a field of prime characteristic on a 16-bit microcomputer M16C (10MHz). We report a practical software implementation of a cryptographic library which supports 160-bit elliptic curve DSA (ECDSA) signature generation, verification and SHA-1 on the processor. This library also includes general integer arithmetic routines for applicability to other cryptographic algorithms. We successfully implemented the library in 4Kbyte code/data size including SHA-1, and confirmed a speed of 150msec for generating an ECDSA signature and 630msec for verifying an ECDSA signature on M16C.
    Public Key Cryptography, First International Workshop on Practice and Theory in Public Key Cryptography, PKC '98, Pacifico Yokohama, Japan, February 5-6, 1998, Proceedings; 01/1998
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This contribution describes a methodology used to eciently implement elliptic curves (EC) overGF (p) on the 16-bit TI MSP430x33x family of low-cost microcontrollers. We show that it is possible to im- plement EC cryptosystems in highly constrained embedded systems and still obtain acceptable performance at low cost. We modied the EC point addition and doubling formulae to reduce the number of interme- diate variables while at the same time allowing for flexibility. We used a Generalized-Mersenne prime to implement the arithmetic in the un- derlying eld. We take advantage of the special form of the moduli to minimize the number of precomputations needed to implement inversion via Fermat's Little theorem and the k-ary method of exponentiation. We apply these ideas to an implementation of an elliptic curve system over GF (p), where p =2 128 297 1. We show that a scalar point multipli- cation can be achieved in 3.4 seconds without any stored/precomputed values and the processor clocked at 1 MHz.
    Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Cheju Island, Korea, February 13-15, 2001, Proceedings; 01/2001
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Providing security support for mobile ad-hoc networks is challenging for several reasons: (a) wireless networks are susceptible to attacks ranging from passive eavesdropping to active interfering, occasional break-ins by adversaries may be inevitable in a large time interval; (b) mobile users demand "anywhere, anytime" services; (c) a scalable solution is a must for a large-scale mobile network. In this paper, we describe our solution that supports ubiquitous security services for mobile networking nodes, scales to network size, and is robust against break-ins. In our design, we distribute the functions of the certification authority through a threshold secret sharing and scalable multi-signature mechanism, in which each node holds a secret share and multiple nodes in a local neighborhood jointly provide complete services. Localized certification schemes are devised to realize ubiquitous service availability. We also update the secret shares to further enhance robustness against break-ins.