• 대한수학회논문집
• /
• 제31권2호
• /
• pp.395-414
• /
• 2016

In this work, we study on subdivision schemes reproducing polynomials and build a symmetric subdivision scheme reproducing polynomials of a certain predetermined degree, which is a slight variant of the family of Deslauries-Dubic interpolatory ones. Related to polynomial reproduction, a necessary and sufficient condition for a subdivision scheme to reproduce polynomials of degree L was recently established under the assumption of non-singularity of subdivision schemes. In case of stepwise polynomial reproduction, we give a characterization for a subdivision scheme to reproduce stepwise all polynomials of degree ${\leq}L$ without the assumption of non-singularity. This characterization shows that we can investigate the polynomial reproduction property only by checking the odd and even masks of the subdivision scheme. The minimal-support condition being relaxed, we present explicitly a general formula for the mask of (2n + 4)-point symmetric subdivision scheme with two parameters that reproduces all polynomials of degree ${\leq}2n+1$. The uniqueness of such a symmetric subdivision scheme is proved, provided the two parameters are given arbitrarily. By varying the values of the parameters, this scheme is shown to become various other well known subdivision schemes, ranging from interpolatory to approximating.

• 대한수학회지
• /
• 제49권4호
• /
• pp.765-778
• /
• 2012

We construct a symmetric finite volume element (SFVE) scheme for a self-adjoint elliptic problem on tetrahedron grids and prove that our new scheme has optimal convergent order for the solution and has superconvergent order for the flux when grids are quasi-uniform and regular. The symmetry of our scheme is helpful to solve efficiently the corresponding discrete system. Numerical experiments are carried out to confirm the theoretical results.

• 정보보호학회논문지
• /
• 제14권6호
• /
• pp.3-13
• /
• 2004

논문[10]에서는 유비쿼터스 환경에서 보안 시스템들의 정책들을 보호하기 위해 단방향 함수를 사용한 룰 보호 기법을 제시하였으며, 논문[5-6]은 침입 탐지 시스템 중 Snort를 기반으로 해쉬 함수를 사용한 룰 보호기법을 제안하였다. 이러한 기법들을 통해 보안 시스템들의 정책을 보호할 수 있었으나 단방향 함수의 특성상 정책의 모든 부분을 보호할 수는 없었다. 이러한 문제를 해결하기 위해 본 논문에서는 Snort를 기반으로 대칭키 암호 시스템을 이용한 새로운 기법을 제안한다. 정책의 암호화 및 암호화에 사용되는 비밀키의 유출을 예방하기 위해 논문[12]에서 제안한 PCMCIA 암호 모듈을 사용한 키 관리 기법을 사용한다. 본 논문에서 제안한 기법은 일반적인 정책기반의 보안 시스템에 적용될 수 있다.

• ETRI Journal
• /
• 제30권3호
• /
• pp.483-485
• /
• 2008

A micro-sensor network is comprised of a large number of small sensors with limited memory capacity. Current key-establishment schemes for symmetric encryption require too much memory for micro-sensor networks on a large scale. In this paper, we propose a memory-efficient hypercube key establishment scheme that only requires logarithmic memory overhead.

• 정보처리학회논문지A
• /
• 제9A권4호
• /
• pp.511-518
• /
• 2002

대칭형 다중프로세서(SMP : Symmetric Multiprocessors) 시스템은 고성능의 병렬 연산을 위한 중요하고 효과적인 기반환경을 제공하고 있다. SMP에서 병렬 태스크와 통신을 위한 스케줄링 기법의 선택은 시스템의 성능에 큰 영향을 미치므로 효과적으로 스케줄링 기법에 대한 연구가 필요하다. 본 논문에서는 버스 기반의 SMP를 위한 태스크 중복을 기반으로 하는 스케줄링 기법을 소개한다. 제안한 스케줄링 기법은 잠재하는 통신 충돌을 방지하기 위하여 네트워크 통신 자원을 사전에 할당한다. 제안한 스케줄링 기법의 성능을 비교하기 위하여 프로세서 수와 통신비용의 변화에 대한 스케줄링 길이를 시뮬레이션을 통하여 조사하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1286-1306
• /
• 2022

Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.

• 한국멀티미디어학회논문지
• /
• 제20권3호
• /
• pp.500-510
• /
• 2017

Recently Lee et al. proposed an improved symmetric key-based remote user authentication scheme to eliminate the security weaknesses of Kumari et al.'s scheme. They hence claimed that their scheme is secure to various well-known attacks. However, we found that Lee et al.'s scheme is still insecure against outsider attack, smart card stolen and off-line password guessing attack. To overcome these security vulnerabilities, we propose an enhanced authentication scheme with key-agreement which is based on the fuzzy-extractor. Furthermore, we prove that the proposed scheme is more secure, and that it serves to gratify all of the required security properties. Finally, we compare the performance and functionality of the proposed scheme with those of previous schemes.

• 한국컴퓨터정보학회논문지
• /
• 제14권7호
• /
• pp.81-88
• /
• 2009

핑거프린팅 기법은 디지털 데이터의 저작권을 보호하기 위하여 암호학적인 기법들을 이용한 방버이다. 디지털 데이터에 구매자 각각의 유일한 핑거프린트를 삽입하고 이를 이용하여 디지털 데이터를 불법적으로 재배포한 구매자를 찾아내게 된다. 핑거프린팅 기법은 구매자의 프라이버시 보호를 위하여 비대칭성이 보장되어야 한다. 본 논문에서는 대칭키 암호를 기반으로 하지만 비대칭성 만족을 위하여 신뢰기관의 참여가 필요하지 않는 프린팅 기법에 대하여 제안한다. 제안한 프로토콜은 대칭키 암호를 기반으로 하지만 신뢰기관이 구매자의 핑거프린트 생성에 참여하지 않으면서도 비대칭성을 만족한다. 신뢰기관의 비 참여로 인하여 제안한 프로토콜에서는 신뢰기관의 관리가 필요 없으며 구매자는 공모 공격으로부터 안전할 수 있다.

• International Journal of Aeronautical and Space Sciences
• /
• 제2권1호
• /
• pp.1-11
• /
• 2001

The time implicit point SGS scheme is applied to compute hypersonic viscous flows in thermochemical nonequilibrium. The performance of the point SGS scheme is then compared with those of the line SGS and the LU-SGS schemes. Comparison of convergence histories with the effect of multiple forward and backward sweeps are made for the flow over a 2D cylinder experimentally studied by Hornung and the flow over a hemisphere at conditions corresponding to the peak heating condition during the reentry flight of an SSTO vehicle. Results indicate that the point SGS scheme with multiple sweeps is as robust and efficient as the line SGS scheme. For the point SGS and the LU-SGS scheme, the rate of improvement in convergence is largest with two sweep cycles. However, for the line SGS scheme, it is found that more than one sweep cycle deteriorates the convergence rate.

• 대한수학회논문집
• /
• 제18권1호
• /
• pp.169-179
• /
• 2003

In this paper, we propose multiparty key agreement protocols by generalizing the Blom's scheme based on 2 variable polynomials. Especially we develop three party and four party key agreement schemes with security. The advantage of the new schemes is to have small demands on storage space.