• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.549-560
• /
• 2011

Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash function operations that only need a very small number of costly public key cryptographic operations. It can handle untrusted verifiers and achieve stronger zero knowledge privacy. As a result, the efficiency and privacy of homomorphic e-voting applications will be significantly improved.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.1176-1179
• /
• 2012

To ensure the correctness of high performance satisfiability (SAT) solvers, several proof formats have been proposed. SAT solvers can report a formula being unsatisfiable with a proof, which can be independently verified by a trusted proof checker. Among the proof formats accepted at the SAT competition, the Reverse Unit Propagation (RUP) format is considered the most popular. However, the official proof checker was not efficient and failed to check many of the proofs at the competition. This inefficiency is one of the drawbacks of SAT proof checking. In this paper, I introduce a work-in-progress project, vercheck to implement an efficient RUP checker using modern SAT solving techniques. Even though my implementation is larger and more complex, the level of trust is preserved by statically verifying the correctness of the code. The vercheck program is written in GURU, a dependently typed functional programming language with a low-level resource management feature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.910-922
• /
• 2013

In 2008, Chin et al. proposed an efficient and provable secure identity-based identification scheme in the standard model. However, we discovered a subtle flaw in the security proof which renders the proof of security useless. While no weakness has been found in the scheme itself, a scheme that is desired would be one with an accompanying proof of security. In this paper, we provide a fix to the scheme to overcome the problem without affecting the efficiency as well as a new proof of security. In particular, we show that only one extra pre-computable pairing operation should be added into the commitment phase of the identification protocol to fix the proof of security under the same hard problems.

• Journal of the Korean Home Economics Association
• /
• v.37 no.11
• /
• pp.75-83
• /
• 1999

To develope an efficient fire fighter’s uniform for the fire fighting work and body protection, this study examined the regulations of fire lighter’s uniform and surveyed the actual wearing conditions, satisfaction degree, preferred color and design others. The results are as follows; 1. As for the satisfaction degree, the degree was normal in ordinary, low in working uniform and heat-proof uniform and very low in water-proof uniform about its design, size, color and materials. 2. As for the color, red was preferred for the working uniform and water-proof uniform. Blue, yellow and green was preferred next for corking uniform and yellow and blue for water-proof uniform. 3. As for the design, fire fighters wanted partial revision of the present uniform. They preferred stretchy training wear style and overact style in order. For the water-proof uniform, they preferred hip-length suit and pants and next to it they liked flee-length suit, waist belt and overact in order. 4. As for the regulations of the uniform, they wanted some addition in casual uniform, water-proof pants and water-proof gloves, and some deletion in the thermal barrier of water-proof uniform and ordinary uniform. 5. As for the distribution of the uniforms, the use of coupons was highly preferred.

• The Journal of the Korea Contents Association
• /
• v.21 no.2
• /
• pp.113-120
• /
• 2021

RFID (Radio Frequency Identification) yoking authentication provides methods scanning a pair of RFID tags with a reader device and verifying them to ensure the physical proximity of objects. In the first yoking proof protocols, a verifier connected to a reader device online is essential to verify the yoking proof, and this condition limits the environment in which yoking proof can be applied. To solve this limitation, several studies have been conducted on offline yoking proof protocol that does not require the online connection between a reader and a verifier. However, the offline yoking proof protocols do not guarantee the basic requirements of yoking proof, and require relatively more operations on the tag compared to the previous yoking proof protocols. This paper proposes an efficient offline yoking proof protocol that supports offline verification without the need for an online verifier. The proposed protocol provides a secure yoking proof with fewer number of operations than the existing ones, and it also can be extended to the group proof for more than a pair of tags without additional devices. The analysis in this paper shows that the proposed protocol provides offline verification securely and effectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2532-2553
• /
• 2014

In Asiacrypt 2003, Al-Riyami and Paterson proposed the notion of certificateless cryptography, a technique to remove key escrow from traditional identity-based cryptography as well as circumvent the certificate management problem of traditional public key cryptography. Subsequently much research has been done in the realm of certificateless encryption and signature schemes, but little to no work has been done for the identification primitive until 2013 when Chin et al. rigorously defined certificateless identification and proposed a concrete scheme. However Chin et al.'s scheme was proven in the random oracle model and Canetti et al. has shown that certain schemes provable secure in the random oracle model can be insecure when random oracles are replaced with actual hash functions. Therefore while having a proof in the random oracle model is better than having no proof at all, a scheme to be proven in the standard model would provide stronger security guarantees. In this paper, we propose the first certificateless identification scheme that is both efficient and show our proof of security in the standard model, that is without having to assume random oracles exist.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.10a
• /
• pp.125-130
• /
• 2014

High speed railroad car and high-rise apartment with development of railway technology cause different problems of noise contrary to the previous generation. It is the most efficient noise reduction countermeasure but we studied that is the way on noise propagation with sound proof wall or sound proof tunnel around railroad. But if it were railroad on bridge, additional cost which is more expensive than installing one on the ground is needed. So sound insulation material considering reducing weight of recent soundproof facilities must be selected. It is in this study that predicted and analyzed acoustical and structural effect for noise reduction by installing soundproof tunnel. If it were departmentalized into additional study, could be able to expect noise reduction effect of sound proof tunnel establishment on the bridge.

• The Pure and Applied Mathematics
• /
• v.21 no.4
• /
• pp.307-316
• /
• 2014

We prove the existence of the risk-efficient options proposed by Xu [7]. The proof is given by both indirect and direct ways. Schied [6] showed the existence of the optimal solution of equation (2.1). The one is to use the Schied's result. The other one is to find the sequences converging to the risk-efficient option.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.438-443
• /
• 2008

The efficient method to implement the Max-Log-MAP algorithm is proposed by modifying the conventional algorithm. It is called a parallel soft output Viterbi algorithm (SOVA) and the rigorous proof is given for the equivalence between the Max-Log-MAP algorithm and the parallel SOVA. The parallel SOVA is compared with the conventional algorithms and we show that it is an efficient algorithm implementing the modified SOVA in parallel.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.04a
• /
• pp.366-370
• /
• 2014

Considering a countermeasure against vibration along the existing line, in many cases, it may be the most efficient method to replace existing fasteners with high resilient fasteners because of the restriction of the construction of a new track type. There are many types of high resilient fasteners which are different in price and performance. Therefore it is important to choose the high resilient fastener which has best vibration-proof performance per price. In this study, a prediction method which can exactly evaluate the performance of a fastener in the reduction the ground borne noise in the existing line is presented, which is constructed based on the combination of the measurement and the simulation. A numerical example using the presented method is introduced to evaluate the vibration-proof performance for the solution of the vibration problem in the existing line.