• 제목/요약/키워드: Key Update

검색결과 206건 처리시간 0.02초

An Identity-Based Key-Insulated Encryption with Message Linkages for Peer-to-Peer Communication Network

  • Hsu, Chien-Lung;Lin, Han-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권11호
    • /
    • pp.2928-2940
    • /
    • 2013
  • Key exposure is a major threat to secure cryptosystems. To mitigate the impact caused by key-compromise attacks, a key-insulated cryptographic mechanism is a better alternative. For securing the large message communication in peer-to-peer networks, in this paper, we propose the first novel identity-based key-insulated encryption (IB-KIE) scheme with message linkages. Our scheme has the properties of unbounded time periods and random-access key-updates. In the proposed scheme, each client can periodically update his private key while the corresponding public one remains unchanged. The essential security assumption of our proposed scheme is based on the well-known bilinear Diffie-Hellman problem (BDHP). To ensure the practical feasibility, we also formally prove that the proposed scheme achieves the security requirement of confidentiality against indistinguishability under adaptive chosen-ciphertext attacks (IND-CCA2) in the random oracle model.

A Flash-based B+-Tree using Sibling-Leaf Blocks for Efficient Node Updates and Range Searches

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제8권3호
    • /
    • pp.12-24
    • /
    • 2016
  • Recently, as the price per bit is decreasing at a fast rate, flash memory is considered to be used as primary storage of large-scale database systems. Although flash memory shows off its high speeds of page reads, however, it has a problem of noticeable performance degradation in the presence of increasing update workloads. When updates are requested for pages with random page IDs, in particular, the shortcoming of flash tends to impair significantly the overall performance of a flash-based database system. Therefore, it is important to have a way to efficiently update the B+-tree, when it is stored in flash storage. This is because most of updates in the B+-tree arise at leaf nodes, whose page IDs are in random. In this light, we propose a new flash B+-tree that stores up-to-date versions of leaf nodes in sibling-leaf blocks (SLBs), while updating them. The use of SLBs improves the update performance of B-trees and provides the mechanism for fast key range searches. To verify the performance advantages of the proposed flash B+-tree, we developed a mathematical performance evaluation model that is suited for assessing B-tree operations. The performance comparisons from it show that the proposed flash B+-tree provides faster range searches and reduces more than 50% of update costs.

자동 주석 갱신 및 다중 분할 칼라 히스토그램 기법을 이용한 멀티미디에 데이터베이스 시스템 (A Multimedia Database System using Method of Automatic Annotation Update and Multi-Partition Color Histogram)

  • 안재명;오해석
    • 정보처리학회논문지B
    • /
    • 제11B권6호
    • /
    • pp.701-708
    • /
    • 2004
  • 기존의 내용기반 비디오 검색 시스템들은 주석기반 검색 또는 특징기반 검색과 같은 단일 방식으로만 검색을 하므로 검색 효율이 낮을 뿐 아니라 완전한 자동 처리가 되지 않아 시스템 관리자나 주석자의 많은 노력을 요구한다. 본 논문에서는 주석기반 검색과 특징기반 검색을 이용하여 대용량의 비디오 데이터에 대한 사용자의 다양한 의미검색을 지원하는 에이전트 기반에서의 자동화되고 통합된 비디오 의미기반 검색 시스템을 제안한다. 사용자의 기본적인 질의를 분석하고 질의에 의해 추출된 키 프레임의 이미지를 사용자가 선택함으로써 인덱싱 에이전트는 추출된 키 프레임의 주석에 대한 의미를 더욱 구체화시킨다. 또한, 사용자에 의해 선택된 키 프레임은 특징기반 검색의 질의 이미지가 되고 인덱싱 에이전트는 제안하는 다중 분할 칼라 히스토그램 기법을 통해 질의 이미지와 데이터베이스의 키 프레임들을 비교한 후 가장 유사한 키 프레임 이미지를 검색하여 사용자에게 디스플레이 한다. 제안하여 구현된 시스템은 현저히 향상된 성능을 보였다.

건축 CAD모델링에 대한 HCI에 관한 연구 (The study on HCI(Human Computing Interface) for Architectural CAD modeling)

  • 신승우;이규식
    • 한국실내디자인학회논문집
    • /
    • 제30호
    • /
    • pp.86-91
    • /
    • 2002
  • HCI (Human Computer Interface)is important key of software design. Effectiveness and productivity of CAD software is creation is not study actively in architectural part. The results of this study \circled1 HCI of architectural modeling is demanded effective design of keypad and short key. \circled2 It is require that system reactions to be united in one interface in order to hold in check confusion of the information. \circled3 Intelligent interface for continuous update of 3D information is required.

2DF ON THE AAT - PROJECT UPDATE AND FIRST SCIENTIFIC RESULTS

  • CANNON RUSSELL;TAYLOR KEITH
    • 천문학회지
    • /
    • 제29권spc1호
    • /
    • pp.367-370
    • /
    • 1996
  • Construction of the 'Two-degree Field' (2dF) instrument on the Anglo-Australian Telescope (AAT) is now virtually complete and commissioning is well underway. The key components are described. Several recent milestones are reported, including the first scientific results. Future prospects and plans are discussed.

  • PDF

Weighted Fast Adaptation Prior on Meta-Learning

  • Widhianingsih, Tintrim Dwi Ary;Kang, Dae-Ki
    • International journal of advanced smart convergence
    • /
    • 제8권4호
    • /
    • pp.68-74
    • /
    • 2019
  • Along with the deeper architecture in the deep learning approaches, the need for the data becomes very big. In the real problem, to get huge data in some disciplines is very costly. Therefore, learning on limited data in the recent years turns to be a very appealing area. Meta-learning offers a new perspective to learn a model with this limitation. A state-of-the-art model that is made using a meta-learning framework, Meta-SGD, is proposed with a key idea of learning a hyperparameter or a learning rate of the fast adaptation stage in the outer update. However, this learning rate usually is set to be very small. In consequence, the objective function of SGD will give a little improvement to our weight parameters. In other words, the prior is being a key value of getting a good adaptation. As a goal of meta-learning approaches, learning using a single gradient step in the inner update may lead to a bad performance. Especially if the prior that we use is far from the expected one, or it works in the opposite way that it is very effective to adapt the model. By this reason, we propose to add a weight term to decrease, or increase in some conditions, the effect of this prior. The experiment on few-shot learning shows that emphasizing or weakening the prior can give better performance than using its original value.

Update on Irritable Bowel Syndrome Program of Research

  • Heitkemper, Margaret;Jarrett, Monica;Jun, Sang-Eun
    • 대한간호학회지
    • /
    • 제43권5호
    • /
    • pp.579-586
    • /
    • 2013
  • Purpose: This article provides an update and overview of a nursing research program focused on understanding the pathophysiology and management of irritable bowel syndrome (IBS). Methods: This review includes English language papers from the United States, Europe, and Asia (e.g., South Korea) from 1999 to 2013. We addressed IBS as a health problem, emerging etiologies, diagnostic and treatment approaches and the importance of a biopsychosocial model. Results: IBS is a chronic, functional gastrointestinal disorder characterized by recurrent episodes of abdominal pain and alterations in bowel habit (diarrhea, constipation, mixed). It is a condition for which adults, particularly women ages 20-45, seek health care services in both the United States and South Korea. Clinically, nurses play key roles in symptom prevention and management including designing and implementing approaches to enhance the patients' self-management strategies. Multiple mechanisms are believed to participate in the development and maintenance of IBS symptoms including autonomic nervous system dysregulation, intestinal inflammation, intestinal dysbiosis, dietary intolerances, alterations in emotion regulation, heightened visceral pain sensitivity, hypothalamic-pituitary-adrenal dysregulation, and dysmotility. Because IBS tends to occur in families, genetic factors may also contribute to the pathophysiology. Patients with IBS often report a number of co-morbid disorders and/or symptoms including poor sleep. Conclusion: The key to planning effective management strategies is to understand the heterogeneity of this disorder. Interventions for IBS include non-pharmacological strategies such as cognitive behavior therapy, relaxation strategies, and exclusion diets.

Enhancing Security in Mobile IPv6

  • Modares, Hero;Moravejosharieh, Amirhossein;Salleh, Rosli Bin;Lloret, Jaime
    • ETRI Journal
    • /
    • 제36권1호
    • /
    • pp.51-61
    • /
    • 2014
  • In the Mobile IPv6 (MIPv6) protocol, a mobile node (MN) is a mobile device with a permanent home address (HoA) on its home link. The MN will acquire a care-of address (CoA) when it roams into a foreign link. It then sends a binding update (BU) message to the home agent (HA) and the correspondent node (CN) to inform them of its current CoA so that future data packets destined for its HoA will be forwarded to the CoA. The BU message, however, is vulnerable to different types of security attacks, such as the man-in-the-middle attack, the session hijacking attack, and the denial-of-service attack. The current security protocols in MIPv6 are not able to effectively protect the BU message against these attacks. The private-key-based BU (PKBU) protocol is proposed in this research to overcome the shortcomings of some existing MIPv6 protocols. PKBU incorporates a method to assert the address ownership of the MN, thus allowing the CN to validate that the MN is not a malicious node. The results obtained show that it addresses the security requirements while being able to check the address ownership of the MN. PKBU also incorporates a method to verify the reachability of the MN.

방송 채널 효율 향상을 위한 그룹 계층 구성 기반 접근 제어 시스템 (Conditional Access System with A Group Hierarchy to Improve Broadcasting Channel Efficiency)

  • 양장훈;김동구
    • 한국항행학회논문지
    • /
    • 제13권5호
    • /
    • pp.726-735
    • /
    • 2009
  • 본 논문에서는 방송 시스템에서 채널의 대역폭이 제한되는 상황에서 유효 가입자 제어를 위한 메시지 전송 오버헤드를 감소시키는 접근 제어 시스템을 제안하였다. 이를 위해서 IP 기반 멀티캐스트에 제안되었던 트리 계층 구조의 키 개정 시스템을 도입하여 가입자를 트리 구조에 직접 매핑하는 경우와 가입자를 채널 그룹별로 나누어 채널 그룹을 트리 구조에 적용하는 시스템을 고려하였다. 제안 시스템의 효율성을 평가하기 위해 기존의 시스템과 제안 시스템에 대해서 보안을 위한 주기적인 키 개정을 위한 오버헤드 전송율과 동적이면서 비주기적으로 가입자의 변동이 발생을 할 때의 오버헤드 전송율을 분석하였다. 다양한 시스템 환경에서 제안 시스템은 기존 시스템에 비해서 가입자의 변동이 발생할 경우에 수 배에서 수십 만배의 키 개정을 위한 메시지 오버헤드 전송율을 크게 감소시키는 것을 분석 평가를 통해서 확인하였다.

  • PDF

Data anomaly detection and Data fusion based on Incremental Principal Component Analysis in Fog Computing

  • Yu, Xue-Yong;Guo, Xin-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권10호
    • /
    • pp.3989-4006
    • /
    • 2020
  • The intelligent agriculture monitoring is based on the perception and analysis of environmental data, which enables the monitoring of the production environment and the control of environmental regulation equipment. As the scale of the application continues to expand, a large amount of data will be generated from the perception layer and uploaded to the cloud service, which will bring challenges of insufficient bandwidth and processing capacity. A fog-based offline and real-time hybrid data analysis architecture was proposed in this paper, which combines offline and real-time analysis to enable real-time data processing on resource-constrained IoT devices. Furthermore, we propose a data process-ing algorithm based on the incremental principal component analysis, which can achieve data dimensionality reduction and update of principal components. We also introduce the concept of Squared Prediction Error (SPE) value and realize the abnormal detection of data through the combination of SPE value and data fusion algorithm. To ensure the accuracy and effectiveness of the algorithm, we design a regular-SPE hybrid model update strategy, which enables the principal component to be updated on demand when data anomalies are found. In addition, this strategy can significantly reduce resource consumption growth due to the data analysis architectures. Practical datasets-based simulations have confirmed that the proposed algorithm can perform data fusion and exception processing in real-time on resource-constrained devices; Our model update strategy can reduce the overall system resource consumption while ensuring the accuracy of the algorithm.