KTR docuMEW

AN EFFICIENT KEY MANAGEMENT SCHEME (KTR) FOR SECURE DATA ACCESS
CONTROL IN WIRELESS BROADCAST SERVICES

1. INTRODUCTION
With the ever growing popularity of smart mobile devices along with the rapid
advent of wireless technology, there has been an increasing interest in wireless data
services among both industrial and academic communities in recent years. Among
various approaches, broadcast allows a very efficient usage of the scarce wireless
bandwidth, because it allows simultaneous access by an arbitrary number of mobile
clients . Wireless data broadcast services have been available as commercial products
for many years. We propose a new key management scheme, namely key tree reuse
(KTR, based on two important observations! (" users who subscribe to multiple
programs can be captured by a shared key tree, and (# old keys can be reused to save
rekey cost without compromising security. KTR has two components! shared key tree
and shared key management.KTR combines the advantages of both shared key tree
and critical key. Among all schemes, it has a light communication overhead (i.e. its
average rekey message si$e per event is the least or close to the smallest, incurs less
computation and power consumption on mobile devices than the other schemes (i.e.
its average number of decryption per event per user is the smallest, and re%uires least
storage in mobile devices (i.e. its average number of keys held per user is the
smallest. &ecause a mobile receiver generally only has limited resources, such an
overhead saving can greatly benefit the receivers so that they can have a longer
working duration and more computation capacity to process broadcast data.
We evaluate the storage demand on mobile devices, which is measured as the
average number of keys held by each user. 'ne goal is to save storage by reducing the
number of keys each user needs to hold. (ince KTR makes programs share keys, KTR
saves storage for a user when the user )oins a tree shared by more programs. As
analy$ed before, the structure that programs share trees determines the number of
keys that can be saved. *owever, since users may favor some subscriptions, users
may concentrate in some trees. +or users subscribing to single programs, KTR has no
advantage over ,K*.
-n broadcast services, the basic data unit is data item, such as a piece of news
or a stock price. .ata items are grouped into programs and a user specifies which
programs he would like to access. Typical programs could be weather, news, stock
IT, MITS, 2011
1
%uotes, etc. +or simplicity, we assume that each program covers a set of data items,
and programs are e/clusively complete. A user may subscribe to one or more
programs. The set of subscribed programs is called the user0s subscription. 1sers can
subscribe via -nternet or uplink channels to specify the programs that they are
interested in receiving.
2revious studies on wireless data broadcast services have mainly focused on
performance issues such as reducing data access latency and conserving battery power
of mobile devices.
1nfortunately, the critical security re%uirements of this type of broadcast
service have not yet been addressed, i.e. broadcast service providers need to ensure
backward and forward secrecy key management with multi3cast issues and multi cast
distribution and multi cast key distribution with respect to membership dynamics. -n
the wireless broadcast environment, any user can monitor the broadcast channel and
record the broadcast data. -f the data is not encrypted, the content is open to the public
and anyone can access the data. -n addition, a user may only subscribe to a few
programs. -f data in other programs are not encrypted, the user can obtain data beyond
his subscription privilege. *ence, access control should be enforced via encrypting
data in a proper way so that only subscribing users can access the broadcast data, and
subscribing users can only access the data to which they subscribe. (ymmetric3key3
based encryption is a natural choice for ensuring secure data dissemination and
access. The broadcast data can be encrypted so that only those users who own valid
keys can decrypt them. Thus, the decryption keys can be used as an effective means
for access control in wireless # data broadcast services. +or e/ample, each program
has one uni%ue key to encrypt the data items. The key is issued to the user who is
authori$ed to receive and decrypt the data items. -f a user subscribes to multiple
programs, it needs an encryption key for each program. (ince a user only has keys for
his subscription, he cannot decrypt broadcast data and rekey messages designated to
other users. At the same time, a data item can be decrypted by an arbitrary number of
users who subscribe to it. This allows many users to receive the data at the same time
and addresses the scalability problem, or re%uest lost or missed keys.
4evertheless, when a user subscribes5unsubscribes to a program, the
encryption key needs to be changed to ensure that the user can only access the data in
IT, MITS, 2011
2
his subscription period. 6onse%uently, a critical issue remains, i.e. how can we
efficiently manage keys when a user )oins5leaves5changes the service without
compromising security and interrupting the operations of other users7 Regarding
uni%ue features of broadcast services, we are interested in new key management
schemes that can simultaneously provide security, efficiency and fle/ibility. A
broadcast service generally provides many programs8 at the same time, users may
like to subscribe to an arbitrary set of programs. We envision that a user should be
able to fle/ibly subscribe5unsubscribe to any program of interests and make changes
to his subscription at any time. *ence, in addition to security and efficiency,
fle/ibility that a user can customi$e his subscription at anytime is an indispensable
feature of key management in broadcast services to support user subscriptions.
4evertheless, directly applying ,K* in broadcast services is not the most efficient
approach. -n broadcast services, a program is e%uivalent to a multicast group, and
users who subscribe to one program form a group. -ntuitively, we could manage a
separate set of keys for each program, and ask a user to hold m sets of keys for his
subscribed m programs. This straight forward approach is inefficient for users
subscribing to many programs. -f users could use the same set of keys for multiple
programs, there would be fewer re%uirements for users to handle keys. +urthermore,
when a user changes subscription, we argue that it is unnecessary to change keys for
the programs to which the user is still subscribing, as long as security can be ensured.
-n this way, rekey cost can be reduced and fewer users will be affected. Therefore, we
propose a new key management scheme, namely key tree reuse (KTR.
KTR has two components! shared key tree and shared key management, and
its contribution includes the following aspects.
+irst, the proposed scheme takes advantage of a fact in broadcast services!
many users subscribe to multiple programs simultaneously. -n other words, programs
overlap with each other in terms of users. &ecause e/isting approaches manage keys
by separating programs, they turn to be demanding for the users who subscribe to
many programs. *ence, this study contributes to the literature a new scheme (namely
KTR to better support subscriptions of multiple programs by e/ploiting the
overlapping among programs. KTR let multiple programs share the same set of keys
for the users who subscribe to these programs. KTR thus inherently enables users to
IT, MITS, 2011
3
handle fewer keys and reduces the demands of storage and processing power on
resource3limited mobile devices. (econd, since multiple programs are allowed to
share the same set of keys, a critical issue is how to manage shared keys efficiently
and securely. We find that when keys need to be distributed to a user, it is unnecessary
to change all of them. -n many circumstances, when a user subscribes to new
programs or unsubscribes to some programs, a large portion of keys that the user will
hold in his new subscription can be reused without compromising security. KTR is a
novel approach for determining which keys need to be changed and for finding the
minimum number of keys that must be changed. *ence, KTR efficiently handles the
rekey of the shared keys and minimi$es the rekey costs associated with possible
subscriptions. 'ur simulations show that critical keys can be employed in logical key
hierarchy schemes key management for multi cast issues and multi cast distribution
and multi cast key distribution to improve their performance.
Two categories of key management schemes in the literature may be applied in
broadcast services! (" logic key hierarchy (,K* based techni%ues proposed for
multicast services8 and (# broadcast encryption techni%ues in current broadcast
services (such as satellite T9. We notice that current broadcast encryption
techni%ues, including &-((, .igicipher, -rdeto, 4agravision, 9iaccess, and
9ideo:uard, cannot in fact support fle/ibility. They normally re%uire users to possess
decryption bo/es to receive the subscribed programs, and the broadcast services can
only provide to users a few packages, each of which includes a fi/ed set of programs
(T9 channels. 1sers cannot select individual programs within a package. -f a user
wants to change his subscription, the user needs to re%uest another decryption bo/ that
can decrypt the subscribed programs. *ence, in this paper, we will focus on adapting
more fle/ible ,K*3based techni%ues. 4evertheless, directly applying ,K* in
broadcast services is not the most efficient approach. -n broadcast services, a program
is e%uivalent to a multicast group, and users who subscribe to one program form a
group. -ntuitively, we could manage a separate set of keys for each program, and ask a
user to hold m sets of keys for his subscribed m programs. This straightforward
approach is inefficient for users subscribing to many programs. -f users could use the
same set of keys for multiple programs, there would be fewer re%uirements for users
to handle keys. +urthermore, when a user changes subscription, we argue that it is
unnecessary to change keys for the programs to which the user is still subscribing, as
IT, MITS, 2011
4
long as security can be ensured. -n this way, rekey cost can be reduced and fewer
users will be affected. Therefore, we propose a new key management scheme, namely
key tree reuse (KTR, based on two important observations! (" users who subscribe
to multiple programs can be captured by a shared key tree, and (# old keys can be
reused to save rekey cost without compromising security. KTR has two components!
shared key tree and shared key management.
1.1 SYMMETRIC KEY MANAGEMENT ALGORITHM:
(ymmetric key management is the key management of cryptographic
symmetric encryption keys. -n a symmetric key algorithm the keys involved are
identical for both encrypting and decrypting a message. (uch keys must be chosen
carefully, and distributed and stored securely. -n any system there may be multiple
keys for various purposes. Accordingly, key management is central to the successful
and secure use of symmetric key algorithms.
The main characteristics of symmetric key management are!
key generation
key e/change
key storage
key usage
Key generation
Key generation is part of key management. -t is important, for some
algorithms have weak keys which make cryptanalysis easier, even much easier. .;(,
the 1( :overnment approved cipher standard has, for instance, four known weak
keys. These keys must be known, if they e/ist, and eliminated from the pool of
possible keys. 'therwise, the chief re%uirement of a key for symmetric cipher use is
unpredictability, specifically to any potential attacker. This is somewhat like the case
of passwords. &ecause this is e%uivalent to high entropy, and because keys can be
thought of as a string of bits, the usual techni%ue for generating a key is to select one
from a pool of binary random numbers.
IT, MITS, 2011
5
;%uivalently, one may say that the output of a key generating function should
not support a conclusion about the input.-n either case, the %uality of the random
number generator used should be as high as possible. This is difficult to achieve in
practice. <any key derivation functions use a mathematical one way function, such as
a cryptographic hash functions like <.= or (*A ". -f used carefully these prevent an
attacker from learning the input to the K.+ and from guessing it with any better
likelihood of getting it correct than chance. *ash function outputs are not random,
being deterministically dependent on their inputs, and so their inputs should have high
entropy.
Keys are often derived from a password, or more satisfactorily (passwords
being unlikely to be randomly chosen from pseudo random number generator, some
of which are also cryptographically secure. <any pseudo random number generators
are entirely unsuitable for such a use however, as they are not in fact random, and so
do not have high entropy.
Key ex!ange
2rior to any communication protected by a symmetric key encryption
algorithm, both parties (and no one else must possess the same properly generated
key. +ormerly, e/change of such a key was e/tremely troublesome, and was greatly
eased by access to secure communications such as a diplomatic bag. 6lear
te/t e/change is %uite impractical as any interceptor will immediately learn the key to
be used and so will be able to decrypt messages they weren>t intended to have access
to.
(ince the .iffie3*ellman key e/change protocol was published in "?@=, it has
become possible to e/change a key over an insecure communications channel, which
has very substantially reduced the risk of key disclosure during distribution. -t is
possible, using something akin to a book code, to include key indicators as clear te/t
attached to an encrypted message. The encryption techni%ue used by Richard (orge>s
code clerk was of this type, referring to a page in a statistical manual, though it was in
fact a code. The :erman Army ;nigma symmetric encryption key was a mi/ed type
early in its use8 the key was a combination of secretly distributed key schedules and a
user chosen session key component for each message.
IT, MITS, 2011
6
-n more modern systems, such as 'pen 2:2 compatible systems, a session
key for a symmetric key algorithm is distributed encrypted by an asymmetric key
algorithm. This approach avoids even the necessity for using a key e/change protocol
like .iffie3*ellman key e/change.
A more comple/ method of key e/change involves encapsulating one key
within another. -t>s not clear that this increase security for if one key can be securely
e/changed (the encapsulating key, the encapsulated key can presumably be as well.
This techni%ue is usually termed Key Wrap. A common techni%ue uses &lock
ciphers and cryptographic hash functions.
A related method, also more complicated, is to e/change a master key
(sometimes termed a root key, and, as needed, derive subsidiary keys, possible for
each session, from that key. As with the key wrapping scheme above, this scheme also
offers no obvious benefit, for if the master key can be distributed securely, so might
the subsidiary keys. When the availability of secure e/change is intermittent, or when
keys must be related to each other (i.e., departmental keys are tied to divisional keys,
and individual keys tied to departmental keys this techni%ue may be useful. *owever,
tying keys to each other increase the damage which may result from a security breach
as attackers will learn something about more than one key. This reduces entropy, with
regard to an attacker, for each key involved.
Key "torage
*owever distributed, symmetric keys must be stored securely to maintain
communications security. There are various techni%ues in use to assist with this.
,ikely the most common is that an encryption application manages keys for the user
and depends on an access password to control use of the key. -t is rare to use keys in
>raw> form, that is as a string of bits, most probably because such strings often
generate mistakes when handled by humans.
Key #"e
The ma)or issue is length of key use, and therefore fre%uency of replacement.
&ecause it increases any attackers re%uired effort, keys should be fre%uently changed.
This also limits loss of information, as the number of stored encrypted messages
which will become readable when a key is found will be decrease as the fre%uency of
IT, MITS, 2011

key change increases. *istorically, symmetric keys have been used for long periods in
situations in which key e/change was very difficult or only possible intermittently.
-deally, the symmetric key should change with each message or interaction, so that
only that message will become readable if the key is learned (e.g., stolen,
cryptanaly$ed, or social engineered.
Literat#re "#r$ey:
,iterature survey is the most important step in software development process.
&efore developing the tool it is necessary to determine the time factor, economy n
company strength. 'nce these things r satisfied, ten ne/t step is to determine which
operating system and language can be used for developing the tool. 'nce the
programmers start building the tool the programmers need lot of e/ternal support.
This support can be obtained from senior programmers, from book or from websites.
&efore building the system the above consideration r taken into account for
developing the proposed system.
Logia% Key Hierar!y
(ecure key management for wireless broadcast is closely related to secure
group key management in networking . ,ogical key hierarchy (,K* is proposed in
that uses a key tree (depicted in +igure for each group of users who subscribe the
same program. The root (top node of the tree is the data encryption key (.;K of the
program. ;ach leaf (bottom node in the tree represents an individual key (-.K of a
user that is only shared between the system and the user. 'ther keys in the tree,
namely key distribution keys (K.Ks, are used to encrypt new .;Ks and K.Ks. A
IT, MITS, 2011
!
user only knows the keys along the path from the leaf of the user to the root of the key
tree proposes a combination of key tree and .iffie3*ellman key e/change to provide a
simple and fault3tolerant key agreement for collaborative groups. reduces the number
of rekey messages, while , improve the reliability of rekey management. &alanced
and unbalanced key trees are discussed in and . 2eriodic group re3keying is studied in
to reduce the rekey cost for groups with fre%uent )oins and leaves.
IN&UT DESIGN
The input design is the link between the information system and the user. -t
comprises the developing specification and procedures for data preparation and those
steps are necessary to put transaction data in to a usable form for processing can be
achieved by inspecting the computer to read data from a written or printed document
or it can occur by having people keying the data directly into the system. The design
of input focuses on controlling the amount of input re%uired, controlling the errors,
avoiding delay, avoiding e/tra steps and keeping the process simple. The input is
designed in such a way so that it provides security and ease of use with retaining the
privacy. -nput .esign considered the following things!
What data should be given as input7
*ow the data should be arranged or coded7
The dialog to guide the operating personnel in providing input.
<ethods for preparing input validations and steps to follow when error
occur.
O'(ECTI)ES
". -nput .esign is the process of converting a user3oriented description of the
input into a computer3based system. This design is important to avoid errors in
the data input process and show the correct direction to the management for
getting correct information from the computeri$ed system.
#. -t is achieved by creating user3friendly screens for the data entry to handle
large volume of data. The goal of designing input is to make data entry easier
and to be free from errors. The data entry screen is designed in such a way that
IT, MITS, 2011
"
all the data manipulates can be performed. -t also provides record viewing
facilities.
A. When the data is entered it will check for its validity. .ata can be entered with
the help of screens. Appropriate messages are provided as when needed so that
the user will not be in mai$e of instant. Thus the ob)ective of input design is to
create an input layout that is easy to follow
OUT&UT DESIGN
A %uality output is one, which meets the re%uirements of the end user and
presents the information clearly. -n any system results of processing are
communicated to the users and to other system through outputs. -n output design it is
determined how the information is to be displaced for immediate need and also the
hard copy output. -t is the most important and direct source information to the user.
;fficient and intelligent output design improves the system0s relationship to help user
decision3making.
". .esigning computer output should proceed in an organi$ed, well thought out
manner8 the right output must be developed while ensuring that each output
element is designed so that people will find the system can use easily and
effectively. When analysis design computer output, they should -dentify the
specific output that is needed to meet the re%uirements.
#. (elect methods for presenting information.
A. 6reate document, report, or other formats that contain information produced
by the system.
The output form of an information system should accomplish one or more of the
following ob)ectives.
6onvey information about past activities, current status or pro)ections of the
+uture.
(ignal important events, opportunities, problems, or warnings.
Trigger an action.
6onfirm an action.
IT, MITS, 2011
10
*. SYSTEM ANALYSIS
*.1 E+ISTING SYSTEM:
+irst, the proposed scheme takes advantage of a fact in broadcast services!
many users subscribe to multiple programs simultaneously. -n other words, programs
many programs.
(econd, since multiple programs are allowed to share the same set of keys, a
critical issue is how to manage shared keys efficiently and securely. -n many
circumstances, when a user subscribes to new programs or unsubscribe to some
programs, a large portion of keys that the user will hold in his new subscription can be
reused without compromising security.
*.* &RO&OSED SYSTEM:
The proposed scheme takes advantage of a fact in broadcast services! many
users subscribe to multiple programs simultaneously. -n other words, programs
many programs. *ence, this study contributes to the literature a new scheme (namely
KTR to better support subscriptions of multiple programs by e/ploiting the
overlapping among programs. KTR let multiple programs share the same set of keys
for the users who subscribe to these programs.
KTR thus inherently enables 1sers to handle fewer keys and reduces the
demands of storage and processing power on resource3limited mobile devices.
(econd, since multiple programs are allowed to share the same set of keys, a critical
issue is how to manage shared keys efficiently and securely. We find that when keys
need to be distributed to a user, it is unnecessary to change all of them. -n many
circumstances, when a user subscribes to new programs or un subscribes to some
IT, MITS, 2011
11
programs, a large portion of keys that the user will hold in his new subscription can be
reused without compromising security. KTR is a novel approach for determining
which keys need to be changed and for finding the minimum number of keys that
must be changed. *ence, KTR efficiently handles the rekey of the shared keys and
minimi$es the rekey costs associated with possible subscriptions. 'ur simulations
show that critical keys can be employed in logical key hierarchy schemes, to improve
their performance.
*., -EASI'ILITY STUDY:
The feasibility of the pro)ect is analy$ed in this phase and business proposal is
put forth with a very general plan for the pro)ect and some cost estimates. .uring
system analysis the feasibility study of the proposed system is to be carried out. This
is to ensure that the proposed system is not a burden to the company. +or feasibility
analysis, some understanding of the ma)or re%uirements for the system is essential.
Three key considerations involved in the feasibility analysis are
;6'4'<-6A, +;A(-&-,-TB
T;6*4-6A, +;A(-&-,-TB
('6-A, +;A(-&-,-TB
*.,.1 ECONOMICAL -EASI'ILITY:
This study is carried out to check the economic impact that the system will
have on the organi$ation. The amount of fund that the company can pour into the
research and development of the system is limited. The e/penditures must be )ustified.
Thus the developed system as well within the budget and this was achieved because
most of the technologies used are freely available. 'nly the customi$ed products had
to be purchased.
*.,.* TECHNICAL -EASI'ILITY:
This study is carried out to check the technical feasibility, that is, the technical
re%uirements of the system. Any system developed must not have a high demand on
the available technical resources. This will lead to high demands on the available
technical resources. This will lead to high demands being placed on the client. The
IT, MITS, 2011
12
developed system must have a modest re%uirement, as only minimal or null changes
are re%uired for implementing this system.
*.,., SOCIAL -EASI'ILITY:
The aspect of study is to check the level of acceptance of the system by the
user. This includes the process of training the user to use the system efficiently. The
user must not feel threatened by the system, instead must accept it as a necessity. The
level of acceptance by the users solely depends on the methods that are employed to
educate the user about the system and to make him familiar with it. *is level of
confidence must be raised so that he is also able to make some constructive criticism,
which is welcomed, as he is the final user of the system.
*.. DATA -LO/ DIAGRAM:
The .+. is also called as bubble chart. -t is a simple graphical formalism that
can be used to represent a system in terms of the input data to the system, various
processing carried out on these data, and the output data is generated by the system.
D-D: 01ey 2i"tri3#tion 1ey" 0KDK"4 Gro#5 o66#niation4
IT, MITS, 2011
13
*.7 HARD/ARE RE8UIREMENTS:
(ystem ! 2entium -9 #.C :*$.
*ard .isk ! CD :&.
+loppy .rive ! ".CC <b.
<onitor ! "= 9:A 6olour.
<ouse ! ,ogitech.
Ram ! #=E <b.
*.9 SO-T/ARE RE8UIREMENTS:
'perating system ! Windows F2 2rofessional
+ront ;nd ! GA9A, (wing(G+6 ,G#<;
Tool ! ;clipse A.A
IT, MITS, 2011
14
*.: SO-T/ARE EN)IRONMENT
(a$a Te!no%ogy
Gava technology is both a programming language and a platform.
T!e (a$a &rogra66ing Lang#age
The Gava programming language is a high3level language that can be
characteri$ed by all of the following bu$$words!
(imple
Architecture neutral
'b)ect oriented
2ortable
.istributed
*igh performance
-nterpreted
<ultithreaded
Robust
.ynamic
(ecure
With most programming languages, you either compile or interpret a program
so that you can run it on your computer. The Gava programming language is unusual
in that a program is both compiled and interpreted. With the compiler, first you
translate a program into an intermediate language called Gava byte codes Hthe
platform3independent codes interpreted by the interpreter on the Gava platform. The
interpreter parses and runs each Gava byte code instruction on the computer.
IT, MITS, 2011
15
6ompilation happens )ust once8 interpretation occurs each time the program is
e/ecuted. The following figure illustrates how this works.
Bou can think of Gava byte codes as the machine code instructions for the Gava 9irtual
<achine (Gava 9<. ;very Gava interpreter, whether it0s a development tool or a Web
browser that can run applets, is an implementation of the Gava 9<. Gava byte codes
help make Iwrite once, run anywhereJ possible. Bou can compile your program into
byte codes on any platform that has a Gava compiler. The byte codes can then be run
on any implementation of the Gava 9<. That means that as long as a computer has a
Gava 9<, the same program written in the Gava programming language can run on
Windows #DDD, a (olaris workstation, or on an i<ac.
T!e (a$a &%at;or6
A platform is the hardware or software environment in which a program runs. We0ve
already mentioned some of the most popular platforms like Windows #DDD, ,inu/,
(olaris, and <ac'(. <ost platforms can be described as a combination of the
operating system and hardware. The Gava platform differs from most other platforms
in that it0s a software3only platform that runs on top of other hardware3based
platforms.
IT, MITS, 2011
16
The Gava platform has two components!
The Gava 9irtual <achine (Gava 9<
The Gava Application 2rogramming -nterface (Gava A2-
Bou0ve already been introduced to the Gava 9<. -t0s the base for the Gava
platform and is ported onto various hardware3based platforms.
The Gava A2- is a large collection of ready3made software components that
provide many useful capabilities, such as graphical user interface (:1- widgets. The
Gava A2- is grouped into libraries of related classes and interfaces8 these libraries are
known as packages. The ne/t section, What 6an Gava Technology .o7 *ighlights
what functionality some of the packages in the Gava A2- provide.
The following figure depicts a program that0s running on the Gava platform. As
the figure shows, the Gava A2- and the virtual machine insulate the program from the
hardware.
4ative code is code that after you compile it, the compiled code runs on a
specific hardware platform. As a platform3independent environment, the Gava
platform can be a bit slower than native code. *owever, smart compilers, well3tuned
interpreters, and )ust3in3time byte code compilers can bring performance close to that
of native code without threatening portability.
/!at Can (a$a Te!no%ogy Do<
The most common types of programs written in the Gava programming
language are applets and applications. -f you0ve surfed the Web, you0re probably
already familiar with applets. An applet is a program that adheres to certain
conventions that allow it to run within a Gava3enabled browser.
*owever, the Gava programming language is not )ust for writing cute,
entertaining applets for the Web. The general3purpose, high3level Gava programming
IT, MITS, 2011
1
language is also a powerful software platform. 1sing the generous A2-, you can write
many types of programs.
An application is a standalone program that runs directly on the Gava platform.
A special kind of application known as a server serves and supports clients on a
network. ;/amples of servers are Web servers, pro/y servers, mail servers, and print
servers. Another speciali$ed program is a servlet. A servlet can almost be thought of
as an applet that runs on the server side. Gava (ervlets are a popular choice for
building interactive web applications, replacing the use of 6:- scripts. (ervlets are
similar to applets in that they are runtime e/tensions of applications. -nstead of
working in browsers, though, servlets run within Gava Web servers, configuring or
tailoring the server.
*ow does the A2- support all these kinds of programs7 -t does so with
packages of software components that provides a wide range of functionality. ;very
full implementation of the Gava platform gives you the following features!
T!e e""entia%"! 'b)ects, strings, threads, numbers, input and output, data
structures, system properties, date and time, and so on.
A55%et"! The set of conventions used by applets.
Net=or1ing! 1R,s, T62 (Transmission 6ontrol 2rotocol, 1.2 (1ser .ata
gram 2rotocol sockets, and -2 (-nternet 2rotocol addresses.
Internationa%i>ation! *elp for writing programs that can be locali$ed for
users worldwide. 2rograms can automatically adapt to specific locales and be
displayed in the appropriate language.
Se#rity! &oth low level and high level, including electronic signatures,
public and private key management, access control, and certificates.
So;t=are o65onent"! Known as Gava&eans
T<
, can plug into e/isting
component architectures.
O3?et "eria%i>ation! Allows lightweight persistence and communication via
Remote <ethod -nvocation (R<-.
IT, MITS, 2011
1!
(a$a Data3a"e Conneti$ity 0(D'C
TM
4! 2rovides uniform access to a wide
range of relational databases.
The Gava platform also has A2-s for #. and A. graphics, accessibility, servers,
collaboration, telephony, speech, animation, and more. The following figure depicts
what is included in the Gava # (.K.
Ho= /i%% (a$a Te!no%ogy C!ange o#r Li;e<
We can0t promise you fame, fortune, or even a )ob if you learn the Gava
programming language. (till, it is likely to make your programs better and re%uires
less effort than other languages. We believe that Gava technology will help you do the
following!
Get "tarte2 @#i1%y! Although the Gava programming language is a powerful
ob)ect3oriented language, it0s easy to learn, especially for programmers
already familiar with 6 or 6KK.
/rite %e"" o2e! 6omparisons of program metrics (class counts, method
counts, and so on suggest that a program written in the Gava programming
language can be four times smaller than the same program in 6KK.
/rite 3etter o2e! The Gava programming language encourages good coding
practices, and its garbage collection helps you avoid memory leaks. -ts ob)ect
orientation, its Gava&eans component architecture, and its wide3ranging, easily
e/tendible A2- let you reuse other people0s tested code and introduce fewer
bugs.
IT, MITS, 2011
1"
De$e%o5 5rogra6" 6ore @#i1%y! Bour development time may be as much as
twice as fast versus writing the same program in 6KK. Why7 Bou write fewer
lines of code and it is a simpler programming language than 6KK.
A$oi2 5%at;or6 2e5en2enie" =it! 1AAB &#re (a$a! Bou can keep your
program portable by avoiding the use of libraries written in other languages.
The "DDL 2ure Gava
T<
2roduct 6ertification 2rogram has a repository of
historical process manuals, white papers, brochures, and similar materials
online.
/rite oneC r#n any=!ere! &ecause "DDL 2ure Gava programs are compiled
into machine3independent byte codes, they run consistently on any Gava
platform.
Di"tri3#te "o;t=are 6ore ea"i%y! Bou can upgrade applets easily from a
central server. Applets take advantage of the feature of allowing new classes to
be loaded Ion the fly,J without recompiling the entire program.
OD'C
<icrosoft 'pen .atabase 6onnectivity ('.&6 is a standard programming
interface for application developers and database systems providers. &efore '.&6
became a de facto standard for Windows programs to interface with database systems,
programmers had to use proprietary languages for each database they wanted to
connect to. 4ow, '.&6 has made the choice of the database system almost irrelevant
from a coding perspective, which is as it should be. Application developers have
much more important things to worry about than the synta/ that is needed to port their
program from one database to another when business needs suddenly change.
Through the '.&6 Administrator in 6ontrol 2anel, you can specify the
particular database that is associated with a data source that an '.&6 application
program is written to use. Think of an '.&6 data source as a door with a name on it.
;ach door will lead you to a particular database. +or e/ample, the data source named
(ales +igures might be a (M, (erver database, whereas the Accounts 2ayable data
source could refer to an Access database. The physical database referred to by a data
source can reside anywhere on the ,A4.
The '.&6 system files are not installed on your system by Windows ?=.
Rather, they are installed when you setup a separate database application, such as
IT, MITS, 2011
20
(M, (erver 6lient or 9isual &asic C.D. When the '.&6 icon is installed in 6ontrol
2anel, it uses a file called '.&6-4(T..,,. -t is also possible to administer your
'.&6 data sources through a stand3alone program called '.&6A.<.;F;. There is
a "E3bit and a A#3bit version of this program and each maintains a separate list of
'.&6datasources.
+rom a programming perspective, the beauty of '.&6 is that the application
can be written to use the same set of function calls to interface with any data source,
regardless of the database vendor. The source code of the application doesn0t change
whether it talks to 'racle or (M, (erver. We only mention these two as an e/ample.
There are '.&6 drivers available for several do$en popular database systems. ;ven
;/cel spreadsheets and plain te/t files can be turned into data sources. The operating
system uses the Registry information written by '.&6 Administrator to determine
which low3level '.&6 drivers are needed to talk to the data source (such as the
interface to 'racle or (M, (erver. The loading of the '.&6 drivers is transparent to
the '.&6 application program. -n a client5server environment, the '.&6 A2- even
handles many of the network issues for the application programmer.
The advantages of this scheme are so numerous that you are probably thinking
there must be some catch. The only disadvantage of '.&6 is that it isn0t as efficient
as talking directly to the native database interface. '.&6 has had many detractors
make the charge that it is too slow. <icrosoft has always claimed that the critical
factor in performance is the %uality of the driver software that is used. -n our humble
opinion, this is true. The availability of good '.&6 drivers has improved a great deal
recently. And anyway, the criticism about performance is somewhat analogous to
those who said that compilers would never match the speed of pure assembly
language. <aybe not, but the compiler (or '.&6 gives you the opportunity to write
cleaner programs, which means you finish sooner. <eanwhile, computers get faster
every year.
(D'C
-n an effort to set an independent database standard A2- for Gava8 (un
<icrosystems developed Gava .atabase 6onnectivity, or G.&6. G.&6 offers a
generic (M, database access mechanism that provides a consistent interface to a
IT, MITS, 2011
21
variety of R.&<(s. This consistent interface is achieved through the use of Iplug3inJ
database connectivity modules, or drivers. -f a database vendor wishes to have G.&6
support, he or she must provide the driver for each platform that the database and Gava
run on.
To gain a wider acceptance of G.&6, (un based G.&60s framework on
'.&6. As you discovered earlier in this chapter, '.&6 has widespread support on a
variety of platforms. &asing G.&6 on '.&6 will allow vendors to bring G.&6
drivers to market much faster than developing a completely new connectivity
solution.
G.&6 was announced in <arch of "??E. -t was released for a ?D day public
review that ended Gune N, "??E. &ecause of user input, the final G.&6 v".D
specification was released soon after.
The remainder of this section will cover enough information about G.&6 for you to
know what it is about and how to use it effectively. This is by no means a complete
overview of G.&6. That would fill an entire book.
(D'C Goa%"
+ew software packages are designed without goals in mind. G.&6 is one that,
because of its many goals, drove the development of the A2-. These goals, in
con)unction with early reviewer feedback, have finali$ed the G.&6 class library into a
solid framework for building database applications in Gava.
The goals that were set for G.&6 are important. They will give you some insight
as to why certain classes and functionalities behave the way they do. The eight design
goals for G.&6 are as follows!
1. S8L Le$e% A&I
The designers felt that their main goal was to define a (M, interface for Gava.
Although not the lowest database interface level possible, it is at a low enough
level for higher3level tools and A2-s to be created. 6onversely, it is at a high
enough level for application programmers to use it confidently. Attaining this goal
allows for future tool vendors to IgenerateJ G.&6 code and to hide many of
G.&60s comple/ities from the end user.
IT, MITS, 2011
22
*. S8L Con;or6ane
(M, synta/ varies as you move from database vendor to database vendor. -n
an effort to support a wide variety of vendors, G.&6 will allow any %uery
statement to be passed through it to the underlying database driver. This allows the
connectivity module to handle non3standard functionality in a manner that is
suitable for its users.
A. (D'C 6#"t 3e i65%e6enta% on to5 o; o66on 2ata3a"e inter;ae"
The G.&6 (M, A2- must IsitJ on top of other common (M, level A2-s. This
goal allows G.&6 to use e/isting '.&6 level drivers by the use of a software
interface. This interface would translate G.&6 calls to '.&6 and vice versa.
.. &ro$i2e a (a$a inter;ae t!at i" on"i"tent =it! t!e re"t o; t!e (a$a "y"te6
&ecause of Gava0s acceptance in the user community thus far, the designers
feel that they should not stray from the current design of the core Gava system.
7. Kee5 it "i65%e
This goal probably appears in all software design goal listings. G.&6 is no
e/ception. (un felt that the design of G.&6 should be very simple, allowing for
only one method of completing a task per mechanism. Allowing duplicate
functionality only serves to confuse the users of the A2-.
9. U"e "trongC "tati ty5ing =!ere$er 5o""i3%e
(trong typing allows for more error checking to be done at compile time8 also,
less error appear at runtime.
:. Kee5 t!e o66on a"e" "i65%e
&ecause more often than not, the usual (M, calls used by the programmer are
simple (;,;6T0s, -4(;RT0s, .;,;T;0s and 12.AT;0s, these %ueries should be
simple to perform with G.&6. *owever, more comple/ (M, statements should
also be possible.
+inally we decided to proceed the implementation using Gava 4etworking.
And for dynamically updating the cache table we go for <( Access
database.
IT, MITS, 2011
23
Gava has two things! a programming language and a platform.
Gava is a high3level programming language that is all of the following
(imple
Architecture3neutral
'b)ect3oriented
2ortable
.istributed
*igh3performance
-nterpreted
<ultithreaded
Robust
.ynamic
(ecure
Gava is also unusual in that each Gava program is both compiled and
interpreted. With a compile you translate a Gava program into an intermediate
language called Gava byte codes the platform3independent code instruction is passed
and run on the computer.
6ompilation happens )ust once8 interpretation occurs each time the program is
e/ecuted. The figure illustrates how this works.
IT, MITS, 2011
24
Bou can think of Gava byte codes as the machine code instructions for the Gava
9irtual <achine (Gava 9<. ;very Gava interpreter, whether it0s a Gava development
tool or a Web browser that can run Gava applets, is an implementation of the Gava 9<.
The Gava 9< can also be implemented in hardware.
Gava byte codes help make Iwrite once, run anywhereJ possible. Bou can
compile your Gava program into byte codes on my platform that has a Gava compiler.
The byte codes can then be run any implementation of the Gava 9<. +or e/ample, the
same Gava program can run Windows 4T, (olaris, and <acintosh.
Net=or1ing
TC&DI& "ta1
The T625-2 stack is shorter than the '(- one!
IT, MITS, 2011
25
(a$a
&rogra6
Co65i%er"
Inter5reter
My &rogra6
T62 is a connection3oriented protocol8 1.2 (1ser .atagram 2rotocol is a
connectionless protocol.
I& 2atagra6E"
The -2 layer provides a connectionless and unreliable delivery system. -t
considers each datagram independently of the others. Any association between
datagram must be supplied by the higher layers. The -2 layer supplies a checksum that
includes its own header. The header includes the source and destination addresses.
The -2 layer handles routing through an -nternet. -t is also responsible for breaking up
large datagram into smaller ones for transmission and reassembling them at the other
end.
IT, MITS, 2011
26
UD&
1.2 is also connectionless and unreliable. What it adds to -2 is a checksum
for the contents of the datagram and port numbers. These are used to give a
client5server model 3 see later.
TC&
T62 supplies logic to give a reliable connection3oriented protocol above -2. -t
provides a virtual circuit that two processes can use to communicate.
Internet a22re""e"
-n order to use a service, you must be able to find it. The -nternet uses an
address scheme for machines so that they can be located. The address is a A#
bit integer which gives the -2 address. This encodes a network -. and more
addressing. The network -. falls into various classes according to the si$e of
the network address.
Net=or1 a22re""
6lass A uses N bits for the network address with #C bits left over for other
addressing. 6lass & uses "E bit network addressing. 6lass 6 uses #C bit
network addressing and class . uses all A#.
S#3net a22re""
-nternally, the 14-F network is divided into sub networks. &uilding "" is
currently on one sub network and uses "D3bit addressing, allowing "D#C
different hosts.
Ho"t a22re""
N bits are finally used for host addresses within our subnet. This places a limit
of #=E machines that can be on the subnet.
Tota% a22re""
IT, MITS, 2011
2
The A# bit address is usually written as C integers separated by dots.
&ort a22re""e"
A service e/ists on a host, and is identified by its port. This is a "E bit number.
To send a message to a server, you send it to the port for that service of the
host that it is running on. This is not location transparencyO 6ertain of these
ports are Pwell knownP.
(ockets
A socket is a data structure maintained by the system to handle network
connections. A socket is created using the call "o1et. -t returns an integer that
is like a file descriptor. -n fact, under Windows, this handle can be used with
Rea2 -i%e and /rite -i%e functions.
Qinclude Rsys5types.hS
Qinclude Rsys5socket.hS
int socket(int family, int type, int protocol8
*ere PfamilyP will be A+T-4;T for -2 communications, protocol will be $ero,
and type will depend on whether T62 or 1.2 is used. Two processes wishing to
communicate over a network create a socket each. These are similar to two ends of a
pipe 3 but the actual pipe does not yet e/ist.
(-ree C!art
G+ree6hart is a free "DDL Gava chart library that makes it easy for developers
to display professional %uality charts in their applications. G+ree6hart>s e/tensive
feature set includes!
A consistent and well3documented A2-, supporting a wide range of chart
types8
A fle/ible design that is easy to e/tend, and targets both server3side and client3
side applications8
(upport for many output types, including (wing components, image files
(including 24: and G2;:, and vector graphics file formats (including 2.+, ;2( and
(9:8
IT, MITS, 2011
2!
G+ree6hart is Popen sourceP or, more specifically, free software. -t is
distributed under the terms of the :41 ,esser :eneral 2ublic ,icense (,:2,, which
permits use in proprietary applications.
1. Ma5 )i"#a%i>ation"
6harts showing values that relate to geographical areas. (ome e/amples
include! (a population density in each state of the 1nited (tates, (b income per
capita for each country in ;urope, (c life e/pectancy in each country of the world.
The tasks in this pro)ect include!
(ourcing freely redistributable vector outlines for the countries of the world,
states5provinces in particular countries (1(A in particular, but also other areas8
6reating an appropriate dataset interface (plus default implementation, a rendered,
and integrating this with the e/isting FB2lot class in G+ree6hart8
Testing, documenting, testing some more, documenting some more.
*. Ti6e Serie" C!art Interati$ity
-mplement a new (to G+ree6hart feature for interactive time series charts 333 to
display a separate control that shows a small version of A,, the time series data, with
a sliding PviewP rectangle that allows you to select the subset of the time series data to
display in the main chart.
,. Da"!3oar2"
There is currently a lot of interest in dashboard displays. 6reate a fle/ible
dashboard mechanism that supports a subset of G+ree6hart chart types (dials,
pies, thermometers, bars, and lines5time series that can be delivered easily via
both Gava Web (tart and an applet.
.. &ro5erty E2itor"
The property editor mechanism in G+ree6hart only handles a small subset of the
properties that can be set for charts. ;/tend (or reimplement this mechanism to
provide greater end3user control over the appearance of the charts.
IT, MITS, 2011
2"
(*ME 0(a$a * Miro e2ition4:F
(un <icrosystems defines G#<; as Pa highly optimi$ed Gava run3time
environment targeting a wide range of consumer products, including pagers, cellular
phones, screen3phones, digital set3top bo/es and car navigation systems.P Announced
in Gune "??? at the Gava'ne .eveloper 6onference, G#<; brings the cross3platform
functionality of the Gava language to smaller devices, allowing mobile wireless
devices to share applications. With G#<;, (un has adapted the Gava platform for
consumer products that incorporate or are based on small computing devices.
1. Genera% (*ME ar!itet#re
G#<; uses configurations and profiles to customi$e the Gava Runtime
;nvironment (GR;. As a complete GR;, G#<; is comprised of a configuration, which
determines the G9< used, and a profile, which defines the application by adding
domain3specific classes. The configuration defines the basic run3time environment as
a set of core classes and a specific G9< that run on specific types of devices. We>ll
discuss configurations in detail in the The profile defines the application8 specifically,
it adds domain3specific classes to the G#<; configuration to define certain uses for
devices. We>ll cover profiles in depth in the The following graphic depicts the
relationship between the different virtual machines, configurations, and profiles. -t
also draws a parallel with the G#(; A2- and its Gava virtual machine. While the G#(;
virtual machine is generally referred to as a G9<, the G#<; virtual machines, K9<
and 69<, are subsets of G9<. &oth K9< and 69< can be thought of as a kind of
IT, MITS, 2011
30
Gava virtual machine 33 it>s )ust that they are shrunken versions of the G#(; G9< and
are specific to G#<;.
*.De$e%o5ing (*ME a55%iation"
-n this section, we will go over some considerations you need to keep in mind
when developing applications for smaller devices. We>ll take a look at the way the
compiler is invoked when using G#(; to compile G#<; applications. +inally, we>ll
e/plore packaging and deployment and the role preverification plays in this process.
,.De"ign on"i2eration" ;or "6a%% 2e$ie"
.eveloping applications for small devices re%uires you to keep certain
strategies in mind during the design phase. -t is best to strategically design an
application for a small device before you begin coding. 6orrecting the code because
you failed to consider all of the PgotchasP before developing the application can be a
painful process. *ere are some design strategies to consider!
Keep it simple. Remove unnecessary features, possibly making those features
a separate, secondary application.
(maller is better. This consideration should be a Pno brainerP for all
developers. (maller applications use less memory on the device and re%uire
shorter installation times. 6onsider packaging your Gava applications as
compressed Gava Archive ()ar files.
<inimi$e run3time memory use. To minimi$e the amount of memory used at
run time, use scalar types in place of ob)ect types. Also, do not depend on the
garbage collector. Bou should manage the memory efficiently yourself by
setting ob)ect references to null when you are finished with them. Another way
to reduce run3time memory is to use la$y instantiation, only allocating ob)ects
on an as3needed basis. 'ther ways of reducing overall and peak memory use
on small devices are to release resources %uickly, reuse ob)ects, and avoid
e/ceptions.
IT, MITS, 2011
31
..Con;ig#ration" o$er$ie=
The configuration defines the basic run3time environment as a set of core
classes and a specific G9< that run on specific types of devices. 6urrently, two
configurations e/ist for G#<;, though others may be defined in the future!
Connete2 Li6ite2 De$ie Con;ig#ration 0CLDC4 is used specifically with
the K9< for "E3bit or A#3bit devices with limited amounts of memory. This is
the configuration (and the virtual machine used for developing small G#<;
applications. -ts si$e limitations make 6,.6 more interesting and challenging
(from a development point of view than 6.6. 6,.6 is also the
configuration that we will use for developing our drawing tool application. An
e/ample of a small wireless device running small applications is a 2alm hand3
held computer.
Connete2 De$ie Con;ig#ration 0CDC4 is used with the 6 virtual machine
(69< and is used for A#3bit architectures re%uiring more than # <& of
memory. An e/ample of such a device is a 4et T9 bo/.
7.(*ME 5ro;i%e"
/!at i" a (*ME 5ro;i%e<
As we mentioned earlier in this tutorial, a profile defines the type of device
supported. The <obile -nformation .evice 2rofile (<-.2, for e/ample, defines
classes for cellular phones. -t adds domain3specific classes to the G#<; configuration
to define uses for similar devices. Two profiles have been defined for G#<; and are
built upon 6,.6! KGava and <-.2. &oth KGava and <-.2 are associated with
6,.6 and smaller devices. 2rofiles are built on top of configurations. &ecause
profiles are specific to the si$e of the device (amount of memory on which an
application runs, certain profiles are associated with certain configurations.
A skeleton profile upon which you can create your own profile, the
+oundation 2rofile, is available for 6.6.
IT, MITS, 2011
32
&ro;i%e 1: K(a$a
KGava is (un>s proprietary profile and contains the KGava A2-. The KGava
profile is built on top of the 6,.6 configuration. The KGava virtual machine, K9<,
accepts the same byte codes and class file format as the classic G#(; virtual machine.
KGava contains a (un3specific A2- that runs on the 2alm '(. The KGava A2- has a
great deal in common with the G#(; Abstract Windowing Toolkit (AWT. *owever,
because it is not a standard G#<; package, its main package is com.sun.k)ava. We>ll
learn more about the KGava A2- later in this tutorial when we develop some sample
applications.
&ro;i%e *: MID&
<-.2 is geared toward mobile devices such as cellular phones and pagers.
The <-.2, like KGava, is built upon 6,.6 and provides a standard run3time
environment that allows new applications and services to be deployed dynamically on
end user devices. <-.2 is a common, industry3standard profile for mobile devices
that is not dependent on a specific vendor. -t is a complete and supported foundation
for mobile application
development. <-.2 contains the following packages, the first three of which are core
6,.6 packages, plus three <-.23specific packages.
)ava.lang
)ava.io
)ava.util
)ava/.microedition.io
)ava/.microedition.lcdui
)ava/.microedition.midlet
)ava/.microedition.rms
IT, MITS, 2011
33
,. SYSTEM DESIGN
,.1 ARCHITECTURAL DIAGRAM:
A wireless data broadcast system consists of three components as depicted in +igure
"! (" the broadcast server8 (# the mobile devices8 and (A the communication
mechanism. The server broadcasts data on air. A user0s mobile device receives the
broadcast information, and filters the subscribed data according to user0s %ueries and
privileges. The specialty of the broadcast system is that (a the server determines the
schedule to broadcast all data on air, and (b users0 mobile devices listen to the
broadcast channel but only retrieve data (filter data out based on users0 %ueries. The
communication mechanism includes wireless broadcast channels and (optional
uplink channels. &roadcast channel is the main mechanism for data +ig. ". A wireless
data broadcast system dissemination. .ata is broadcast periodically so that users can
recover lost or missed data items. The uplink channels, which have limited
bandwidth, are reserved for occasional uses to dynamically change subscriptions.-n
broadcast services, the basic data unit is 2ata ite6, such as a piece of news or a stock
price. .ata items are grouped into 5rogra6" and a user specifies which programs he
would like to access. Typical programs could be weather, news, stock %uotes, etc. +or
simplicity, we assume that each program covers a set of data items, and programs are
e/clusively complete. A user may subscribe to one or more programs. The set of
subscribed programs is called the user0s "#3"ri5tion. 1sers can subscribe via
-nternet or uplink channels to specify the programs that they are interested in
IT, MITS, 2011
34
receiving. 2revious studies on wireless data broadcast services have mainly focused
on performance issues such as reducing data access latency and conserving battery
power of mobile devices. 1nfortunately, the critical security re%uirements of this type
of broadcast service have not yet been addressed, i.e. broadcast service providers need
to ensure backward and forward secrecy with respect to membership dynamics. -n the
wireless broadcast environment, any user can monitor the broadcast channel and
record the broadcast data. -f the data is not encrypted, the content is open to the public
and anyone can access the data. -n addition, a user may only subscribe to a few
programs. -f data in other programs are not encrypted, the user can obtain data beyond
his subscription privilege. *ence, access control should be enforced via encrypting
data in a proper way so that only subscribing users can access the broadcast data, and
subscribing users can only access the data to which they subscribe. (ymmetric3key3
based encryption is a natural choice for ensuring secure data dissemination and
access. The broadcast data can be encrypted so that only those users who own valid
keys can decrypt them. Thus, the decryption keys can be used as an effective means
for access control in wireless # data broadcast services.
IT, MITS, 2011
35
,.* CLASS DIAGRAM:
GH /SN a2!o No2e"
IT, MITS, 2011
36
adhoc 1
display
displayable
stream
stream1
stream2
stream3
stream4
dom
domstatus
txtmsg
txtphone
txtpassword
Shared key
Group key
startApp()
commandAction()
sendon!ess()
send message()
run()
pauseApp()
destroyApp()
encrypt()
decrypt()
"indconnector
stream
in
out
#indonnector()
run()
GH Net=or1 Ser$er
$% Ser&er
ser&er
socket
input
output
mobiles
mobileid
dominator
dominatee
connector
ser&ice()
run()
IT, MITS, 2011
3
,., USE CASE DIAGRAM:

+ig :rouping
+ig -dentification of key groups.
IT, MITS, 2011
3!
'istribution Group key
(ndi&idual )ey
Sub Grouping
(ndi&idual )ey
Generating )eys
'istribution key
(ndi&idual key
Sub Group *eaders
(ndi&idual key
(ndi&idual Sub Groups
-ig Key <anagement
IT, MITS, 2011
3"
onnectors
)ey Generation
)ey 'istribution
)eys ()'))
(ndi&idual keys(('k)
)ey 'istribution
Shared 'istribution )eys
)ey !anagement
,.. ACTI)ITY DIAGRAM:

IT, MITS, 2011
40
Sensor
nodes
(denti"ying
Groups
)ey
!anagement
)ey
Generation
)ey
Agreement
#ormation o" subgroup leaders
and indi&idual sub groups
.. IM&LEMENTATION
-mplementation is the stage of the pro)ect when the theoretical design is turned
out into a working system. Thus it can be considered to be the most critical stage in
achieving a successful new system and in giving the user, confidence that the new
system will work and be effective.
The implementation stage involves careful planning, investigation of the
e/isting system and it0s constraints on implementation, designing of methods to
achieve changeover and evaluation of changeover methods.
..1 MODULES:
". ,ogic Key *ierarchy (,K* based techni%ues
#. &roadcast encryption techni%ues
A. Rekey 'perations
..* LOGICAL KEY HIERARCHY:
(ecure key management for wireless broadcast is closely related to secure
group key management in networking. The data encryption key (.;K of the program
and each represents an individual key (-.K of a user that is only shared between the
system and the user. 'ther keys in the tree, namely key distribution keys (K.Ks,
When a user )oins or leaves the group, the server needs to change and broadcast the
corresponding new keys, and this operation is called rekey, and the broadcast message
of new keys is called rekey message. -n our system, data and rekey messages are
broadcast in the same broadcast channel to the users.
.., 'ROADCAST ENCRY&TION TECHNI8UES:
There are some other key management schemes in the literature for multicast
and broadcast services. 1sed arbitrarily revealed key se%uences to do scalable
multicast key management without any overhead on )oins5leaves. 2roposed two
schemes that insert an inde/ head into packets for decryption. *owever, both of them
re%uire pre3planned subscription, which contradicts the fact that in pervasive
computing and air data access a user may change subscriptions at any moment.
IT, MITS, 2011
41
6ompared with ,K*3based approaches, key management schemes in broadcast
encryption are less fle/ible regarding possible subscriptions.
... REKEY O&ERATIONS:
To issue new keys upon a user event, the main task is to identify the keys that
need to be changed. We use two types of paths in the key forest to represent the to3be3
changed keys. When a user leaves a tree, we say, a leave path is formed, which
consists of keys that the user will no longer use. When a user )oins a tree, we say, an
enroll path is formed, which consists of keys that the user will use in the future.
(imilarly, when a user shifts from one tree to another, a leave path and an enroll path
are formed. -n KTR, a complete path starts from the leaf node and ends at the multiple
.;Ks of the subscribed programs that share the tree. To broadcast new keys, the
server should first compose rekey packets.

IT, MITS, 2011
42
7. SYSTEM TESTING
The purpose of testing is to discover errors. Testing is the process of trying to
discover every conceivable fault or weakness in a work product. -t provides a way to
check the functionality of components, sub assemblies, assemblies and5or a finished
product -t is the process of e/ercising software with the intent of ensuring that the
(oftware system meets its re%uirements and user e/pectations and does not fail in an
unacceptable manner. There are various types of test. ;ach test type addresses a
specific testing re%uirement.
7.1 TY&ES O- TESTS
7.1.1 UNIT TESTING
1nit testing involves the design of test cases that validate that the internal
program logic is functioning properly, and that program inputs produce valid outputs.
All decision branches and internal code flow should be validated. -t is the testing of
individual software units of the application .it is done after the completion of an
individual unit before integration. This is a structural testing, that relies on knowledge
of its construction and is invasive. 1nit tests perform basic tests at component level
and test a specific business process, application, and5or system configuration. 1nit
tests ensure that each uni%ue path of a business process performs accurately to the
documented specifications and contains clearly defined inputs and e/pected results.
7.1.* INTEGRATION TESTING:
-ntegration tests are designed to test integrated software components to
determine if they actually run as one program. Testing is event driven and is more
concerned with the basic outcome of screens or fields. -ntegration tests demonstrate
that although the components were individually satisfaction, as shown by successfully
unit testing, the combination of components is correct and consistent. -ntegration
testing is specifically aimed at e/posing the problems that arise from the
combination of components.
IT, MITS, 2011
43
7.1., -UNCTIONAL TESTING:
+unctional tests provide systematic demonstrations that functions tested are
available as specified by the business and technical re%uirements, system
documentation, and user manuals.
+unctional testing is centered on the following items!
9alid -nput ! identified classes of valid input must be accepted.
-nvalid -nput ! identified classes of invalid input must be re)ected.
+unctions ! identified functions must be e/ercised.
'utput ! identified classes of application outputs must be e/ercised.
(ystems52rocedures ! interfacing systems or procedures must be invoked.
'rgani$ation and preparation of functional tests is focused on re%uirements,
key functions, or special test cases. -n addition, systematic coverage pertaining to
identify &usiness process flows8 data fields, predefined processes, and successive
processes must be considered for testing. &efore functional testing is complete,
additional tests are identified and the effective value of current tests is determined.
7.1.. SYSTEM TESTING:
(ystem testing ensures that the entire integrated software system meets
re%uirements. -t tests a configuration to ensure known and predictable results. An
e/ample of system testing is the configuration oriented system integration test.
(ystem testing is based on process descriptions and flows, emphasi$ing pre3driven
process links and integration points.
7.1.7 /HITE 'O+ TESTING:
White &o/ Testing is a testing in which in which the software tester has
knowledge of the inner workings, structure and language of the software, or at least its
purpose. -t is purpose. -t is used to test areas that cannot be reached from a black bo/
level.
IT, MITS, 2011
44
7.1.9 'LACK'O+ TESTING:
&lack &o/ Testing is testing the software without any knowledge of the inner
workings, structure or language of the module being tested. &lack bo/ tests, as most
other kinds of tests, must be written from a definitive source document, such as
specification or re%uirements document, such as specification or re%uirements
document. -t is a testing in which the software under test is treated, as a black bo/
.you cannot IseeJ into it. The test provides inputs and responds to outputs without
considering how the software works.
7.* UNIT TESTING:
1nit testing is usually conducted as part of a combined code and unit test
phase of the software lifecycle, although it is not uncommon for coding and unit
testing to be conducted as two distinct phases.
Te"t "trategy an2 a55roa!
+ield testing will be performed manually and functional tests will be written in
detail.
Te"t o3?eti$e"
All field entries must work properly.
2ages must be activated from the identified link.
The entry screen, messages and responses must not be delayed.
-eat#re" to 3e te"te2
9erify that the entries are of the correct format
4o duplicate entries should be allowed
All links should take the user to the correct page.
IT, MITS, 2011
45
7., INTEGRATION TESTING:
(oftware integration testing is the incremental integration testing of two or
more integrated software components on a single platform to produce failures caused
by interface defects.
The task of the integration test is to check that components or software
applications, e.g. components in a software system or U one step up U software
applications at the company level U interact without error.
Te"t Re"#%t": All the test cases mentioned above passed successfully. 4o
defects encountered.
7.. ACCE&TANCE TESTING:
1ser Acceptance Testing is a critical phase of any pro)ect and re%uires
significant participation by the end user. -t also ensures that the system meets the
functional re%uirements.
Te"t Re"#%t": All the test cases mentioned above passed successfully. 4o
defects encountered.
IT, MITS, 2011
46
9.OUT&UT SCREENS
IT, MITS, 2011
4
IT, MITS, 2011
4!
IT, MITS, 2011
4"
IT, MITS, 2011
50
IT, MITS, 2011
51
IT, MITS, 2011
52
IT, MITS, 2011
53
IT, MITS, 2011
54
:. CONCLUSION AND -UTURE
ENHANCEMENTS
-n this work, we investigated the issues of key management in support of
secure wireless broadcast services. We proposed KTR as a scalable, efficient and
secure key management approach in the broadcast system. We used the key forest to
e/ploit the overlapping nature between users and programs in broadcast services.
KTR let multiple programs share a single tree so that the users subscribing these
programs can hold fewer keys. -n addition, we proposed a novel shared key
management approach to further reduce rekey cost by identifying the minimum set of
keys that must be changed to ensure broadcast security.
This approach is also applicable to other ,K*3based approaches to reduce the
rekey cost as in KTR. 'ur simulation showed that KTR can save about C=L of
communication overhead in the broadcast channel and about =DL of decryption cost
for each user, compared with the traditional ,K* approach.
IT, MITS, 2011
55
I.'I'ILOGRA&HY AND A'RE)ATIONS
:ood Teachers are worth more than thousand books, we have them in 'ur .epartment
1. A33re$iation"
OO&S O3?et Oriente2 &rogra66ing Cone5t"
TC&DI& Tran"6i""ion Contro% &rotoo%DInternet &rotoo%
(D'C (a$a Data 'a"e Conneti$ity
EIS Enter5ri"e In;or6ation Sy"te6"
'IOS 'a"i In5#tDo#t5#t Sy"te6
(NDI (a$a Na6ing an2 Diretory Inter;ae
ORD'MS O3?et Re% ati ona% Data3a"e Manage6ent Sy"te6
KTR 1ey tree re#"e 0KTR4
KDK 1ey 2i"tri3#tion 1ey" 0KDK"4
IT, MITS, 2011
56
II.RE-ERENCES
". G. Fu, .. ,ee, M. *u, and W.36. ,ee, I.ata broadcast,J in *andbook of
Wireless 4etworks and <obile 6omputing, -. (to)menovic, ;d. 4ew Bork!
Gohn Wiley and (ons, #DD#, pp. #CAU#E=.
#. .. Wallner, ;. *arder, and R. Agee, IKey management for multicast! issues
and architectures,J -;T+ R+6 #E#@, "???.
A. G. (noeyink, (. (uri, and :. 9arghese, IA lower bound for multicast key
distribution,J in -;;; -nfocom, vol. ", #DD", pp. C##UCA".
C. (. <ittra, I-olus! a framework for scalable secure multicasting,J in A6<
(-:6'<<, vol. #@@3#NN, "??@.
=. 6. K. Wong, <. :ouda, and (. (. ,am, I(ecure group communications
using key graphs,J in A6< (-:6'<<, "??N, pp. ENU@?.
E. B. Kim, A. 2errig, and :. Tsudik, I(imple and fault3tolerant key agreement
for dynamic collaborative groups,J in A6< 66(, #DDD, pp. #A=U#CC.
@. (. (etia, (. Koussih, (. Ga)odia, and ;. *arder, IKronos! a scalable group re3
keying approach for secure multicast,J in -;;; (ymposium on (ecurity and
2rivacy, #DDD, pp. #"=U##N.
N. B. R. Bang, F. (. ,i, F. &. Vhang, and (. (. ,am, IReliable group rekeying!
a performance analysis,J in A6< (-:6'<<, #DD", pp. #@U AN.
?. <. 'nen and R. <olva, IReliable group rekeying with a customer
perspective,J in -;;; :,'&;6'<, vol. C, #DDC, pp. #D@#U#D@E.
"D. &. &riscoe, I<arks! $ero side effect multicast key management using
arbitrarily revealed key se%uences,J in 4:6, "???, pp. AD"UA#D.
"". A.Wool, IKey management for encrypted broadcast,J A6< Transactions on
-nformation and (ystem (ecurity, vol. A, no. #, pp. "D@ "AC, #DDD.
"#. <. Gust, ;. Kranakis, .. Kri$anc, and 2. v. 'orschot, I'n key distribution
via true broadcasting,J in A6< 66(, "??C, pp. N"UNN.
IT, MITS, 2011
5
"A. <. ,uby and G. (taddon, I6ombinatorial bounds for broadcast encryption,J
in Advances in 6ryptology, ;urocrypt, "??N, pp. ="#U=#E.
A. +iat and <. 4aor, I&roadcast encryption,J in Advances in 6ryptology,
6RB2T', "??C, pp. CNDUC?".
&. &lundo and A. 6resti, I(pace re%uirements for broadcast encryption,J in
Advances in 6ryptology, ;urocrypt, "??C, pp. C@"UCNE.
6. 4aor, <. 4aor, and G. &. ,otspiech, IRevocation and tracing schemes for
stateless receivers,J in Advances in 6ryptology, 6RB2T', #DD", pp. C"UE#.
"C. I4orth american mpeg3# information,J http!55www.coolstf.com5mpeg5.
"=. I-rdeto access,J http!55www.irdeto.com5inde/.html, #DDE.
"E. <arkus :. Kuhn, IAnalysis of the nagravision video scrambling method,J
1niversity of 6ambridge, Tech. Rep., "??N.
"@. I9iaccess,J http!55www.viaccess.com5en5, #DDE.
"N. I4ds videoguard! (ecurity, fle/ibility, and growth,J
http!55www.ndsworld.com 5conditional access5conditional access.html, #DDE.
"?. R. 6anetti, G. :aray, :. -tkis, .. <icciancio, <. 4aor, and &. 2inkas,
I<ulticast security! a ta/onomy and some efficient constructions,J in -;;;
-nfocom, vol. #, "???, pp. @DNU@"E.
IT, MITS, 2011
5!
SITES RE-ERRED:
http!55)ava.sun.com
http!55www.sourcefordgde.com
http!55www.networkcomputing.com5
http!55www.roseindia.com5
http!55www.)ava#s.com5
IT, MITS, 2011
5"

KTR docuMEW

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

KTR docuMEW

Uploaded by

Copyright:

Available Formats

AN EFFICIENT KEY MANAGEMENT SCHEME (KTR) FOR SECURE DATA ACCESS

CONTROL IN WIRELESS BROADCAST SERVICES

AN EFFICIENT KEY MANAGEMENT SCHEME (KTR) FOR SECURE DATA ACCESS

You might also like