• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4028-4049
• /
• 2014

Attribute-based encryption (ABE) is a promising cryptographic primitive for implementing fine-grained data sharing in cloud computing. However, before ABE can be widely deployed in practical cloud storage systems, a challenging issue with regard to attributes and user revocation has to be addressed. To our knowledge, most of the existing ABE schemes fail to support flexible and direct revocation owing to the burdensome update of attribute secret keys and all the ciphertexts. Aiming at tackling the challenge above, we formalize the notion of ciphertext-policy ABE supporting flexible and direct revocation (FDR-CP-ABE), and present a concrete construction. The proposed scheme supports direct attribute and user revocation. To achieve this goal, we introduce an auxiliary function to determine the ciphertexts involved in revocation events, and then only update these involved ciphertexts by adopting the technique of broadcast encryption. Furthermore, our construction is proven secure in the standard model. Theoretical analysis and experimental results indicate that FDR-CP-ABE outperforms the previous revocation-related methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.186-192
• /
• 2021

Recently, the demand for more precise and demand-oriented customized spatial information is increasing due to the 4th industrial revolution. In particular, the use of 3D spatial information and digital twins which based on spatial information, and research for solving social problems in cities by using such information are continuously conducted. Globally, non-face-to-face services are increasing due to COVID-19, and the national policy direction is also rapidly progressing digital transformation, digitization and virtualization of the Korean version of the New Deal, which means that 3D spatial information has become an important factor to support it. In this study, physical objects for cities defined by world organizations such as ISO, OGC, and ITU were selected and the target of the 3D object model was limited to buildings. Based on CityGML2.0, the data collected using a drone suitable for building a 3D model of a small area is selected to be updated through road name address and building ledger, which are administrative information related to this, and LoD2.5 data is constructed and urban space. It was intended to suggest an object update method for a 3D building among data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1336-1345
• /
• 2002

Materialized views in data warehouse play important roles in rapidly answering to users's requests for information Processing. More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by using only the materialized views with higher probabilities rather than accessing base relations. The limited duration, during which the materialized views are updated due to base relations's changes, limits the number of materialized views in data warehouse. In this paper, we propose efficient policy for updating the materialized views, which can save the update duration of views although MIN/MAX values frequently change in base relation. The policy updates the materialized views by distinguishing whether MIN/MAX values's changes in the base relation are insert value or delete value. Then, the number of accesses to the base relation is descreased when updating the MIN/MAX values in the materialized views.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.47-52
• /
• 2023

With the growing data size and the increased computing load in machine learning, energy-efficient resource planning in IoT systems is becoming increasingly important. In this paper, we suggest a new resource planning policy for real-time workloads that can be fluctuated over time in IoT systems. To handle such situations, we categorize real-time tasks into fixed tasks and variable tasks, and optimize the resource planning for various workload conditions. Based on this, we initiate the IoT system with the configuration for the fixed tasks, and when variable tasks are activated, we update the resource planning promptly for the situation. Simulation experiments show that the proposed policy saves the processor and memory energy significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.145-164
• /
• 2023

Cloud computing offers a platform that is both adaptable and scalable, making it ideal for outsourcing data for sharing. Various organizations outsource their data on cloud storage servers for availing management and sharing services. When the organizations outsource the data, they lose direct control on the data. This raises the privacy and security concerns. Cryptographic encryption methods can secure the data from the intruders as well as cloud service providers. Data owners may also specify access control policies such that only the users, who satisfy the policies, can access the data. Attribute based access control techniques are more suitable for the cloud environment as they cover large number of users coming from various domains. Multi-authority attribute-based encryption (MA-ABE) technique is one of the propitious attribute based access control technique, which allows data owner to enforce access policies on encrypted data. The main aim of this paper is to comprehensively survey various state-of-the-art MA-ABE schemes to explore different features such as attribute and key management techniques, access policy structure and its expressiveness, revocation of access rights, policy updating techniques, privacy preservation techniques, fast decryption and computation outsourcing, proxy re-encryption etc. Moreover, the paper presents feature-wise comparison of all the pertinent schemes in the field. Finally, some research challenges and directions are summarized that need to be addressed in near future.

• STI Policy Review
• /
• v.6 no.2
• /
• pp.54-86
• /
• 2015

The study examines the U.S. Small Business Innovation Research (SBIR) program, with a focus on the recent Reauthorization, and compares, in the political context, the U.S. and East Asian countries-Japan, Korea and Taiwan-that adopted the U.S. SBIR program. For the systematic analysis and cross-country comparison, the study employs Kingdon (2003)'s framework-his political theory and Garbage Can Model-to identify political participants and processes underlying the SBIR Reauthorization and to analyze the differences in problem, policy, and politics streams between the U.S. and East Asian countries. For the cross-country comparison, specifically, the study uses various data sources such as OECD, Global Entrepreneurship Monitor, Hofstede's Cultural Dimensions, and World Value Survey. Based on the analysis outcomes, implications of U.S. practices on East Asian countries are extracted as follows. East Asian countries tend to: Have higher entrepreneurial aspiration while lower entrepreneurial activity and attitude than the U.S.; bear higher long term orientation and uncertainty avoidance while lower individualism than the U.S.; and have greater expectations of technology development and higher confidence in political parties while participating less in political action than the U.S. Drawing on the differences, the following policy recommendations are suggested. East Asian countries should: Improve entrepreneurs' access to resources (in particular, financial resource) in order to link their high entrepreneurial aspiration to actual entrepreneurial activities; cultivate failure-tolerating culture and risk-taking entrepreneurs, for instance, by providing a second chance to SBIR-participating businesses that failed to materialize their innovative ideas; and leverage their high expectations of new technology in order to take bold actions regarding their SBIR programs, and update the programs by drawing out constructive dialogues between SBIR stakeholders.

• Journal of Cadastre & Land InformatiX
• /
• v.45 no.1
• /
• pp.17-30
• /
• 2015

Local governments' spatial information policies are very important in that it can increase the relatedness to upper policy regarding the share, openness and converged utilization of spatial information and contribute to voluntary participation and creative uses linked to big data. However, local governments' spatial information policies require enhancement since it need to update framework spatial data, to derive spatial information service and to share the data. In this research, we compared the spatial information policies and related systems of central and local governments, and analyzed the local governments' spatial information policy enforcement plans and the Seoul metropolitan government's utilization survey on 32 spatial information systems. In the result, for the improvement of local governments' spatial policies, on-demand updating of base map using the as built drawings linked to field work departments, securing up-to-date public domain spatial information through the NSDI system, sharing of spatial information based on the spatial information platform and benchmarking of best practices related to the spatial information based policy participation are suggested.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.1-10
• /
• 2020

In this paper, we propose an efficient disk buffer replacement policy which improves hit ratio and reduces writing operations of flash based storages. The flash based storage has many advantages, including a small form factor, non-volatility and high reliability, but there are problems caused by own limitations, like not-in-place update, short life cycle and asymmetric I/O latencies. To redeem these problems, this paper proposes the write weighted probability of reference(2WPR) policy. 2WPR policy predicts re-referencing probability and calculates localities of each page. Furthermore, by weighting write operations to every pages, 2WPR can reduce write operations to flash based storage. In addition, we can improve the performance with higher hit ratio and reduce the number of write operations and consequently shorten the latencies of each operation. The results show that our policy provides improvements of up to 10% for the hit ratio with the reduction of up to 5% for the flash writing operation compared with other policies.

• Journal of Internet Computing and Services
• /
• v.22 no.4
• /
• pp.13-28
• /
• 2021

Reinforcement Learning (RL) is a machine learning algorithm that repeat the closed-loop process that agents perform actions specified by the policy, the action is evaluated with a reward function, and the policy gets updated accordingly. The key benefit of RL is the ability to optimze the policy with action evaluation. Hence, it can effectively be applied to developing advanced intelligent systems and autonomous systems. Conventional RL incoporates a single policy, a reward function, and relatively simple policy update, and hence its utilization was limited. In this paper, we propose an extended RL model that considers multiple instances of RL elements. We define a formal model of the key elements and their computing model of the extended RL. Then, we propose design methods for applying to system development. As a case stud of applying the proposed formal model and the design methods, we present the design and implementation of an advanced car navigator system that guides multiple cars to reaching their destinations efficiently.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.1-10
• /
• 2004

Quite many papers about moving objects database (MOD) have been Published. Most of them are concerning of improving efficiency of updating policy, but none of them talks about verification of system's requirements. No matter how efficient updating policy is employed, a system designer still has to verify if the MOD satisfies user's requirement at the beginning of system lifestyle. For example, if a MOD serves n moving objects, then the designer must verity if it can update information for n moving objects and provide new information to moving objects within specified time limit. For the purpose of requirement analysis of MODs, we build a Petri net model for MOD using Design/CPN, and then we show how to verify whether the MOD satisfies user's requirements by simulation. The contribution of this paper is providing a simulation model for requirement analysis of MOD for the first time. The model is expansion of our previous fuzzy-timing Petri net model. The distance-based updating policy, and distributed database management system are reflected in this model and system analysis for moving objects is considered. It is built in Design/CPN so that the simulation can be automatically performed. The application of our model is not limited to requirement analysis, it is useful to study other MOD design issues, such as the trade-offs between update cost and information accuracy, and between the tim interval needed for updating database and MOD system resources, etc.