• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.6
• /
• pp.1-10
• /
• 2021

The interest in underwater acoustic sensor networks (UWASNs), along with the rapid development of underwater industries, has increased. To operate UWASNs efficiently, it is important to adopt well-designed medium access control (MAC) protocols that prevent collisions and allow the sharing of resources between nodes efficiently. On the other hand, underwater channels suffer from a narrow bandwidth, long propagation delay, and low data rate, so existing terrestrial node pairing schemes for non orthogonal multiple access (NOMA) cannot be applied directly to underwater environments. Therefore, a multi-dimensional node pairing scheme is proposed to consider the unique underwater channel in UWASNs. Conventional NOMA schemes have considered the channel quality only in node pairing. Unlike previous schemes, the proposed scheme considers the channel gain and many other features, such as node fairness, traffic load, and the age of data packets to find the best node-pair. In addition, the sender employs a list of candidates for node-pairs rather than path loss to reduce the computational complexity. The simulation results showed that the proposed scheme outperforms the conventional scheme by considering the fairness factor with 23.8% increases in throughput, 28% decreases in latency, and 5.7% improvements in fairness at best.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.104-115
• /
• 2010

Development of the system which provides services using diverse sensors is expanding due to the widespread use of ubiquitous technology, and the research on the security technologies gaining attention to solve the vulnerability of ubiquitous environment's security. However, there are many instances in which flexible security services should be considered instead of strong only security function depending on the context. This paper used Fuzzy algorithm and MAUT to be aware of the diverse contexts and to propose context-aware security service which provides flexible security function according to the context.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3623-3632
• /
• 2000

Until now the XML document is allowed users to access the whole content of it However, for some applications such as those in the field of electronic commerce, there are cases that the whole content should not be delivered. Therefore, access authorization is required for XML documents in order to protect illegal accesses to some critical parts of them. In this paper. we design and implement a system which authorizes users to XML documents and controls access to them based on the access rights. We set the user group as a basic unit of the authorization subject and the element of an XML document as a basic unit of authorization object The owner of a document authorize; user groups to access the elements of it When an XML document is accessed, the access rights of the requester are checked using an access control list and only the authorized parts are delivered_ As the result, we can authorize XML documents, which has been previously impossible.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.298-301
• /
• 2002

다중레벨보안은 하나의 시스템 내에 여러 보안등급의 데이터와 사용자를 수용하여 효율성을 높이기 위한 것이다. 본 논문에서는 네트워크를 통해서 여러 보안등급의 데이터가 저장된 디렉토리 서버에 다중레벨의 사용자들의 접근을 통제하기위한 방안을 제시하고 구현한다. 보안과 무결성 모두를 보장해주기 위해서 보안 모델과 무결성 모델을 결합한 새로운 형태의 모델을 정의한다. 이 모델을 OpenLDAP의 ACL(Access Control List)을 사용하여 구현하고 사용자의 등급에 따른 시스템의 접근통제를 가능하게 한다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.495-498
• /
• 2010

본 논문에서는 외부 클라이언트가 홈 네트워크 시스템을 컨트롤 하기위하여 홈 네트워크의 보안요소 중 사용자 인증과 접근제어에 관하여 연구 하였으며 사용자 인증의 인증서는 X.509 v3의 인증서를 기반으로 사용하고 X.509 v3의 확장영역에 사용자의 그룹을 나누어 디바이스를 제어하고 접근이 제한된 디바이스는 ACL(Access Control List)을 추가하여 접근제어를 하는 방법으로 접근이 제한된 사용자와 이를 관리하는 관리자로 나누어 각 디바이스에 대한 접근제안과 외부 공격으로 부터의 안전하게 보호할 수 있게 제안한 논문이다.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1367-1374
• /
• 2004

For sharing XML data by many users, a way of concurrency and access control is required for isolating update actions such as inserting and deleting subtrees. Exisiting locking mechanisms as 2PL or MGL suffer low concurrency when applied to tree structures. In this paper, list data subtrees model is proposed based on the semantics expressed in DTD. In this model, tree updating actions such as inserting and deleting subtrees are considered only for the repetitive parts of XML trees. The proposed model guarantees that the result XML tree after applying a tree updating action is always valid, even when multiple users access the tree at the same time. Also, a new locking mechanism called list lock-ing protocol is proposed. The new locking protocol is expected to show better accessility with less number of locking objects compared to the Helmer's OO2PL model. Since update actions on a shared XML tree usually applied to the repetitive parts of the tree, the proposed model is expected to provide a useful way for efficient data sharing when combined with previous locking methods on terminal node data.

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2024

Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3219-3237
• /
• 2019

The Cloud Computing is growing rapidly in the current IT industry. Cloud computing has become a buzzword in relation to Grid & Utility computing. It provides on demand services to customers and customers will pay for what they get. Various "Cloud Service Provider" such as Microsoft Azure, Google Web Services etc. enables the users to access the cloud in cost effective manner. However, security, privacy and integrity of data is a major concern. In this paper various security challenges have been identified and the survey briefs the comprehensive overview of various security issues in cloud computing. The classification of security issues in cloud computing have been studied. In this paper we have discussed security challenges in cloud computing and also list recommended methods available for addressing them in the literature.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1087-1101
• /
• 2020

Various security devices are used to protect internal networks and valuable information from rapidly evolving cyber attacks. Firewall, which is the most commonly used security device, tries to prevent malicious attacks based on a text-based filtering rule (i.e., access control policy), by allowing or blocking access to communicate between inside and outside environments. However, in order to protect a valuable internal network from large networks, it has no choice but to increase the number of access control policy. Moreover, the text-based policy requires time-consuming and labor cost to analyze various types of vulnerabilities in firewall. To solve these problems, this paper proposes a 3D-based hierarchical visualization method, for intuitive analysis and management of access control policy. In particular, by providing a drill-down user interface through hierarchical architecture, Can support the access policy analysis for not only comprehensive understanding of large-scale networks, but also sophisticated investigation of anomalies. Finally, we implement the proposed system architecture's to verify the practicality and validity of the hierarchical visualization methodology, and then attempt to identify the applicability of firewall data analysis in the real-world network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1286-1306
• /
• 2022

Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.