Abstract
Translating legislation and regulations into access control systems in healthcare is, in practice, not a straightforward task. Excessive regulation can create barriers to appropriate patient treatment. The main objective of this paper is to present a new methodology that can define, from legislation to practice, an access control policy as well as a RBAC model, in order to comprise generic legislation and regulation issues together with the access control needs from the ends users of a healthcare information system. The methodology includes the use of document analysis as well as grounded theory and mixed methods research. This methodology can be easily applied within a healthcare practice or any other domain with similar requirements. It helps to bridge the gap between legislation and end users' needs, while integrating information security into the healthcare processes in a more meaningful way.

Abstract
Virtual electronic patient records (VEPR) enable the integration and sharing of healthcare information within large and heterogeneous organizations by aggregating known data elements about patients from different information systems in real-time. However, healthcare professionals need to access a terminal every time they treat a patient. This may not be trivial as computers are not available around every corner of big healthcare institutions. The use of wireless technology can improve and fasten healthcare treatment because it can bring information and decision to the point of care allowing also for healthcare professionals' mobility. However, as healthcare information is of a very sensitive nature, it has to comply with important security requirements. The wireless technology makes it more difficult for these requirements to be achieved as it is harder to control disruptions and attempts to access information can be more common and less simple to detect. The main objective of this chapter is to model, develop and evaluate (e.g. in terms of efficiency, complexity, impact and against network attacks) a proposal for a secure wireless architecture in order to access a VEPR. This VEPR is being used within a university hospital by more than 1,000 doctors, on a daily basis. Its users would greatly benefit if this service would be extended to a wider part of the hospital and not only to their workstation, achieving this way faster and greater mobility in the treatment of their patients. © 2009, IGI Global.

Abstract

Abstract
Algorithmic entropy and Shannon entropy are two conceptually different information measures, as the former is based on size of programs and the later in probability distributions. However, it is known that, for any recursive probability distribution, the expected value of algorithmic entropy equals its Shannon entropy, up to a constant that depends only on the distribution. We study if a similar relationship holds for Renyi and Tsallis entropies of order a, showing that it only holds for Renyi and Tsallis entropies of order 1 (i.e., for Shannon entropy). Regarding a time bounded analogue relationship, we show that, for distributions such that the cumulative probability distribution is computable in time t(n), the expected value of time-bounded algorithmic entropy (where the alloted time is nt(n) log(nt(n))) is in the same range as the unbounded version. So, for these distributions, Shannon entropy captures the notion of computationally accessible information. We prove that, for universal time-bounded distribution m(t)(x), Tsallis and Renyi entropies converge if and only if a is greater than 1.

Abstract

Abstract