منابع مشابه
Security Issues for Mobile Government
Mobile and Wireless systems offer new services for public administration that cannot be served by customary wired systems. The wireless mobile system is a solution for some problems that exist in traditional wired systems but they also initiate new security issues. Although the security concerns of wireless mobile systems cannot be completely eliminated with today’s available standards and tech...
متن کاملSecurity and Privacy Issues in Cloud-Based E-Government
Cloud computing services have grown rapidly over the years. Government agencies are also interested in cloud-based provision for their E-government processes. Despite the advantages of cloud-related technologies, there are many security issues as well that fall into several categories of breaches with serious impacts. All these breaches have serious legal and reputational implications. Therefor...
متن کاملSecurity Issues for JME M-Applications
The paper describes the concept of data security in a mobile environment. The objective is to develop Java software applications, MIDlets for mobile devices, which implement data protection at different levels. Existing and proposed solutions are described by defining security models and architectures. From the software development point of view, the paper describes two API’s, JSR 177 [1] and B...
متن کاملEternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronic Security and Digital Forensics
سال: 2008
ISSN: 1751-911X,1751-9128
DOI: 10.1504/ijesdf.2008.021457