• Title/Summary/Keyword: Security essential information

Search Result 491, Processing Time 0.024 seconds

Efficient Top-k Join Processing over Encrypted Data in a Cloud Environment

  • Kim, Jong Wook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.5153-5170
    • /
    • 2016
  • The benefit of the scalability and flexibility inherent in cloud computing motivates clients to upload data and computation to public cloud servers. Because data is placed on public clouds, which are very likely to reside outside of the trusted domain of clients, this strategy introduces concerns regarding the security of sensitive client data. Thus, to provide sufficient security for the data stored in the cloud, it is essential to encrypt sensitive data before the data are uploaded onto cloud servers. Although data encryption is considered the most effective solution for protecting sensitive data from unauthorized users, it imposes a significant amount of overhead during the query processing phase, due to the limitations of directly executing operations against encrypted data. Recently, substantial research work that addresses the execution of SQL queries against encrypted data has been conducted. However, there has been little research on top-k join query processing over encrypted data within the cloud computing environments. In this paper, we develop an efficient algorithm that processes a top-k join query against encrypted cloud data. The proposed top-k join processing algorithm is, at an early phase, able to prune unpromising data sets which are guaranteed not to produce top-k highest scores. The experiment results show that the proposed approach provides significant performance gains over the naive solution.

Efficient Architectures for Modular Exponentiation Using Montgomery Multiplier (Montgomery 곱셈기를 이용한 효율적인 모듈라 멱승기 구조)

  • 하재철;문상재
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.5
    • /
    • pp.63-74
    • /
    • 2001
  • Modular exponentiation is an essential operation required for implementations of most public key cryptosystems. This paper presents two architectures for modular exponentiation using the Montgomery modular multiplication algorithm combined with two binary exponentiation methods, L-R(Left to Left) algorithms. The proposed architectures make use of MUXes for efficient pre-computation and post-computation in Montgomery\`s algorithm. For an n-bit modulus, if mulitplication with m carry processing clocks can be done (n+m) clocks, the L-R type design requires (1.5n+5)(n+m) clocks on average for an exponentiation. The R-L type design takes (n+4)(n+m) clocks in the worst case.

Analysis of Server's Computational Cost for Multicast Batch Rekeying Scheme (멀티캐스트 일괄 키 갱신 방법의 서버계산 비용 분석)

  • Park Chang-Seop;Lee Gyu-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.6
    • /
    • pp.71-80
    • /
    • 2005
  • In the near future, various aplications on the Internet will be based on the multicast group communication, so that the efficient group key management is essential for managing the frequent group join and leave events. In this paper, we propose several batch rekeying schemes extended from conventional individual rekeying schemes, and analyze the efficiencies of them in terms of both the number of encryption and one-way hash function as well as multicast message size. Considering multiple member leaves, a probabilistic approach is need to compute the average computational amounts for rekeying.

Comparing the Performance of 17 Machine Learning Models in Predicting Human Population Growth of Countries

  • Otoom, Mohammad Mahmood
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.220-225
    • /
    • 2021
  • Human population growth rate is an important parameter for real-world planning. Common approaches rely upon fixed parameters like human population, mortality rate, fertility rate, which is collected historically to determine the region's population growth rate. Literature does not provide a solution for areas with no historical knowledge. In such areas, machine learning can solve the problem, but a multitude of machine learning algorithm makes it difficult to determine the best approach. Further, the missing feature is a common real-world problem. Thus, it is essential to compare and select the machine learning techniques which provide the best and most robust in the presence of missing features. This study compares 17 machine learning techniques (base learners and ensemble learners) performance in predicting the human population growth rate of the country. Among the 17 machine learning techniques, random forest outperformed all the other techniques both in predictive performance and robustness towards missing features. Thus, the study successfully demonstrates and compares machine learning techniques to predict the human population growth rate in settings where historical data and feature information is not available. Further, the study provides the best machine learning algorithm for performing population growth rate prediction.

Load Balancing Approach to Enhance the Performance in Cloud Computing

  • Rassan, Iehab AL;Alarif, Noof
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.2
    • /
    • pp.158-170
    • /
    • 2021
  • Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

CCTV Video Privacy Protection Scheme Based on Edge Blockchain (엣지 블록체인 기반의 CCTV 영상 프라이버시 보호 기법)

  • Lee, Donghyeok;Park, Namje
    • The Journal of Korean Institute of Information Technology
    • /
    • v.17 no.10
    • /
    • pp.101-113
    • /
    • 2019
  • Recently, the intelligent video surveillance technology has become able to provide various services such as predictive surveillance that have not been provided previously. Securing the security of the intelligent video surveillance is essential, and malicious manipulation of the original CCTV video data can lead to serious social problems. Therefore, in this paper, we proposed an intelligent video surveillance environment based on blockchain. The proposed scheme guarantees the integrity of the CCTV image data and protects the ROI privacy through the edge blockchain, so there is no privacy exposure of the object. In addition, it is effective because it is possible to increase the transmission efficiency and reduce storage by enabling video deduplication.

On the Use of Odd-Degree Isogenies for Implementing SIDH-Based Cryptography (SIDH 기반 암호 구현에 대한 홀수 차수 아이소제니 적용)

  • Kim, Suhri;Yoon, Kisoon;Park, Young-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.1
    • /
    • pp.19-30
    • /
    • 2021
  • In this paper, when SIDH is instantiated using only 3- and 5-isogeny, we demonstrate which curve is more efficient among the Montgomery, Edwards, and Huff curves. To this end, we present the computational cost of the building blocks of SIDH on Montgomery, Edwards, and Huff curves. We also present the prime we used and parameter settings for implementation. The result of our work shows that the performance of SIDH on Montgomery and Huff curves is almost the same and they are 0.8% faster than Edwards curves. With the possibility of using isogeny of degree other than 3 and 4, the performance of 5-isogeny became even more essential. In this regard, this paper can provide guidelines on the selection of the form of elliptic curves for implementation.

Digital Transformation in Summer Training Process at King Abdulaziz University: Action Design Research in Practice

  • Bahaddad, Adel;Bitar, Hind
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.171-180
    • /
    • 2022
  • In the knowledge development of online assessment in learning management systems (LMSs), many assessments are evaluated weekly in the summer training course for undergraduate students in the Faculty of Computing and Information Technology at King Abdul-Aziz University in Saudi Arabia. The number of performance assessments in the summer training course reaches 15 weeks. Many of them, however, are sent or done informally or through unreliable ways and cannot be verified by third parties. Therefore, applying the concept of digital transformation is essential. This research study reported herein used the action design research (ADR) method to build a new information technology system that could assist in the digital transformation. An electronic platform was designed, developed, implemented, and evaluated using the ADR method so that the main people involved in the summer training process (i.e., students, academic supervisors, and administrators) would have a high level of satisfaction with it. The study was conducted on 452 students, 105 academic supervisors, and 15 administrative staff and was conducted during the summer semester of 2020. All the training processes were digitally transformed and automated to control and raise the level and reliability of the training. All involved people were satisfied, thus, shifting the process to be in a digital form assist in achieving the high-level goal.

Civil legal relations in the context of adaptation of civil legislation to the legislation of the EU countries in the digital age

  • Kizlova, Olena;Safonchyk, Oksana;Hlyniana, Kateryna;Mazurenko, Svetlana
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.521-525
    • /
    • 2021
  • An essential area is the creation of a single digital market between the EU and Ukraine through information technology. Purpose: to investigate and analyze civil law relations in the field of adaptation of Ukrainian civil law to civil law regulations of the EU. The object of research: Ukrainian civil law and civil law of the EU. The subject of the study is civil law in the context of adaptation of civil law to the legislation of the EU. The following methods of scientific cognition were used during the research: semantic, historical, comparison, analysis and synthesis, generalization. The results of the study show that the harmonization of the legal system of Ukraine with EU law is caused by several goals: successful integration of Ukraine into the EU, legal reforms based on the positive example of EU countries, promoting access of Ukrainian enterprises to the EU market; attracting foreign investment, increasing the welfare of Ukrainian citizens. The adaptation includes three stages, the final of which is the preparation of an expanded program of harmonization of Ukrainian legislation with EU legislation. In the process of adaptation, it is important to take into account the legal history, tradition, features and mentality of Ukraine and before borrowing legal structures to analyze the feasibility of their application in the Ukrainian legal field.

A ROI Image Encryption Algorithm Based on Cellular Automata in Real-Time Data Transmission Environment (실시간 데이터 전송 환경에서의 셀룰러 오토마타 기반의 ROI 이미지 암호 알고리즘)

  • Un-Sook Choi
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1117-1124
    • /
    • 2023
  • The security of information, including image content, is an essential part of today's communications technology and is critical to secure transmission. In this paper, a new ROI-based image encryption algorithm is proposed that can quickly encrypt images with a security level suitable for environments that require real-time data transmission for images containing sensitive information such as ID cards. The proposed algorithm is based on one dimensional 5-neighbor cellular automata, which can be implemented in hardware and performed hardware-friendly operations. Various experiments and analyses are performed to verify whether the proposed encryption algorithm is safe from various brute-force attacks.