• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1276-1281
• /
• 2002

Bellare and Rivest proposed the translucent cryptography which was a kind of key recovery system. Translucent cryptography is a system in which the third party can recover encrypted message with the probability p(0$\leq$p$\leq$1). The key recovery agency doesn't need to store the user's private key in advance. The balance between key recovery agency and user can be controlled by the value of p. For example, if p is set to be 0.4 then the key recovery agency can recover 40 out of 100 encrypted messages. In this paper, we show that user can easily deceive the key recovery agency in the translucent cryptography. Then we propose the solution of this problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.63-70
• /
• 1988

Recently a new regime, called "back school" is advocated for the purpose of rapidly and economically returning a patient to full functional fitness and normal occupational activities. Assuming that this functional and vocational restoration is a goal of a regabilitation program, it is apparent that early recovery and higher success rate are major concern. In this study, a mixture model is developed and used to evaluate the recovery process of low back pain (LBP) patients in a rehabilitation program. The model provides (1) the probability of being recovered, and (2) the rate of recovery. Patients with gradual onset, with higher education, or of young age tend to show better prognosis.

• Journal of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.689-701
• /
• 2019

We study the recovery results of ${\ell}_p$-constrained compressive sensing (CS) with $p{\geq}1$ via robust width property and determine conditions on the number of measurements for standard Gaussian matrices under which the property holds with high probability. Our paper extends the existing results in Cahill and Mixon from ${\ell}_2$-constrained CS to ${\ell}_p$-constrained case with $p{\geq}1$ and complements the recovery analysis for robust CS with ${\ell}_p$ loss function.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.59-69
• /
• 2006

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.112-121
• /
• 2007

In this paper, we propose a new checkpointing strategy for dual modular redundancy real-time systems. For every checkpoints the execution results from two processors, and the result saved in the previous checkpoint are compared to detect faults. We devised an operation algorithm in chectpoints to recover from transient faults as well as permanent faults. We also develop a Markov model for the optimization of the proposed checkpointing strategy. The probability of successful task execution within its deadline is derived from the Markov model. The optimal number of checkpoints is the checkpoints which makes the successful probability maximum.

• Nuclear Engineering and Technology
• /
• v.54 no.1
• /
• pp.110-116
• /
• 2022

Human failure event (HFE) dependency analysis is a part of human reliability analysis (HRA). For efficient HFE dependency analysis, a maximum number of minimal cut sets (MCSs) that have HFE combinations are generated from the fault trees for the probabilistic safety assessment (PSA) of nuclear power plants (NPPs). After collecting potential HFE combinations, dependency levels of subsequent HFEs on the preceding HFEs in each MCS are analyzed and assigned as conditional probabilities. Then, HFE recovery is performed to reflect these conditional probabilities in MCSs by modifying MCSs. Inappropriate HFE dependency analysis and HFE recovery might lead to an inaccurate core damage frequency (CDF). Using the above process, HFE recovery is performed on MCSs that are generated with a non-zero truncation limit, where many MCSs that have HFE combinations are truncated. As a result, the resultant CDF might be underestimated. In this paper, a new method is suggested to incorporate HFE recovery into the MCS generation stage. Compared to the current approach with a separate HFE recovery after MCS generation, this new method can (1) reduce the total time and burden for MCS generation and HFE recovery, (2) prevent the truncation of MCSs that have dependent HFEs, and (3) avoid CDF underestimation. This new method is a simple but very effective means of performing MCS generation and HFE recovery simultaneously and improving CDF accuracy. The effectiveness and strength of the new method are clearly demonstrated and discussed with fault trees and HFE combinations that have joint probabilities.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2002.09a
• /
• pp.300-307
• /
• 2002

Bridge foundation failure considering the effect of local scour around pier foundations under hi-directional seismic excitations is examined in probabilistic perspectives. The seismic responses of bridges with deep foundations are evaluated with a simplified mechanical model, which can consider the local scour effect around the deep foundation in addition to many other components. The probabilistic characteristics of local scour depths are estimated by using the Monte Carlo simulation. The probabilistic characteristics of basic random variables used in the Monte Carlo simulation are determined from the actual hydraulic data collected in middle size streams in Korea. The failure condition of deep foundation is assumed as bearing capacity failure of the ground below the foundation base. The probability of foundation failure of a simply supported bridge with various scour conditions and hi-directional seismic excitations are examined. It is found that the local scour and the recovery duration are critical factors in evaluating the probability of foundation failure. Moreover, the probability of foundation failure under hi-directional seismic excitations is much higher than under uni-directional seismic excitations. Therefore, it is reasonable to consider hi-directional seismic excitations in evaluating the seismic safety of bridge systems scoured by a flood.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.307-315
• /
• 2010

Although a substantial amount of studies have been carried out in order to improve the performance of IEEE 802.11, most of them focused on how to slowly decrease the Contention Window size, instead of resetting it to its initial value. Slow decreasing of the window size reduces the collision probability and increases the channel throughput. Therefore, it is difficult to achieve good results in a heterogeneous network which coexists with the original DCF. For instance, a Gentle DCF(GDCF) has good performance in a homogeneous environment, while it can hardly transmit frames in a heterogeneous environment including the original DCF. It is because the slow decreasing of the window size reduces the transmission probability. In this paper, we propose a Fast Recovery DCF(FRDCF) to solve this problem. In the FRDCF, the reset mechanism of the original DCF is maintained to keep the transmission probability high, while a new counter is used to enhance the performance of the wireless LAN. We prove that, compared with the GDCF, the FRDCF has better performance in a heterogeneous wireless LAN.

• The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
• /
• v.23 no.2
• /
• pp.151-162
• /
• 2010

Objective : Bell's palsy is common and has many clinic study. but bell's palsy prognosis is not enough specific. So this study was evaluated bell's palsy prognosis, treatment number, sequela of normal group and bad prognosis group. Methods : From June 2009 to June 2010, patients who visited Dong-seo Oriental Medicine ENT. A clinic study was done on patient who were diagnosed bell's palsy, onset 2weeks within when first visited OPD and treated 3 times over in Dong-seo Oriental Medicine Cental. To evaluate grade of paralysis, House-Brackman Scale was used. We classified treatment numbers of each HB-Scale group, normal gIVroup and bad prognosis group. Results : The distribution of Onset HB-Scale : Gr II 26.25%, Gr III 67.5%, Gr IV 6.25% Onset HB-Scale Gr II patients completely recover 100% Onset HB-Scale Gr III patients completely recover 64.8%, improved 27.8%, nothing change 7.4% Onset HB-Scale Gr IV patients completely recover 40%, improved 60% Onset HB-Scale Gr II & IV patients recovery percentage make no difference of normal group (Group A) and bad prognosis. Onset HB-Scale Gr III patients completely recover Group A 66.7%, Group B 52.9%, improved Group A 23.2%, Group 35.3%, noting change Group A 5.1%, Group B 11.8% Onset HB-Scale Gr II patients has no sequela. Onset HB-Scale Gr III & IV patients has tendency that they treat more times, more improving and less sequela probability Conclusion : Onset HB-Scale is the indicator of acute bell's palsy prognosis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2148-2167
• /
• 2021

The proliferation of the Internet of Things (IoT) technologies and applications, especially the rapid rise in the use of mobile devices, from individuals to organizations, has led to the fundamental role of secure wireless networks in all aspects of services that presented with many opportunities and challenges. To ensure the CIA (confidentiality, integrity and accessibility) security model of the networks security and high efficiency of performance results in various resource-constrained applications and environments of the IoT platform, DDO-(data-driven operation) based constructions have been introduced as a primitive design that meet the demand of high speed encryption systems. Among of them, the TMN-family ciphers which were proposed by Tuan P.M., Do Thi B., etc., in 2016, are entirely suitable approaches for various communication applications of wireless mobile networks (WMNs) and advanced wireless sensor networks (WSNs) with high flexibility, applicability and mobility shown in two different algorithm selections, TMN64 and TMN128. The two ciphers provide strong security against known cryptanalysis, such as linear attacks and differential attacks. In this study, we demonstrate new probability results on the security of the two TMN construction versions - TMN64 and TMN128, by proposing efficient related-key recovery attacks. The high probability characteristics (DCs) are constructed under the related-key differential properties on a full number of function rounds of TMN64 and TMN128, as 10-rounds and 12-rounds, respectively. Hence, the amplified boomerang attacks can be applied to break these two ciphers with appropriate complexity of data and time consumptions. The work is expected to be extended and improved with the latest BCT technique for better cryptanalytic results in further research.