• Title/Summary/Keyword: Data access

Search Result 5,405, Processing Time 0.027 seconds

Group Key Management Scheme for Access Control with Reactive Approach (접근 제어를 위한 반응적 방식의 그룹키 관리 기법)

  • Kim, Hee-Youl;Lee, Youn-Ho;Park, Yong-Su;Yoon, Hyun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.589-598
    • /
    • 2007
  • In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.

Examining Access Mode Choice Behavior of Local Metropolitan High-Speed Rail Station - A Case Study of Dong-Daegu Station - (고속철도 지방대도시 정차역의 연계교통수단 선택모형 구축에 관한 연구 - 동대구역을 사례로 -)

  • Kim, Sang Hwang;Kim, Kap Soo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.4D
    • /
    • pp.565-571
    • /
    • 2006
  • This study aimed to analyze access mode choice behavior for KTX Passengers. To fulfill the aims of this study, Dong-Daegu Station was selected as a station for a case study. This study takes place in two stages. These are (i) descriptive statistical analysis of transportation status before and after introduction of the KTX, (ii) empirical model estimation for analyzing access mode choice behavior. This study makes use of the data from travel survey from Daegu metropolitan area. The main part of the survey was carried out in the KTX Dong-Daegu station. The data was collected from a sample of 1,800 individuals. The survey data includes the information on travel from Dong-Daegu station to Seoul. From descriptive statistical analysis of transportation status before and after introduction of the KTX, it is found that revealed demand of the KTX is lower than that expected. Moreover, it is found that the low demand of the KTX stems from high cost for the KTX itself and inconvenience( including travel time and cost) of access mode. In order to analyze mode choice behavior for accessing Dong-Daegu station, multinomial logit model structure is used. For the model specification, a variety of behavioral assumptions about the factors which affect the access mode choice, were considered. From the empirical model estimation, it si found that access travel time and access travel cost are significant in choosing access mode. Given the empirical evidence, we see that improvement of access transportation system for Dong-Daegu station is very important for enhancing the use of KTX.

A transmit function implementation of wireless LAN MAC with QoS using single transmit FIFO (단일 송신 피포를 이용한 QoS 기능의 무선랜 MAC의 송신 기능 구현)

  • Park, Chan-Won;Kim, Jung-Sik;Kim, Bo-Kwan
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.237-239
    • /
    • 2004
  • Wireless LAN Voice over IP(VoIP) equipment needs Quality-of-Service(QoS) with priority for processing real-time traffic. This paper shows transmit function implementation of wireless LAN(WLANs) media access control(MAC) support VoIP, and it has an advantage of guarantee of QoS and is adaptable to VoIP or mobile wireless equipment. The IEEE 802.11e standard in progress has four queues according to four access categories(AC) for transmit and the MAC transmits the data based on EDCA. The value of AC is from AC0 to AC3 and AC3 has the highest priority. The transmit method implemented at this paper ensure QoS using one transmit FIFO in hardware since real-time traffic data and non real-time traffic data has the different priority. The device driver classifies real-time data and non real-time data and transmit data to hardware with information about data type. The hardware conducts shorter backoff and selects faster AIFS slot for real-time data than it for non real-time data. Therefor It make give the real-time traffic data faster channel access chance than non real-time data and enhances QoS.

  • PDF

A Broadcast Data Allocation Scheme for Multiple-Data Queries Using Moving Average of Data Access Probability (데이터 액세스 확률의 이동 평균을 이용한 다중 데이터 질의를 위한 방송 데이터 할당 기법)

  • Kwon, Hyeokmin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.35-43
    • /
    • 2014
  • A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels in the environment where multiple-data queries are submitted, and proposes a new data allocation scheme named DAMA. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the moving average of its access probability. DAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly according to the query size. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of DAMA is superior to other schemes in terms of the average response time.

D.E.Cho : A Study on Smart City Data Security Model Using Blockchain Technology (블록체인 기술을 이용한 스마트시티 데이터 보안 모델 연구)

  • Do-Eun Cho
    • Journal of Platform Technology
    • /
    • v.12 no.2
    • /
    • pp.45-57
    • /
    • 2024
  • Smart cities are the product of modern urban planning that seeks to innovate information and communication technology and improve the quality of urban life. For the efficient operation of smart cities, data collected, stored, and processed in real time is a key resource. Therefore, data from smart cities collected in various fields must be managed safely, and personal information protection is paramount. In this study, a smart city data security model using blockchain technology was proposed to safely manage smart city data. The proposed model integrates IPFS into the blockchain network to distribute and store data to ensure data confidentiality and integrity, and encrypts data using CP-ABE to efficiently control access to data from users. In addition, privacy was guaranteed while enhancing the usability of data by using Homomorphic Encryption with data access control policies.

  • PDF

A 3D Memory System Allowing Multi-Access (다중접근을 허용하는 3차원 메모리 시스템)

  • 이형
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.9
    • /
    • pp.457-464
    • /
    • 2005
  • In this paper a 3D memory system that allows 17 access types at an arbitrary position is introduced. The proposed memory system is based on two main functions: memory module assignment function and address assignment function. Based on them, the memory system supports 17 access types: 13 Lines, 3 Rectangles, and 1 Hexahedron. That is, the memory system allows simultaneous access to multiple data in any access types at an arbitrary position with a constant interval. In order to allow 17 access types the memory system consists of memory module selection circuitry, data routing circuitry for READ/WRITE, and address calculation/routing circuitry In the point of view of a developer and a programmer, the memory system proposed in this paper supports easy hardware extension according to the applications and both of them to deal with it as a logical three-dimensional away In addition, multiple data in various across types can be simultaneously accessed with a constant interval. Therefore, the memory system is suitable for building systems related to ,3D applications (e.g. volume rendering and volume clipping) and a frame buffer for multi-resolution.

Realization of Fractal/Angle Multiplexing using X-Y Galvano Mirrors and Evaluation of Random Access Performance in Holographic Digital Data Storage (X-Y 갈바노 미러를 이용한 홀로그래픽 저장 장치의 프랙탈/각 다중화 구현 및 임의 탐색 성능의 평가)

  • Choi, Jin-Young;Lee, Jae-Sung;Kim, Sang-Hoon;Kim, Jang-Hyun;Yang, Hyun-Seok;Park, No-Cheol;Park, Young-Pil;Park, Joo-Youn
    • Transactions of the Society of Information Storage Systems
    • /
    • v.2 no.1
    • /
    • pp.43-49
    • /
    • 2006
  • Fractal/angle multiplexing is a $LiNBO_3$ crystal using a X-Y Galvano mirror, and the random access concept in fractal/angle multiplexing are discussed in this paper. First, the brief introduction of the designed holographic digital data storage system is presented. Then, the average access time concept for the storage system is newly defined, and the comparison of the average access time between the holographic storage and a conventional optical disk is performed. Second, the basic simulation and experiment to find the X-Y Galvano mirror dynamics are conducted. From this analysis, we find that the average access time in our HDDS which has 6 degree scan angle is about 5 msec. This result is very high performance when it compared with the average access time of a conventional optical disk. Finally, some recording results using fractal/angle multiplexing are presented, then, the relationship between bit error rate and angle mismatch for the each multiplexing are discussed.

  • PDF

Access Management Using Knowledge Based Multi Factor Authentication In Information Security

  • Iftikhar, Umar;Asrar, Kashif;Waqas, Maria;Ali, Syed Abbas
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.119-124
    • /
    • 2021
  • Today, both sides of modern culture are decisively invaded by digitalization. Authentication is considered to be one of the main components in keeping this process secure. Cyber criminals are working hard in penetrating through the existing network channels to encounter malicious attacks. When it comes to enterprises, the company's information is a major asset. Question here arises is how to protect the vital information. This takes into account various aspects of a society often termed as hyper connected society including online communication, purchases, regulation of access rights and many more. In this research paper, we will discuss about the concepts of MFA and KBA, i.e., Multi-Factor Authentication and Knowledge Based Authentication. The purpose of MFA and KBA its utilization for human.to.everything..interactions, offering easy to be used and secured validation mechanism while having access to the service. In the research, we will also explore the existing yet evolving factor providers (sensors) used for authenticating a user. This is an important tool to protect data from malicious insiders and outsiders. Access Management main goal is to provide authorized users the right to use a service also preventing access to illegal users. Multiple techniques can be implemented to ensure access management. In this paper, we will discuss various techniques to ensure access management suitable for enterprises, primarily focusing/restricting our discussion to multifactor authentication. We will also highlight the role of knowledge-based authentication in multi factor authentication and how it can make enterprises data more secure from Cyber Attack. Lastly, we will also discuss about the future of MFA and KBA.

A Design of Hadoop Security Protocol using One Time Key based on Hash-chain (해시 체인 기반 일회용 키를 이용한 하둡 보안 프로토콜 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.4
    • /
    • pp.340-349
    • /
    • 2017
  • This paper is proposed Hadoop security protocol to protect a reply attack and impersonation attack. The proposed hadoop security protocol is consists of user authentication module, public key based data node authentication module, name node authentication module, and data node authentication module. The user authentication module is issued the temporary access ID from TGS after verifing user's identification on Authentication Server. The public key based data node authentication module generates secret key between name node and data node, and generates OTKL(One-Time Key List) using Hash-chain. The name node authentication module verifies user's identification using user's temporary access ID, and issues DT(Delegation Token) and BAT(Block Access Token) to user. The data node authentication module sends the encrypted data block to user after verifing user's identification using OwerID of BAT. Therefore the proposed hadoop security protocol dose not only prepare the exposure of data node's secret key by using OTKL, timestamp, owerID but also detect the reply attack and impersonation attack. Also, it enhances the data access of data node, and enforces data security by sending the encrypted data.

Automation System for Sharing CDM Data (CDM 데이터 공유를 위한 자동화 시스템)

  • Jeong, Chae-Eun;Kang, Yunhee;Park, Young B.
    • Journal of Platform Technology
    • /
    • v.8 no.3
    • /
    • pp.3-9
    • /
    • 2020
  • As the need for sharing for research purposes in the medical field increases, the use of a Common Data Model (CDM) is increasing. However, when sharing CDM data, there are some problems in that access control and personal information in the data are not protected. In this paper, in order to solve this problem, access to CDM data is controlled by using an encryption method in a blockchain network, and information of CDM data is recorded to enable tracking. In addition, IPFS was used to share a large amount of CDM data, and Celery was used to automate the sharing process. In other words, we propose a multi-channel automation system in which the information required for CDM data sharing is shared by a trust-based technology, a distributed file system, and a message queue for automation. This aims to solve the problem of access control and personal information protection in the data that occur in the process of sharing CDM data.

  • PDF