• Title/Summary/Keyword: Symmetric Scheme

Search Result 235, Processing Time 0.02 seconds

Strongly-Connected Hierarchical Grid-Based Pairwise Key Predistribution Scheme for Static Wireless Sensor Networks (정적 무선 센서 네트워크를 위한 강한 연결성을 가진 계층적 그리드 기반의 키 선분배 기법)

  • Nyang Dae-Hun;Abedelaziz Mohaisen
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.14-23
    • /
    • 2006
  • Wireless Sensor Network(WSN) consists of huge number of sensor nodes which are small and inexpensive with very limited resources. The public key cryptography is undesirable to be used in WSN because of the limitations of the resources. A key management and predistribution techniques are required to apply the symmetric key cryptography in such a big network. Many key predistribution techniques and approaches have been proposed, but most of-them didn't consider the real WSN assumptions, In this paper, we propose a security framework that is based on a hierarchical grid for WSN considering the proper assumptions of the communication traffic and required connectivity. We apply simple keying material distribution scheme to measure the value of our framework. Finally, we provide security analysis for possible security threats in WSN.

Security Analysis and Improvement of an Anonymous Asymmetric Fingerprinting Scheme with Trusted Third Party (익명적 비대칭 핑거프린팅 기법의 보안 취약성 분석 및 개선 방안)

  • Kwon, Sae-Ran
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.5
    • /
    • pp.396-403
    • /
    • 2009
  • An anonymous asymmetric fingerprinting protocol combined with watermarking techniques, is one of the copyright protection technologies keeping both right of a seller and that of a buyer, where a seller and an anonymous buyer perform such a protocol that employs various cryptographic tools in order that the seller does not know the exact watermarked copy that the buyer receives, while inserting an invisible non-removable fingerprint i.e., each different unique watermark, into each copy of the digital content to be sold. In such a protocol innocent buyers are kept anonymous during transactions, however, the unlawful reseller is unambiguously identified with a real identity as a copyright violator. In 2007, Yong and Lee proposed an anonymous asymmetric fingerprinting scheme with trusted third party. In this paper we point out the weakness of their scheme such as: the buyer with intention can remove the fingerprint in the watermarked content, because he/she can decrypt the encrypted fingerprint with a symmetric key using man-in-the-middle-attack; a real identity of a buyer can be revealed to the seller through the identification process even though he/she is honest. Furthermore, we propose an improved secure and efficient anonymous asymmetric fingerprinting scheme which enables to reduce the number of communication between the participants.

Privacy Preserving Keyword Search with Access Control based on DTLS (프라이버시를 보호하는 접근제어가 가능한 키워드 검색 기법)

  • Noh, Geon-Tae;Chun, Ji-Young;Jeong, Ik-Rae;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.5
    • /
    • pp.35-44
    • /
    • 2009
  • To protect sensitive personal information, data will be stored in encrypted form. However in order to retrieve these encrypted data without decryption, there need efficient search methods to enable the retrieval of the encrypted data. Until now, a number of searchable encryption schemes have been proposed but these schemes are not suitable when dynamic users who have the permission to access the data share the encrypted data. Since, in previous searchable encryption schemes, only specific user who is the data owner in symmetric key settings or has the secret key corresponding to the public key for the encrypted data in asymmetric key settings can access to the encrypted data. To solve this problem, Stephen S. Yau et al. firstly proposed the controlled privacy preserving keyword search scheme which can control the search capabilities of users according to access policies of the data provider. However, this scheme has the problem that the privacy of the data retrievers can be breached. In this paper, we firstly analyze the weakness of Stephen S. Yau et al.'s scheme and propose privacy preserving keyword search with access control. Our proposed scheme preserves the privacy of data retrievers.

Modified Finite Volume Time Domain Method for Efficient Prediction of Radar Cross Section at High Frequencies

  • Chatterjee, Avijit;Myong, Rho-Shin
    • Journal of electromagnetic engineering and science
    • /
    • v.8 no.3
    • /
    • pp.100-109
    • /
    • 2008
  • The finite volume time domain(FVTD) technique faces serious limitations in simulating electromagnetic scattering at high frequencies due to requirements related to discretization. A modified FVTD method is proposed for electrically large, perfectly conducting scatterers by partially incorporating a time-domain physical optics(PO) approximation for the surface current. Dominant specular returns in the modified FVTD method are modeled using a PO approximation of the surface current allowing for a much coarser discretization at high electrical sizes compared to the original FVTD scheme. This coarse discretization can be based on the minimum surface resolution required for a satisfactory numerical evaluation of the PO integral for the scattered far-field. Non-uniform discretization and spatial accuracy can also be used in the context of the modified FVTD method. The modified FVTD method is aimed at simulating electromagnetic scattering from geometries containing long smooth illuminated sections with respect to the incident wave. The computational efficiency of the modified FVTD method for higher electrical sizes are shown by solving two-dimensional test cases involving electromagnetic scattering from a circular cylinder and a symmetric airfoil.

A Study on Authentication Algorithm for NFC Security Channel (NFC 보안 채널을 위한 인증 알고리즘에 관한 연구)

  • Lee, Seon-Keun;Jeong, Woo-Yeol
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.805-810
    • /
    • 2012
  • Recently, applications range of NFC is widening by popularization of smartphone. Expansion of NFC means generalization of electronic payments systems. So security of NFC is very important. AES-128 is safe cryptographic technique for NFC now in use. But, the more range of applications increases, the more safe cryptographic techniques are necessary. In this paper, we propose the safe method is unaffected by the development of NFC. Proposed A-NFC scheme, adding the authentication of asymmetric cryptographic, is easy to apply for NFC and NFC-USIM chipsets, and it can adapt to the general NFC environment.

NUMERICAL STUDY ON FLOW OVER CIRCULAR CYLINDER USING NO SLIP BOUNDARY TREATMENT (점착경계처리법을 이용한 원형실린더 주위의 유동해석)

  • Kang Jung-Ho;Kim Hyung-Min
    • Journal of computational fluids engineering
    • /
    • v.11 no.3 s.34
    • /
    • pp.28-36
    • /
    • 2006
  • NSBT(No Slip Boundary Treatment) is a newly developed scheme for the treatment of a no slip condition on the solid wall of obstacle in a flow field. In our research, NSBT was used to perform LBM simulation of a flow over a circular cylinder to determine the flow feature and aerodynamics characteristic of the cylinder. To ascertain the applicability of NSBT on the complex shape of the obstacle, it was first simulated for the case of the flow over a circular and square cylinder in a channel and the results were compared against the solution of Navier-Stokes equation. The simulations were performed in a moderate range of Reynolds number at each cylinder position to identify the flow feature and aerodynamic characteristics of circular cylinder in a channel. The drag coefficients of the cylinder were calculated from the simulation results. We have numerically confirmed that the critical reynolds number for vortex shedding is in the range of 200$\sim$250. For the gap parameter $\gamma$ = 2 cases at Re > 240, the vortex shedding were symmetric and it resembled the Karmann vortex. As the cylinder approached to one wall, the vorticity significantly reduced in length while the vorticity on the other side elongated and the vorticity combined with the wall boundary-layer vorticity. The resultant $C_d$ by LBM concurred with the results of DNS simulation performed by previous researchers.

A STUDY ON THE MINIMUM CROSS-SECTIONAL AREA OF HIGH-SPEED RAILWAY TUNNEL SATISFYING PASSENGER EAR DISCOMFORT CRITERIA (승객 이명감 기준을 만족하는 고속철도 터널 최소 단면적에 대한 연구)

  • Kwon, H.B.
    • Journal of computational fluids engineering
    • /
    • v.20 no.3
    • /
    • pp.62-69
    • /
    • 2015
  • Pressure change inside cabin as well as in tunnel has been calculated to assess the passenger pressure comfort of high-speed train. $C-STA^{TM}$, a CFD program based on axi-symmetric Navier-Stokes equation and Roe's FDS has been used to simulate the pressure change in tunnel during a high-speed train passing through it. To present the relative motion between the train and the tunnel, a modified patched grid scheme based on the structured grid system has been employed. The simulation program has been validated by comparing the simulation results with field measurements. Extensive parametric study has been conducted for various train speed, tunnel cross-sectional area and tunnel length to the pressure change in cabin. KTX-Sancheon(KTX2) high-speed train has been chosen for simulation and the train speed have been varied from 200 km/h to 375 km/h. The tunnel length has been varied from 300 m to 7.5 km and tunnel area from $50m^2$ to $120m^2$. Total 504 simulations have been conducted varying the parameters. Based on the database produced from the parametric simulations, minimum tunnel cross-sectional area has been surveyed for various train speeds based on Korean regulation on pressure change in cabin.

A Study of the Twin Impulse Wave Discharged from the Exit of Two Parallel Tubes (두 평행한 관의 출구로부터 방출되는 트윈파에 관한 연구)

  • Kang, Sung-hwang;Kim, Jae-Ho;Kim, Heuy-dong
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.8 s.101
    • /
    • pp.962-967
    • /
    • 2005
  • The twin-impulse wave discharged from two parallel tubes is investigated to see flow patterns, compared with the single impulse wave. In the present study, the merging phenomena and propagation characteristics of the impulse waves are investigated by experiment and numerical computation. The Harten-Yee's total variation diminishing scheme is used to solve the unsteady, two-dimensional, compressible, Euler equations. The Mach number Ms of incident shock wave is lower than 1.5 and the distance between the tubes is between 1.2 and 4.0. In the shock tube experiment, the twin impulse waves are visualized by a Schlieren optical system in order to validate the computational result. It is shown that on the symmetric axis between two parallel tubes, the peak pressure produced by the twin impulse waves and its location strongly depend upon the tube distance and the incident shock Mach number, Ms. The predicted Schlieren images show a good agreement with the measured twin-impulse wave.

X+ Join : The improved X join scheme for the duplicate check overhead reduction (엑스플러스 조인 : 조인 중복체크의 오버헤드를 줄이기 위한 개선된 방법)

  • Baek, Joo-Hyun;Park, Sung-Wook;Jung, Sung-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.28-32
    • /
    • 2006
  • 유비쿼터스(Ubiquitous)환경과 같이 외부로부터 입력되는 데이터가 stream의 형식으로 실시간으로 들어오고, 입력의 끝을 알 수 없는 환경에서는 기존의 join방식으로는 문제를 해결 할 수 없다. 또한 이러한 환경 하에서는 데이터의 크기나 특성이 모두 다르고 네트워크 상태에 따라 입력이 많은 영향을 받게 된다. 이런 stream환경의 join연산을 위하여 double pipelined hash join, Xjoin, Pjoin등 많은 알고리즘이 기존의 연구를 대표하여 왔다. 그 중 Xjoin은 symmetric hash join과 hybrid hash join의 특징들을 이용해서 들어오는 data의 흐름에 따라서 reactive하게 join과정을 조절함으로써 streaming data에 대한 join을 수행한다. 그러나 여러 단계의 수행에 따른 연산의 중복결과를 체크하기 위한 overhead로 인해 성능이 떨어진다. 이 논문에서는 이러한 점을 개선하기 위해서 Xjoin의 수행과정을 수정한 방법을 제시할 것이다. 각 partition마다 구분자만을 추가함으로써 간단하게 중복을 만들어내지 않는 방법을 제안하고 불필요한 연산과 I/O를 줄일 수 있도록 partition선택방법을 추가할 것이다. 이를 통해서 중복된 연산인지 체크하는 과정을 상당히 단순화함으로써 좀 더 좋은 성능을 가지게 될 것이고 또한 timestamp를 저장해야 하는 overhead를 줄여서 전체 연산에 필요한 저장 공간을 절약할 수 있다.

  • PDF

Frame-Adaptive Distortion Estimation for Motion Compensated Interpolated Frame (움직임 보상 보간 프레임에 대한 프레임 적응적 왜곡 예측 기법)

  • Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.1-8
    • /
    • 2012
  • Video FRUC (Frame Rate Up Conversion) has been a technique of great interest due to its diversified applications in consumer electronics. Most advanced FRUC algorithms adopt a motion interpolation technique to determine the motion vector field of interpolated frames. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame is reconstructed. For this aim, this paper proposes a distortion estimation for motion compensated interpolation frame using frame-adaptive distortion estimation. The proposed method is applied for the symmetric motion estimation and compensated scheme and then analyzed by three different approaches, that is, forward estimation, backward estimation and adaptive bi-directional estimation schemes. Through computer simulations, it is shown that the proposed bi-directional estimation method outperforms others and can be effectively applied for FRUC.