IDENTIFICATION OF PROBLEM STATEMENT

It is a constant complaint among those who evaluate proposals that the most frequent deficiency
noted by them is the lack of a clear problem statement to define and guide the inquiry. The issue
of how to write a problem statement becomes important.
WHAT IS A PROBLEM STATEMENT?
A problem statement is the description of an issue currently existing which needs to be
addressed. It provides the context for the research study and generates the questions which the
research aims to answer. The statement of the problem is the focal point of any research. A good
problem statement is just one sentence (with several paragraphs of elaboration). For example it
could be:
"The frequency of job layoffs is creating fear, anxiety, and a loss of productivity in middle
management workers."
While this problem statement is just one sentence, it should be accompanied by a few paragraphs
that elaborate on the problem. The paragraphs could cover present persuasive arguments that
make the problem important enough to study. They could include the opinions of others
(politicians, futurists, other professionals); explanations of how the problem relates to business,
social or political trends via presentation of data that demonstrates the scope and depth of the
problem.
A well articulated statement of the problem establishes the foundation for everything to follow in
the proposal and will render less problematic most of the conceptual, theoretical and
methodological obstacles typically encountered during the process of proposal development.
This means that, in subsequent sections of the proposal, there should be no surprises, such as
categories, questions, variables or data sources that come out of nowhere: if it can't be found in
the problem section, at least at the implicit level, then it either does not belong in the study or the
problem statement needs to be re-written.
WHAT ARE KEY COMPONENTS OF THE STATEMENT PROBLEM?
Problem statements often have three elements:
1. The problem itself, stated clearly and with enough contextual detail to establish why it is
important
2. The method of solving the problem, often stated as a claim or a working thesis
3. The purpose, statement of objective and scope of the project being proposed.

These elements should be brief so that the reader does not get lost. One page is enough for a
statement problem.
HOW TO WRITE THE STATEMENT PROBLEM
The problem statement implies some question that your research will be answering. Sometimes
it is necessary to draft or pre-write for a while to discover what that point will be (and often
writers are unsure of their point until they have written the draft proposal and discover the point
near the end of the proposal).
When you set up to write a statement problem you should know that you are looking for
something wrong or something that needs close attention. Your problem statement is the
statement that makes a point about the issues and information you are discussing, and is what the
rest of the proposal hinges upon. It is not just your topic, but what you are saying about your
topic. In other words there must be very good communication between your topic and the
statement problem.
COMPILATION OF LITERATURE REVIEW
It is a critical and evaluative account of what has been published on a chosen research topic.
Its purpose is to summaries, synthesize and analyze the arguments of others. (It is not an
academic research paper, the main purpose of which is to support your own argument.)
You should describe and analyze the knowledge that exists and what gaps occur in research
related to your field of interest. (This should clarify the relationship between your own research
and the work that has previously been done.)
It should reveal similarities and differences, consistencies and inconsistencies and controversies
in previous research.
PROJECT PROBLEM STATEMENT FEASIBILITY ASSESSMENT USING NP-HARD
AND NP-COMPLETE.
What is P?
-If there is a fast solution to the search version of a problem then the problem is said to be
Polynomial-time or P for short.
What is NP?

-If there is a fast solution to the verification version of a problem then the problem is said to be
Non-deterministic Polynomial-time or NP for short.
What is NP-Complete?
-Some problems in NP- Hard are actually not themselves in NP; the group of problems that are
in both NP and NP-Hard is called NP-Complete.
What is NP-Hard?
-There are some problems that every single problem in NP can be translated into, and a fast
solution to such a problem would automatically give us a fast solution to every problem in NP.
This group of problems are known as NP-Hard
What steps do we have to take to prove a problem Q is NP-Complete?
Pick a known NP-Complete problem P
Reduce P to Q
Describe a transformation that maps instances of P to instances of Q, s.t. yes
for Q = yes for P
Prove the transformation works
Prove it runs in polynomial time

NP hard and NP Complete for

our
problem
Certainty
Analysis of Algorithm:

FEASIBILITY STUDY
Feasibility is the determination of whether or not a project is worth
doing. The process followed in making this determination is called feasibility Study. This type of
study if a project can and should be taken. In the conduct of the feasibility study, the analyst will
usually consider seven distinct, but inter-related types of feasibility.
Technical Feasibility
This is considered with specifying equipment and software that will successful satisfy the user
requirement the technical needs of the system may vary considerably but might include
-

The facility to produce outputs in a given time.

Response time under certain conditions.

Ability to process a certain column of transaction at a particular speed.

Mathematical model
Let G0 be a multiplicative cyclic group of prime order p and g be its generator. The bilinear map
e is defined as follows:
e : G0 G0 GT, where GT is
the co domain of e. The bilinear map e has the following properties:
u, v G0 and a, b Zp, e(ua, vb) = e(u, v)ab (bilinearity);
for all u, v G0, e(u, v) = e(v, u) (symmetry);
and e(g, g) _= 1 (non-degeneracy).

Definition 1: The Decisional Bilinear Diffie-Hellman (DBDH) problem in group G0 of prime

order p with generator g is defined as follows: on input g, ga, gb, gc G0 and e(g, g)z GT,
where a, b, c Zp, decide whether
e(g, g)z = e(g, g)abc.
The security of many ABE schemes and ours rely on the assumption that no probabilistic
polynomial time lgorithms can solve the DDH or DBDH problem with non-negligible advantage
(DDH assumption and DBDH assumption). This assumption is reasonable since discrete
logarithm problems in large number field are widely considered to be intractable, and the groups
we chose are cyclic multiplicative groups of prime order, in which DBDH problems are believed
to be hard.
We introduce the Lagrange coefficient ^i,S for i Zp and a set, S, of elements in Zp: _i,S (x)
:= _jS, j _=I [ xj/ ij] , which will be used in the polynomial interpolation in the decryption
algorithm. Additionally, a one-way hash function
H : {0, 1} G0 is defined as a random oracle, which maps any attribute value
to a random element in Zp.
Trees Tp
In our work, encryption policy is described with a tree called access tree. Each non-leaf node of
the tree is a threshold gate, and each leaf node is described by an attribute. One access tree is
required in every data file to define the encryption policy.
In this project, we extend existing schemes by generalizing the access tree to a privilege tree. The
privilege in our scheme is defined as similar to the privileges managed in ordinary operating
systems. A data file has several operations executable on itself, and each of them is allowed only
to authorized users with different level of qualifications. For example, {Read_mine, Read_all,
Delete, Modify, Create} is a privileges set of students grades. Then, reading Alices grades is
allowed to her and her professors, but all other privileges should be authorized only to the
professors, so we need to grant the Read_mine to Alice and all other to the professors.
Every operation is associated with one privilege p, which is described by a privilege tree Tp. If a
users attributes
satisfy Tp, he is granted the privilege p. By doing so, we not only control the file access but also
control other executable operations, which makes the file controlling fine-grained and thus
suitable for cloud storage service.
In our scheme, several trees are required in every data file to verify users identity and to grant
him a privilege accordingly. There are supposed to be r these kind of structures, which means
there are r different privileges defined for the corresponding data file. The privilege 0 is defined
as the privilege to read the file, and other privileges may be defined arbitrarily (the m-th privilege
does not necessarily have more powerful privilege than the n-th one when m > n). The tree is
similar to the one defined in [4]. Given a tree, if numx is the number of the node xs children
node and kx is its threshold value 0 < kx numx , then node x is assigned a true value if at least

kx children nodes have been assigned true value. Specially, the node becomes an OR gate when
kx = 1 and an AND gate when kx = numx .
B. Satisfying the Privilege Tree If a users attributes set S satisfies the privilege tree Tp or the
node x, we define it as Tp(S) = 1 or x(S) = 1 respectively. Tp(S) is calculated recursively as
follows. If x is a leaf node, x(S) = 1 if and only if att (x) S. If x is a non-leaf node, x(S) = 1 only
when at least kx child nodes return 1.
For the root node Rp of Tp, p(S) = 1 only if Rp(S) = 1.

2) Keygenerate(PK, MKk, Au) When a new user u with GIDu wants to join the system, he
requests the private key from all of the authorities by following this process which is composed
of two phases.
1) Attribute Key Generation: For any attribute i Au, every Ak randomly picks ri Zp to
individually compute the partial private keys H(att (i ))ri, D I = gri, which are privately sent to
the user u.
Then, each authority Ak randomly picks dk Zp, computes xk gvk gdk and privately shares it
with other authorities
(i.e. kept secret to the user u). Then, he privately sends xk gdk to the user u (i.e. kept secret to
other authorities).
Any one of N authorities computes and sends the following term to the user u:
D = _xkgvk gdk = g_vk+_dk
where g_vk acts as a system-wide master key used to generate a valid secret key, but no single
authority is able to infer its value. A valid D with a valid g_vk can be achieved only when all the
authorities correctly follow the protocol and conduct a joint computation. Then, the user
computes the following term which is the
attribute key for the attribute i (att (i ) refers to the element in
G0 corresponding to i ):
Di = H(att (i ))ri _(xk gdk ) = H(att (i ))ri g(_dk )
Note that Di is computed securely without disclosing individual gdk s to the user or disclosing
g_dk to any attribute
authority. This is very important in the tolerance to the compromise attack
The Diffie-Hellman (DBDH) problem NP type. Because we can get & verify the solution set.
Conclusion: - From above description we can conclude that the major process in this session
Diffie-Hellman (DBDH) problem used for Secure key Distribution and Key generation , which
is Already stated as NP Complete. Hence the whole system comes in category of NP complete
problems.