• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권7호
• /
• pp.1935-1950
• /
• 2023

The arrival of the Internet of Things and 5G technology enables users to rely on edge computing platforms to process massive data. Data sharing based on edge computing refines the efficiency of data collection and analysis, saves the communication cost of data transmission back and forth, but also causes the privacy leakage of a lot of user data. Based on attribute-based encryption and blockchain technology, we design a fine-grained access control scheme for data in edge computing, which has the characteristics of verifiability, support for outsourcing decryption and user attribute revocation. User attributes are authorized by multi-attribute authorization, and the calculation of outsourcing decryption in attribute encryption is completed by edge server, which reduces the computing cost of end users. Meanwhile, We implemented the user's attribute revocation process through the dual encryption process of attribute authority and blockchain. Compared with other schemes, our scheme can manage users' attributes more flexibly. Blockchain technology also ensures the verifiability in the process of outsourcing decryption, which reduces the space occupied by ciphertext compared with other schemes. Meanwhile, the user attribute revocation scheme realizes the dynamic management of user attribute and protects the privacy of user attribute.

• 전자공학회논문지CI
• /
• 제46권1호
• /
• pp.78-87
• /
• 2009

속성 기반 서명(Attribute-Based Signature) 기법이란 서명자의 비밀키에 속성 집합(Attribute Set)이 연관되고 서명에 접근구조(Access Structure)가 연관되는 서명 기법이다. 속성 기반 서명 기법은 객체의 식별자가 속성 집합으로 표현되는 속성 기반 시스템(Attribute-Based System) 또는 권한 기반 시스템(Role-Based System)에서 서명자의 익명성과 접근 제어를 가능하게 하는 유용한 서명 기법이다. 본 논문에서는 속성 기반 서명 기법을 정의하고 서명에 포함되는 정책을 DNF(Disjunctive Normal Form) 수식으로 표현이 가능한 효율적인 속성 기반 서명 기법을 제시한다. 제시한 기법은 서명 검증시 상수번의 페어링 연산만이 필요한 최초의 안전한 기법이다. 그리고 증명이 가능한 속성 기반 서명 기법을 구성하기 위해서 새로운 interactive 가정을 소개하고 제안된 기법이 랜덤 오라클과 새로운 가정에서 안전함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2292-2309
• /
• 2017

Ciphertext policy attribute-based encryption (CP-ABE) is a useful cryptographic technology for guaranteeing data confidentiality but also fine-grained access control. Typically, CP-ABE can be divided into two classes: small universe with polynomial attribute space and large universe with unbounded attribute space. Since the learning with errors over rings (R-LWE) assumption has characteristics of simple algebraic structure and simple calculations, based on R-LWE, we propose a small universe CP-ABE scheme to improve the efficiency of the scheme proposed by Zhang et al. (AsiaCCS 2012). On this basis, to achieve unbounded attribute space and improve the expression of attribute, we propose a large universe CP-ABE scheme with the help of a full-rank differences function. In this scheme, all polynomials in the R-LWE can be used as values of an attribute, and these values do not need to be enumerated at the setup phase. Different trapdoors are used to generate secret keys in the key generation and the security proof. Both proposed schemes are selectively secure in the standard model under R-LWE. Comparison with other schemes demonstrates that our schemes are simpler and more efficient. R-LWE can obtain greater efficiency, and unbounded attribute space means more flexibility, so our research is suitable in practices.

• 정보과학회 논문지
• /
• 제44권4호
• /
• pp.344-351
• /
• 2017

속성 기반 서명은 속성을 가지는 서명키를 사용하여 속성 술어를 기반으로 하는 서명을 생성하는 암호 방식이다. 속성 기반 서명에서 서명을 생성하는 동안 서명키가 유출된다면, 해당 서명키에 대한 서명이 위조될 수 있는 문제가 발생한다. 따라서 서명 생성은 보안이 보장되는 하드웨어에서 수행되어야 한다. 이러한 하드웨어를 보안 하드웨어라고 명명한다. 그러나 보안 하드웨어는 연산속도가 느리기 때문에 속성 기반 서명과 같은 많은 연산을 빠른 시간 안에 수행하기에는 적합하지 않다. 이 논문은 속성 기반 서명의 연산을 분리하여 성능이 좋은 일반 하드웨어와 보안 하드웨어로 이루어지는 시스템에서 효율적으로 사용가능한 속성 기반 서명 기법을 제안한다. 제안하는 기법은 기존에 존재하는 임의의 속성 기반 서명과 일반 전자서명으로 설계가 가능하며, 속성 기반 서명이 안전하지 않은 환경에서 수행되더라도 일반 전자서명을 보안 하드웨어에서 수행함으로써 안전성을 보장한다. 제안된 논문은 기존의 속성 기반 서명을 보안 하드웨어에서 생성하는 것에 비해서 11배의 성능향상을 보인다.

• 한국컴퓨터정보학회논문지
• /
• 제12권4호
• /
• pp.95-102
• /
• 2007

최근에 응용 개발의 복잡성을 숨겨주고, 상위 응용계층에서 필요로 하는 기능을 추상화하여 제공하는 센서 미들웨어에 대하여 많은 연구진들이 주목하고 있다. 미들웨어를 설계하기 위한 요건들은 다수이지만, 그 중에서도 속성 기반 네이밍의 지원은 매우 중요하게 여겨진다. 하지만 현재 연구된 대부분의 미들웨어는 센서 네트워크의 특성을 제대로 고려하지 않고 설계했을 뿐만 아니라 속성 기반 쿼리에 대한 확장성을 제공하는데 한계가 있었다. 본 연구에서는 가상 대응체(Virtual Counterpart) 개념을 적용하여 속성 기반 네이밍을 싱크 노드의 미들웨어에서 가상의 센서 노드가 지원해주는 구조를 제안한다. 개별 센서 노드에서 속성 기반 쿼리를 처리하는 기존의 데이터 중심 미들웨어와는 달리, 제안된 구조에서는 센서 노드에 대응되는 가상의 센서 노드를 싱크 노드의 미들웨어에서 운용하고, 속성 기반 쿼리를 가상의 센서 노드가 물리적 센서 노드를 대행하여 처리한다. 이러한 접근방안을 취함으로써, 하부 네트워크에 비 종속적인 속성 기반 네이밍이 가능해졌으며, 확장이 용이해졌다.

• 반도체디스플레이기술학회지
• /
• 제22권2호
• /
• pp.128-132
• /
• 2023

Recently, with the development of deep learning technology, research on pedestrian attribute recognition technology using deep neural networks has been actively conducted. Existing pedestrian attribute recognition techniques can be obtained in such a way as global-based, regional-area-based, visual attention-based, sequential prediction-based, and newly designed loss function-based, depending on how pedestrian attributes are detected. It is known that the performance of these pedestrian attribute recognition technologies varies greatly depending on the type of backbone network that constitutes the deep neural networks model. Therefore, in this paper, several backbone networks are applied to the baseline pedestrian attribute recognition model and the performance changes of the model are analyzed. In this paper, the analysis is conducted using Resnet34, Resnet50, Resnet101, Swin-tiny, and Swinv2-tiny, which are representative backbone networks used in the fields of image classification, object detection, etc. Furthermore, this paper analyzes the change in time complexity when inferencing each backbone network using a CPU and a GPU.

• Journal of information and communication convergence engineering
• /
• 제17권2호
• /
• pp.135-141
• /
• 2019

Collaborative filtering algorithms often encounter data sparsity issues. To overcome this issue, auxiliary information of relevant items is analyzed and an item attribute matrix is derived. In this study, we combine the user-item attribute preference with the traditional similarity calculation method to develop an improved similarity calculation approach and use weights to control the importance of these two elements. A collaborative filtering algorithm based on user-item attribute preference is proposed. The experimental results show that the performance of the recommender system is the most optimal when the weight of traditional similarity is equal to that of user-item attribute preference similarity. Although the rating-matrix is sparse, better recommendation results can be obtained by adding a suitable proportion of user-item attribute preference similarity. Moreover, the mean absolute error of the proposed approach is less than that of two traditional collaborative filtering algorithms.

• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.1223-1230
• /
• 2009

In the construction industry, Case-Based Reasoning (CBR) is considered to be the most suitable approach and determining the attribute weights is an important CBR problem. In this paper, a method is proposed for determining attribute weights that are calculated with attribute relation. The basic items of consideration were qualitative and quantitative influence factors. These quantitative factors were related to the qualitative factors to develop a Cost Drivers-structural equation model which can be used to estimate construction cost by considering attribute weight. The process of determining the attribute weight-structural equation model consists o 4 phases: selecting the predominant Cost Drivers for the SEM, applying the Cost Driers in the SEM, determining and verifying the attribute weights and deriving the Cost Estimation Equation. This study develops a cost estimating technique that complements the CBR method with a Cost Drivers-structural equation model which can be actively used during the schematic estimating phases of construction.

• 한국의류학회지
• /
• 제33권7호
• /
• pp.1086-1097
• /
• 2009

Consumers have more choices for apparel products as e-shopping grows. This study examines the importance of apparel product attributes and classifies online apparel buyers into groups based on product attribute evaluation in various choice sets. For the empirical research, the online survey was conducted and Latent Gold Choice 4.0 was used for the choice-based conjoint analysis. Five consumer segments are found based on the choice selection of product attributes. The importance of product attributes (online shopping mall, brand, price, and style) and the preference of each product attribute level were different across segments. This research improves the knowledge of the purchasing behavior of online apparel buyers and provides proper attribute combinations of apparel e-shopping for each consumer segment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2646-2659
• /
• 2017

Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be given full consideration in attribute based cryptosystem. In this paper, we present a key-policy attribute based signcryption scheme (KP-ABSC) with delegated computation and efficient key updating. In our scheme, an access structure is embedded into user's private key, while ciphertexts corresponds a target attribute set. Only the two are matched can a user decrypt and verify the ciphertexts. When the access privileges have to be altered or key exposure happens, the system will evolve into the next time slice to preserve the forward security. What's more, data receivers can delegate most of the de-signcryption task to data server, which can reduce the calculation on client's side. By performance analysis, our scheme is shown to be secure and more efficient, which makes it a promising method for data protection in data outsourcing systems.