• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.121-124
• /
• 2007

This article describes a function and structure of access network equipment under BcN environment. Access network until now have constructed separately to offer voice, data service. However, simplifies network structure, function that can do traffic concentration, subscriber certification, individual charging, QoS according to service and routing is required in BcN. In this paper, compare method offering by separate system with existing access network and method that offer integrating function inside system for structure of suitable access network to BcN and search structure of access network equipment for desirable access network of hereafter. Composition of this paper is as following. In Chapter 2, establishment history and structure of access network until present. In Chaprte 3, define suitable requirement and functions to BcN. And compare structure for access net work that is new with present. Last Chapter 4, suggests direction of structure of BcN access network and concludes conclusion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1315-1329
• /
• 2018

Ciphertext-policy attribute-based encryption (CP-ABE) associates ciphertext with access policies. Only when the user's attributes satisfy the ciphertext's policy, they can be capable to decrypt the ciphertext. Expressivity and security are the two directions for the research of CP-ABE. Most of the existing schemes only consider monotonic access structures are selectively secure, resulting in lower expressivity and lower security. Therefore, fully secure CP-ABE schemes with non-monotonic access structure are desired. In the existing fully secure non-monotonic access structure CP-ABE schemes, the attributes that are set is bounded and a one-use constraint is required by these projects on attributes, and efficiency will be lost. In this paper, to overcome the flaw referred to above, we propose a new fully secure non-monotonic access structure CP-ABE. Our proposition enforces no constraints on the scale of the attributes that are set and permits attributes' unrestricted utilization. Furthermore, the scheme's public parameters are composed of a constant number of group elements. We further compare the performance of our scheme with former non-monotonic access structure ABE schemes. It is shown that our scheme has relatively lower computation cost and stronger security.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.8 no.1
• /
• pp.11-30
• /
• 2004

Access Control is one of essential branches to provide system's security. Depending on what standards we apply, in general, there are Role-based access control, History-based access control. The first is based on subject's role, The later is based on subject's history. In fact, RBAC has been implemented, we are using it by purchasing some orders through the internet. But, HBAC is so complex that there will occur some errors on the system. This is more and more when HBAC is used with other access controls. So HBAC's formalization and model which are general enough to encompass a range of policies in using more than one access control model within a given system are important. To simplify these, we design the mathematical model called non-access structure. This Non-access structure contains to historical access list. If it is given subjects and objects, we look into subject grouping and object relation, and then we design Non-access structure. Then we can determine the permission based on history without conflict.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.407-410
• /
• 2013

Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. In this paper, an access structure can be represented by a label graph G, where a vertex denotes a participant and a complete subgraph of G corresponds to a minimal authorized subset. The vertices of G are labeled into distinct vectors uniquely determined by the maximum prohibited structure. Based on such a label graph, a verifiable secret sharing scheme realizing general access structures is proposed. A major advantage of this scheme is that it applies to any access structure, rather than only structures representable as previous graphs, i.e., the access structures of rank two. Furthermore, verifiability of the proposed scheme can resist possible internal attack performed by malicious participants, who want to obtain additional shares or provide a fake share to other participants.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.133-137
• /
• 2002

대량의 컨텐츠에 대한 정보 관리 및 잦은 사이트 변화에 따른 퍼블리케이션의 용이성으로 CMS(Contents Management System)의 도입이 많이 이루어지고 있다. 본 논문에서는 CMS의 백앤드와 프론트 엔드를 연결하는 Access Structure 에 관해 고찰해보고, 이를 통해 시스템의 컨텐츠 검색을 효율적으로 지원할 수 있는 방안과 카테고리 수의 무분별한 증가를 막고자 하며, 퍼블리케이션에서의 확장된 아키텍쳐를 지원하기 위한 모델을 제안하고자 한다.

• Journal of the Korean housing association
• /
• v.20 no.5
• /
• pp.9-21
• /
• 2009

This study classified visual perception types of access space at 17 five-star hotels in Jejudo and examined their cognitive characteristics and image formation structures in an effort to provide basic information important for designing the elevation and the access spaces of a hotel. The results of this study are as follows. Access space image of experimental hotels showed more negative evaluations at both city hotels and resort hotels, viewing angle (upward angle) was also positively evaluated between $10^{\circ}{\sim}12^{\circ}$ and $18^{\circ}$ and central type in arrangement type and detour access and straight access types in access circulation type were positively evaluated. When viewed from an upward angle of $10^{\circ}$ to $12^{\circ}$, the most important factors were as plasticity, decorativeness, and creativity; from $18^{\circ}$ it was such factors as harmony and peculiarity; and at $45^{\circ}$ it was factors like decorativeness and stability. In considering the various access types, the most important factors in a straight access type were peculiarity and harmony; for one-time curved access type it was by decorativeness, creativity, Peculiarity, and stability; and for detour access types it was decorativeness, stability, and peculiarity. Influential of factors affecting image formation and plasticity and harmony factors and the form had more influences on image formation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.19-30
• /
• 2007

In this paper, we propose low-complexity implementation of orthogonal frequency division multiple access (OFDMA) timing delay detector with multiple receive antennas for broadband wireless access (BWA). First, in order to reduce the computational complexity, the detection structure which rotates the phase of the received ranging symbols is introduced. Second, we propose the detection structure with the N-point/M-interval fast Fourier transform structure and a frequency-domain average-power estimator for complexity reduction without sacrificing the system performance. Finally, simulation results for the proposed structures and complexity comparison of the existing structure with the proposed detectors are presented.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.3-5
• /
• 2006

Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2001.05a
• /
• pp.121-127
• /
• 2001

An unified measure of user interface efficiency and aesthetics for cyber museum is proposed. First, general structure of cyber museum is discussed and hierarchical analyses are done for sample sites. Usability tests based on the hierarchical analyses yield statistics of user access frequency and persistency for each page, on which access probability is deduced. Second, visual occupancy, a measure of efficiency of user interface element based on access probability is defined. The hierarchical statistics of visual occupancy can be an index for characterization and classification of cyber museums. Examples are provided.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2006.11a
• /
• pp.69-70
• /
• 2006

A detailed Investigation of cell structure and electrical characteristic in chalcogenide-based phase-change random access memory(PRAM) devices is presented. We used compound of Ge-Sb-Te material for phase-change cell. A novel bottom electrode structure and manufacture are described. We used heat radiator structure for improved reset characteristic. A resistance change measurement is performed on the test chip. From the resistance change, we could observe faster reset characteristic.