An Access Control-Based Authenticated Signature using Dual Secret Key Partha Protim Mondal # , Dipa Mondal * ,Prasenjit Maiti % # Computer Science & Engineering Mallabhum Institute of Technology iampartha19apr@gmail.com * Computer Science & Engineering Birbhum Institute of Technology dipa10sep@gmail.com % Computer Science & Engineering Mallabhum Institute of Technology prasenjitmaiti.cse@gmail.com Abstract— Access control is the ability to permit or deny the use of a particular resource by a particular entity. Access control mechanisms can be used in managing physical resources (such as a movie theater, to which only ticketholders should be admitted), logical resources (a bank account, with a limited number of people authorized to make a withdrawal), or digital resources (for example, a private text document on a computer, which only certain users should be able to read).[7] Access control of data in a workflow system had an increasing trend with the improvement of information technology. Authentication by username and password is only part of the story. Frequently we want to let people in based on something other than who they are. Something such as where they are coming from. Restricting access based on something other than the identity of the user is generally referred to as Access Control. Electronic Key Management is an area within (and possibly integrated with) an access control system which concerns the managing of possession and location of small assets or physical (mechanical) keys.Both academic and industrial fields have seriously concerned the issue about the protection of information security from the unauthorized users. Electronic signature implementations on workflow documents provide rapidness to the transactions and guarantees a certain security level as far as the signature scheme possesses. Unfortunately, in practice, it is not as easy as it sounds. Authentic Signatures are ones that have not been tampered with and are received exactly as issued by a node. We are here proposed a new hierarchical signature scheme as a solution for the signature authorization problem. The scheme is based on association of the authentic signature. Keywords— Access Control, Authorization, Signature schemes, Key Management, Controlling Authority, Token, Hashing , Session key, Dual Secret Key. I. INTRODUCTION Electronic signature applications substitutes traditional handwritten signatures to support security services and speed up the document workflow. Electronic signature deals with the documents in case of authorization, authentication and integrity. Understanding the term “hierarchy” will be a good starting point while dealing with signatures in hierarchical structured organizations. Hierarchies denote a singular/group of power at the top, a structure made up of different levels like a company organization chart. The higher levels have control or precedence over the lower levels. Hierarchical structures are a one-to-many relationship; each item having one or more items below it. Hierarchy originally meant "rule by priests", and it is from the organization of hierarchical churches such as the Roman Catholic and Eastern Orthodox churches that the name of this concept arises. A hierarchical structure is such that every entity in the structure, except one, is subordinate to a single other entity. [7] In many situations, the hierarchical systems can be represented by a partially ordered set (poset). The access control problems in a computer communication system are generally formed as a user hierarchy. In the way, the users and their data are organized into a number of disjointed sets of security classes, and each user is assigned to a security class called the user’s security clearance. Let SC 1 ; SC 2 ; ...; SC n be n disjointed security classes and ‘‘ ≤ ’’ be a binary partially- ordered relationship in the set SC = { SC 1 ; SC 2 ; ...; SC n }. In the partially-ordered set (poset), SC j ≤ SC i indicates that the users in security class SC i have a security clearance higher than or equal to those in security class SC j . In other words, the users in the security class SC i are authorized to read or store the data that belongs to the users in security class SC j ; in contrast, SC j cannot read or store those to SC i . Fig.1 shows an example of the poset in a user hierarchy. The arrowhead in the figure indicates a relationship that the higher-level security class is authorized with the security clearance higher than the lower-level one. The statement SC j ≤ SC i means that SC i is the predecessor of SC j and SC j the successor of SC i . Furthermore, if there is no other security class SC k in SC so that SC j ≤ SC k ≤ SC i , then SC i is called the immediate predecessor of SC j , and SC j the immediate successor to SC i . Fig.1. Poset in a user hierarchy The scheme associates the new authorization/position information to an already employed one to generate a new “authorized” signature. A straightforward access control scheme for poset hierarchy is to assign each class with a key, and let a class have the keys of all its successors. The information belonging