• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3231-3249
• /
• 2014

Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to "fake" the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. Sender - side deniable encryption scheme is considered to be one of the classification of deniable encryption technique which defined as resilient against coercing the sender. M. H. Ibrahim presented a sender - side deniable encryption scheme which based on public key and uncertainty of Jacobi Symbol [6]. This scheme has several problems; (1) it can't be able to derive the fake message $M_f$ that belongs to a valid message set, (2) it is not secure against Quadratic Residue Problem (QRP), and (3) the decryption process is very slow because it is based dramatically on square root computation until reach the message as a Quadratic Non Residue (QNR). The first problem is solved by J. Howlader and S. Basu's scheme [7]; they presented a sender side encryption scheme that allows the sender to present a fake message $M_f$ from a valid message set, but it still suffers from the last two mentioned problems. In this paper we present a new sender-side deniable public-key encryption scheme with fast decryption by which the sender is able to lie about the encrypted message to a coercer and hence escape coercion. While the receiver is able to decrypt for the true message, the sender has the ability to open a fake message of his choice to the coercer which, when verified, gives the same ciphertext as the true message. Compared with both Ibrahim's scheme and J. Howlader and S. Basu's scheme, our scheme enjoys nice two features which solved the mentioned problems: (1) It is semantically secure against Quadratic Residue Problem; (2) It is as fast, in the decryption process, as other schemes. Finally, applying the proposed deniable encryption, we originally give a coercion resistant internet voting model without physical assumptions.

• 대한기계학회논문집B
• /
• 제27권6호
• /
• pp.796-803
• /
• 2003

The discrete ordinates interpolation method (DOIM) has shown good accuracy and versatile applicability for the radiation $problems^{(1,2)}$. The DOIM is a nonconservative method in that the intensity and temperature are computed only at grid points without considering control volumes. However, when the DOIM is used together with a finite volume algorithm such as $SIMPLER^{(3)}$, intensities at the control surfaces need to be calculated. For this reason, a 'quadratic' and a 'decoration' schemes are proposed and examined. They are applied to two kinds of radiation problem in one-dimensional geometries. In one problem, the intensity and temperature are calculated while the radiative heat source is given, and in the other, the intensity and the radiative heat source are computed with a given temperature field. The quadratic and the decoration schemes show very successful results. The quadratic scheme gives especially accurate results so that further decoration may not be needed. It is recommended that the quadratic and the decoration schemes may be used together, or, one of them may be applied for control volume radiative energy balance.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제18권3호
• /
• pp.269-277
• /
• 2014

A numerical scheme is proposed to control the BBMB (Benjamin-Bona-Mahony-Burgers) equation, and the scheme consists of three steps. Firstly, BBMB equation is converted to a finite set of nonlinear ordinary differential equations by the quadratic B-spline finite element method in spatial. Secondly, the controller is designed based on the linear quadratic regulator (LQR) theory; Finally, the system of the closed loop compensator obtained on the basis of the previous two steps is solved by the backward Euler method. The controlled numerical solutions are obtained for various values of parameters and different initial conditions. Numerical simulations show that the scheme is efficient and feasible.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• 대한수학회지
• /
• 제61권4호
• /
• pp.621-657
• /
• 2024

In this study, the numerical solution of a space-fractional Burgers' equation with initial and boundary conditions is considered. This equation is the simplest nonlinear model for diffusive waves in fluid dynamics. It occurs in a variety of physical phenomena, including viscous sound waves, waves in fluid-filled viscous elastic pipes, magneto-hydrodynamic waves in a medium with finite electrical conductivity, and one-dimensional turbulence. The proposed QBS/CNG technique consists of the Galerkin method with a function basis of quadratic B-splines for the spatial discretization of the space-fractional Burgers' equation. This is then followed by the Crank-Nicolson approach for time-stepping. A linearized scheme is fully constructed to reduce computational costs. Stability analysis, error estimates, and convergence rates are studied. Finally, some test problems are used to confirm the theoretical results and the proposed method's effectiveness, with the results displayed in tables, 2D, and 3D graphs.

• Nuclear Engineering and Technology
• /
• 제50권7호
• /
• pp.1043-1050
• /
• 2018

For an efficient Monte Carlo (MC) burnup analysis, an accurate high-order depletion scheme to consider the nonlinear flux variation in a coarse burnup-step interval is crucial accompanied with an accurate depletion equation solver. In a Seoul National University MC code, McCARD, the high-order depletion schemes of the quadratic depletion method (QDM) and the linear extrapolation/quadratic interpolation (LEQI) method and a depletion equation solver by the Chebyshev rational approximation method (CRAM) have been newly implemented in addition to the existing constant extrapolation/backward extrapolation (CEBE) method using the matrix exponential method (MEM) solver with substeps. In this paper, the quadratic extrapolation/quadratic interpolation (QEQI) method is proposed as a new high-order depletion scheme. In order to examine the effectiveness of the newly-implemented depletion modules in McCARD, four problems in the VERA depletion benchmarks are solved by CEBE/MEM, CEBE/CRAM, LEQI/MEM, QEQI/MEM, and QDM for gadolinium isotopes. From the comparisons, it is shown that the QEQI/MEM predicts ${k_{inf}}^{\prime}s$ most accurately among the test cases. In addition, statistical uncertainty propagation analyses for a VERA pin cell problem are conducted by the sensitivity and uncertainty and the stochastic sampling methods.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1115-1125
• /
• 2013

This paper presents a scheme for geometric correction of projected content for planar and quadratic projection surfaces. The scheme does not require the projection surface to be perfectly quadratic or planar and is therefore suitable for uneven low-cost commercial and home projection surfaces. An approach based on the recursive subdivision of second-order B$\acute{e}$zier patches is proposed for the estimation of projection distortion owing to surface imperfections. Unlike existing schemes, the proposed scheme is completely automatic, requires no prior knowledge of the projection surface, and uses a single uncalibrated camera without requiring any physical markers on the projection surface. Furthermore, the scheme is scalable for geometric calibration of multi-projector setups. The efficacy of the proposed scheme is demonstrated using simulations and via practical experiments on various surfaces. A relative distortion error metric is also introduced that provides a quantitative measure of the suppression of geometric distortions, which occurs as the result of an imperfect projection surface.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제15권6호
• /
• pp.425-429
• /
• 2009

최근 Chen 등은 태그 인증 시 서버의 전수조사를 막기 위해 제곱근을 구하는 어려움에 기반한 이차잉여를 이용한 상호인증기법을 제안하였다. 하지만 리더가 인증시작 시 악의적으로 같은 랜덤 값을 보내는 경우 태그의 위치가 노출되는 문제가 발생한다. 또한 제한된 연산능력을 가진 저가태그에 해쉬함수와 제곱연산을 동시에 수행해야 하는 어려움이 존재한다. 따라서 본 논문에서는 Chen 등의 기법을 살펴보고, 이 기법이 갖는 문제점을 지적한다. 또한 태그에서 인증 시마다 랜덤 값을 새롭게 생성하여 위치추적에 안전하며, Chen 등의 기법과 달리 제곱연산만을 사용함으로써 보다 효율적인 이차잉여기반의 상호인증 기법을 제안한다. 제안하는 기법은 중앙 서버의 전수조사 없이 태그 인증이 가능하며 인증 시마다 비밀값의 갱신 없이도 전방향안전성을 만족하여 비밀값 동기화 과정이 필요 없다.

• East Asian mathematical journal
• /
• 제29권5호
• /
• pp.503-510
• /
• 2013

A quadratic B-spline finite element method for the spatial variable combined with a Newton method for the time variable is proposed to approximate a solution of Benjamin-Bona-Mahony-Burgers (BBMB) equation. Two examples were considered to show the efficiency of the proposed scheme. The numerical solutions obtained for various viscosity were compared with the exact solutions. The numerical results show that the scheme is efficient and feasible.

• 한국항행학회논문지
• /
• 제20권1호
• /
• pp.53-58
• /
• 2016

우리는 본 논문에서 이차 칼만 필터를 이용한 영상 기반 객체 추적분야의 새로운 알고리즘을 제안한다. 최근에 발표된 이차 칼만 필터는 영상 기반의 객체의 실제 3차원 공간의 위치를 추적하는 것에는 아직 적용되지 않았다. 2차원 영상 내의 위치를 3차원 공간상의 위치로 환원시키는 것은 비선형적 변환을 수반하기 때문에 그에 맞는 추적 알고리즘을 사용해야만 한다. 이러한 상황에서, 비선형 수식을 이차식으로 근사화하는 이차 칼만 필터가 선형으로 근사화하는 확장 칼만 필터보다 더 정확한 성능을 낼 수 있다. 우리는 동일한 상황을 가정하여 확장 칼만 필터, 무향 칼만 필터, 파티클 필터, 그리고 우리가 제안한 이차 칼만 필터를 이용하여 객체를 추적하고, 그 결과를 비교해 본다. 결론적으로 이차 칼만 필터가 발산율이 확장 칼만 필터에 비해 거의 절반가량 감소하며, 추적 정확도 측면에서 무향 칼만 필터에 비해 1% 가량 우수한 성능을 나타낸다.