• Title/Summary/Keyword: new proof

Search Result 435, Processing Time 0.034 seconds

A Study on the Comfortable Pesticide-Proof Clothes (농약방제복 개발에 관한 연구)

  • Choi Jeong Wha;Kim Hyun Sik;Jeong Yong Ok
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.11 no.2 s.24
    • /
    • pp.91-100
    • /
    • 1987
  • To develop the comfortable pesticid-proof clothes, wearing trials for 7 types of existing pesticide-proof clothes were done measuring skin temperature, pulse rate, humidity and temperature of inside clothing and subjective feeling such as thermal, humid and comfort sensations at $28{\pm}1^{\circ}C$, $75{\pm}5\%$ RH, 2.3 m/sec wind speed. (Experiment 1). On the base of above results, wearing trials of 6 types of new pesticide-proof clothes and 3 types of pesticide-proof clothes as control group were done with the same method as experiment 1. (Experiment 2). The results obtained were as follows 1. Heat stress was lower in newly designed pesticide-proof clothes with mesh running shirts. 2. For the body temperature regulation, it was confirmed that 6 types of new pesticide-proof clothes made of microporous fabric were better than the others.

  • PDF

Efficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting

  • Peng, Kun
    • 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.

A Study on the Method to Avoid the Gas Group IIC Equipment of Explosion Proof Electrical Equipment Adjacent to the Source of Release of Hydrogen Handling Facility (수소 취급설비의 누출원에 인접한 방폭전기기기의 가스그룹 IIC 기기 회피 방안에 관한 연구)

  • BYUN, YOON SUP
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.33 no.4
    • /
    • pp.383-390
    • /
    • 2022
  • Appropriate explosion proof electrical equipment should be installed in hazardous areas. In areas where hydrogen is handled, explosion proof electrical equipment adjacent to the hydrogen handing facility must be reviewed for selection of gas group IIC (or IIB+H2) equipment. When selecting explosion proof electrical equipment for the flammable substance handling facility in areas where hydrogen and flammable substance are handled, the method to avoid gas group IIC (or IIB+H2) equipment has been suggested by using the operating pressure of the hydrogen handling facility. When the operating pressure of the outdoor hydrogen handling facility is 1.065 MPa or less, it has been confirmed that there is no need to install gas group IIC (or IIB+H2) equipment for the flammable substance handling facility adjacent to the hydrogen handling facility. And the method of selecting explosion proof electrical equipment for the flammable substance handling facility has been suggested as a flowchart, so it will be able to be utilized when selecting appropriate explosion proof electrical equipment.

A Study on New Proofs and Generalization of Haga Theorem in Paper folding (종이접기에서 Haga 정리의 증명과 일반화에 대한 연구)

  • Lee, Seong-Hyun;Jung, Sang-Hyuk;Han, In-Ki
    • Communications of Mathematical Education
    • /
    • v.22 no.1
    • /
    • pp.65-77
    • /
    • 2008
  • In this paper we study new proofs and generalization of Haga theorem in paper folding. We analyze developed new proofs of Haga theorem, compare new proofs with existing proof, and describe some difference of these proofs. We generalize Haga second theorem, and suggest simple proof of generalized Haga second theorem.

  • PDF

An Improved Efficient Provable Secure Identity-Based Identification Scheme in the Standard Model

  • Tan, Syh-Yuan;Chin, Ji-Jian;Heng, Swee-Huay;Goi, Bok-Min
    • 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.

MMOG User Participation Based Decentralized Consensus Scheme and Proof of Participation Analysis on the Bryllite Blockchain System

  • Yun, Jusik;Goh, Yunyeong;Chung, Jong-Moon;Kim, OkSeok;Shin, SangWoo;Choi, Jin;Kim, Yoora
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.4093-4107
    • /
    • 2019
  • Proof of Work (PoW) based blockchains have limitations in throughput, time consumption, and energy efficiency. In these systems, a miner will consume significant time and resources to obtain a reward for contributing to the blockchain. To overcome these limitations, recent research on blockchains are focused on accelerating the speed, scalability, and enhancing the security level. By enhancing specific procedures of blockchain system, the level of data integrity supported by the blockchain can become more robust, and efficient. In this paper, a new blockchain consensus model based on the Bryllite Consensus Protocol (BCP) is proposed to support a hyper-connected massively multiplayer online game (MMOG) ecosystem. The BCP scheme enables users to participate directly in new consensus processes through a Proof of Participation (PoP) algorithm. In this model, the consensus algorithm has a simpler form while maintaining high security level. In addition, because the BCP scheme gives users an equal chance to make a contribution to the blockchain, rewards are distributed in an equal fashion, which motivates user participation. The analysis of the proposed scheme is applied to the Bryllite consortium blockchain system (homed in Hong Kong), which is a new blockchain network developed for international game industries, gamers, and game events.

Strong Yoking Proof Protocols for RFID Tags (RFID tag를 위한 강력한 Yoking Proof Protocols)

  • Cho, Jung-Sik;Yeo, Sang-Soo;Kim, Sung-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.310-318
    • /
    • 2007
  • The RFID system is a non-contact automatic identification system that identifies tags through a reading device by attaching small, inexpensive tags on goods. This system is expected to supplant barcodes, the contactless reading technique that is most widely used at present. The RFID system can be applied in a variety of areas. Among those, Ari Juels proposed an environment to prove that a pair of tags has been scanned simultaneously And he presented a yoking proof protocol for this. But the yoking-proof protocol is vulnerable to replay attack. Although modified yoking-proof protocols for alleviating this drawback have been proposed, they are not immune to replay attack, either. In this paper, we analyze problems of existing yoking-proof protocols and present a new protocol, which will make replay attack difficult, based on this analysis. We have also extend this protocol so that it can provide yoking proofs for n tags.

Strong Yoking-Proof Protocol using Light-Weighted MAC (경량화된 MAC을 이용한 강력한 Yoking-Proof 프로토콜)

  • Cho, Chang-Hyun;Lee, Jae-Sik;Kim, Jae-Woo;Jun, Moon-Seog
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.6
    • /
    • pp.83-92
    • /
    • 2009
  • Ari Juels proposed Yoking-Proof protocol for authenticating multiple tags simultaneously using RFID system. Because common Yoking-Proof methods authenticate by using MAC (Message Authentication Code), it is difficult to apply them to inexpensive tags. It is also difficult to implement common hash functions such as MD5 in inexpensive tags. So, Ari Juels also proposed a lightweighted Yoking-Proof method with only 1 authentication. However, Minimalist MAC, which is a lightweighted MAC used in the proposed method is for single-use, and the proposed structure is vulnerable to replay attacks. Therefore, in this study, the minimalist MAC using Lamport's digital signature scheme was adopted, and a new type of Yoking-Proof protocol was proposed where it uses tags that are safe from replay attacks while being able to save multiple key values.