• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1516-1526
• /
• 2017

Many organizations today use patch management systems to uniformly manage software vulnerabilities. However, the patch management system does not guarantee the integrity of the patch in the process of providing the patch to the client. In this paper, we propose a method to guarantee patch integrity through dual electronic signatures. The dual electronic signatures are performed by the primary distribution server with the first digital signature and the secondary distribution server with the second digital signature. The dual electronic signature ensures ensure that there is no forgery or falsification in the patch transmission process, so that the client can verify that the patch provided is a normal patch. The dual electronic signatures can enhance the security of the patch management system, providing a secure environment for clients.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.129-136
• /
• 2003

A representative payment broker system is SET and one of its signature shcemes is a dual digital signature scheme. A dual digital signature scheme expose neither user's payment information(credit card number etc.) to merchandiser, nor user's order information to bank So it keeps user's Privacy safe. The digital signature scheme like this is being necessary as E-commerce is revitalized. But a dual digital signature of SET is not appropriate for wireless environments because it needs so many computations and communications. In this paper, we propose a signcryption scheme that generates a polynomial using a payment information for merchandiser and an order information for bank in order to reduce communications. We analyze the problem of existing signcryption schemes and dual digital signature schemes. Also we analyze the security properties of the proposed scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.3
• /
• pp.225-236
• /
• 2002

In this paper, to counteract a cross-polarization interference caused by co-channel dual polarization technique of digital radio relay system(DRRS), we analyze the theoretical model and digital design of cross-polarization interference canceller(XPIC). In addition a complex adaptive time domain equalizer(ATDE) is designed using a finite impulse response filter, and the structure of XPIC and its control method are also illustrated including ATDE. Our computer simulation shows that about 25 dB signature and more than 23 dB XPIC improvement factor can be obtained with XPIC and ATDE. In order to verify the operation of designed XPIC, we review the simulated results in view of tap number, algorithm convergence, system signature, and XPlC improvement factor in connection with 64-QAM DRRS with co-channel dual polarization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.2
• /
• pp.411-420
• /
• 1999

The topic of electronic commerce is a hot issue in computer technology. There are many kinds of risks associated with electronic commerce which performs financial transactions by exchanging electronic information over public networks. Therefore, security factors such as confidentiality, integrity, authentication and non-repudiation should be required to construct secure electronic commerce systems. In this paper, the credit card-based payment protocol applying dual signature is presented. It provides payment information to the bank a cardholder pays to, but conceals ordering information. It also offers ordering information to a merchant, but hides payment information including the card number. Thus, cardholder's private information can be protected. In order to accomplish this, dual signature is performed employing both symmetric method utilizing cardholder's secret number as an encryption key and asymmetric method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1266-1273
• /
• 1996

The nice concept of undeniable signatures was presented by Chaum and van Antwerpen. Briefly, an undeniable signature is signature which cannot be verified withoug the help of the signer. They are therefore less personal than ordinary signatures in the sense that a signature cannot be related to the signer without his help. On the other hand, the signer can only repudiate an alleged signature by proving that it is incorrect. Boyar, Chaum, damgard and Pedersen introduce convertible undeniable signatures. In this schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. And, S.J.Kim, S.J.Park and D.H.Won propose a new kind of signature scheme, called "nominative signatures:, that is the dual scheme of undeniable signatures. nominative signatures acheieve theses objectives:Only nominee can verify the nominator(signer)' signature and if necessary, only nominee can prove to the third party that the signature is issued to him(her) and is valid. In this paper we present an efficient integrated system of nominative signatures and (convertible) undeniable signatures. i.e. we show how nominative signature scheme can be changed into a (convertible) undeniable signatures.ures.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.1
• /
• pp.15-24
• /
• 1996

In this paper, we propose a new kind of signature scheme, called 'nominative signatures&, which is the dual scheme of undeniable signatures. Also we construct a zero-knowledge protocol that implements it. The new technique called 'nominative signatures' achieves these objectives: only nominee can verity the nominator(signer)'s signature and if necessary, only nominee can prove to the third party that the signature is issued to him(her) and is valid. Contraty to the undeniable signature scheme, nominative signatures are confirmed via a protocol between the nominee and the third party, so the cooperation of the nominee is necessary. That is, not a signer(nominator) but a verifier(nominee) can control the abuse of signatures - undeniable signature cannot be verified without the cooperation of the signer, so the signer controls the abuse of signatures. Our nominative signatures are very valuable for the case in which the content of signature is concerned with the verifier's privacy.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.882-889
• /
• 2010

The development of network technology has made rapid growth for online gaming industry on the Internet. Recently, game players have been wanting for a free migration on the game character for game player managed by online game servers of different types. Existing research on the acceptance of the game players demands have suggested migration model of the game character. However, the game Character Migration Process between the game server of different types migration is focused only, and safety issue that is necessary in an online transaction is overlooked. Therefore, ensure the safety of transactions information and when a dispute arises is necessary countermeasures. In this paper, Secure game Character Migration System (SCMP) using dual signature method when migrating game characters between the game servers of different types based on existing research is propose and looks to examine the safety.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1516-1528
• /
• 2015

We introduce attribute set based signature (ASBS), a new cryptographic primitive which organizes user attributes into a recursive set based structure such that dynamic constraints can be imposed on how those attributes may be combined to satisfy a signing policy. Compared with attribute based signature (ABS), ASBS is more flexible and efficient in managing user attributes and specifying signing policies. We present a practical construction of ASBS and prove its security in the standard model under three subgroup decision related assumptions. Its efficiency is comparable to that of the most efficient ABS scheme.

• International Journal of Aeronautical and Space Sciences
• /
• v.2 no.2
• /
• pp.28-38
• /
• 2001

A numerical method for the assessment and correction of tunnel wall interference effects on forced-oscillation testing is presented. The method is based on the wall pressure signature method using computed wall pressure distributions. The wall pressure field is computed using unsteady three-dimensional full Navier-Stokes solver for a 70-degree pitching delta wing in a wind tunnel. Approximately-factorized alternate direction implicit (AF-ADI) scheme is advanced in time by solving block tri-diagonal matrices. The algebraic Baldwin-Lomax turbulence, model is included to simulate the turbulent flow effect. Also, dual time sub-iteration with, local, time stepping is implemented to improve the convergence. The computed wall pressure field is then imposed as boundary conditions for Euler re-simulation to obtain the interference flow field. The static computation shows good agreement with experiments. The dynamic computation demonstrates reasonable physical phenomena with a good convergence history. The effects of the tunnel wall in upwash and blockage are analyzed using the computed interference flow field for several reduced frequencies and amplitudes. The corrected results by pressure signature method agree well with the results of free air conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.743-746
• /
• 2005

본 논문에서는 디지털 비디오 인코딩 과정의 VLC(variable length coding) 영역에서 블록계층의 DC/AC 성분을 이용한 인증과 서명의 이중 비디오 워터마킹 시스템을 제안하였다. 제안한 기법은 블록계층의 DC 성분과 AC 성분에서 HVS(human visual system)의 특성을 고려한 것이다. 인증 워터마킹은 주요한 정보를 포함하는 저주파 영역과 윤곽선 정보를 포함하는 중간 주파수 영역을 이용하여 인트라 프레임의 DC 성분과 움직임 벡터의 부호를 변형시켰고, 서명 워터마킹은 모든 프레임의 AC 성분들 중에서 마지막 AC 성분의 Level이 '1'인 경우에만 워터마크를 삽입하였다. 서명 워터 마크 검출은 저작권자의 비밀 키에 의해서만 가능하고, 기술적인 면에서 저자권자의 판별 기준이 될 수 있다. 제안한 이중 비디오 워터마킹 시스템의 특징은 인증과 서명의 두 가지 기능을 선택적으로 수행할 수 있으며, 계산과정이 복잡하지 않으면서 비트 스트림(bit-stream)을 유지시킨다. 그리고 실험 결과에서 기존의 방법보다 화질 면에서 $2{\sim}3dB$ 더 높은 수치를 얻어 우수함을 보였고, 인코딩 수행 속도에 미치는 영향은 거의 없었으며, 향후 실시간 인코딩 처리에 응용될 수 있다.