• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5625-5641
• /
• 2017

Certificateless public key cryptography resolves the certificate management problem in traditional public key cryptography and the key escrow problem in identity-based cryptography. In recent years, some good results have been achieved in speeding up the computation of bilinear pairing. However, the computation cost of the pairing is much higher than that of the scalar multiplication over the elliptic curve group. Therefore, it is still significant to design cryptosystem without pairing operations. A multi-signer universal designated multi-verifier signature scheme allows a set of signers to cooperatively generate a public verifiable signature, the signature holder then can propose a new signature such that only the designated set of verifiers can verify it. Multi-signer universal designated multi-verifier signatures are suitable in many different practical applications such as electronic tenders, electronic voting and electronic auctions. In this paper, we propose a certificateless multi-signer universal designated multi-verifier signature scheme and prove the security in the random oracle model. Our scheme does not use pairing operation. To the best of our knowledge, our scheme is the first certificateless multi-signer universal designated multi-verifier signature scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.50-57
• /
• 2006

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.63-74
• /
• 2005

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.175-190
• /
• 2012

Shuffling is an effective method to build a publicly verifiable mix network to implement verifiable anonymous channels that can be used for important cryptographic applications like electronic voting and electronic cash. One shuffling scheme by Groth is claimed to be secure and efficient. However, its soundness has not been formally proven. An attack against the soundness of this shuffling scheme is presented in this paper. Such an attack compromises the soundness of the mix network based on it. Two new shuffling protocols are designed on the basis of Groth's shuffling and batch verification techniques. The first new protocol is not completely sound, but is formally analyzed in regards to soundness, so it can be applied to build a mix network with formally proven soundness. The second new protocol is completely sound, so is more convenient to apply. Formal analysis in this paper guarantees that both new shuffling protocols can be employed to build mix networks with formally provable soundness. Both protocols prevent the attack against soundness in Groth's scheme. Both new shuffling protocols are very efficient as batch-verification-based efficiency-improving mechanisms have been adopted. The second protocol is even simpler and more elegant than the first one as it is based on a novel batch cryptographic technique.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.369-372
• /
• 2002

An anonymous authentication scheme allows a user to identify himself as a member of a group of users in a secure and anonymous way. It seems to be crucial and indispensable components in English auction, electronic voting and open procurement, which are getting very popular business areas in E-commerce. First, we briefly describe the previous anonymous authentication protocols how to work and what cryptographic techniques adopted to increase performance and achieve anonymity. Second, we compare those protocols from the viewpoint of the communication and computation complexity and the specific cryptographic techniques used in their protocols.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.395-400
• /
• 2002

전자투표 시스템은 유권자들이 온라인상에서 안전하게 투표할 수 있도록 하기 위한 프로토콜이다. 현재까지 대부분의 전자투표 시스템은 몇몇 신뢰할 수 있는 서버로 하여금 투표를 모아서 선거의 결과를 공정하게 계산할 수 있도록 하고 있다. 이러한 전자투표 시스템은 전자 서명[7,8,13,14,19], mix-net[20,21], homorphic encryption schemes[23,24]등을 이용하여 제안되었다. 또한 그룹 멤버가 그룹을 대표하여 서명을 하는 그룹 서명의 개념을 적용[15]할 수 있다. 본 논문에서는 그룹 서명을 전자투표 시스템에 그대로 적용할 수 없기 때문에 변형된 그룹 서명을 제안하고, 그것을 이용하여 전자투표 시스템에 적용하고자 한다. 우리는 Camenisch 와 Michels가 제안한 그룹 서명[1]을 기초로 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.397-399
• /
• 1998

인터넷 사용의 폭발적 증가로 인해 다양하고 인터넷에 제공되는 새로운 서비스들이 계속 증가하고 있다. 본 연구는 새로운 인터넷 서비스인 전자투표시스템에 대한 것으로 분산 미들웨어를 사용하여 H/W나 S/W의 제한 없는 클라이언트/서버 시스템을 목표로 하였다. 본 논문은 대표적인 분산 미들웨어인 CORBA와 DCOM을 사용하여 전자투표시스템D의 프로토타입을 구현하고 그 결과를 비교한다. 이는 앞으로 개발될 실제 전자투표시스템의 개발에 요구되는 분산 미들웨어 선택에 유용한 지침이 될 것이다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.623-628
• /
• 2001

정보화 사회로 대두되는 현대사회는 컴퓨터 확산 및 네트워크의 급속한 발전과 더불어 이를 이용한 많은 응용분야들이 연구되고 있으며, 이중 전자투표에 관한 연구 또한 활발히 진행중이다. 이는 기존의 투표 방식을 전자화할 경우 시간 및 비용 측면에서 많은 절약효과를 얻을 수 있기 때문이다. 그러나 이런 효율성에도 불구하고 전자투표를 실제 적용하는데 있어서 투표 참여 요소의 부정 및 투표권 매매와 투표자 익명성 보장 등 아직 해결해야 할 많은 문제점들이 산재해 있다. 따라서 본 논문에서는 기존 투표를 전자투표로 적용시키는 과정에서 필요한 일반적 요구사항과 부정방지 및 매매방지를 위한 특수 요구사항을 살펴볼 것이다. 특히, 투표자 익명성 보장 및 매매방지를 위해 네트워크 상에서 투표내용이 공개되더라도 사용자 익명성을 보장할 수 있는 Magic Sticker 기법을 적용함과 동시에 사용자 인증 및 메시지 인증 부분에서는 자신을 밝히지 않은 상태에서 수신자를 지정하여 자신의 신분을 증명할 수 있는 수신자 지정 그룹 서명 방식을 이용함으로서 사용자 익명성을 제공하는 안전한 전자 투표 방식을 제안한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.79-85
• /
• 2017

In this paper, several optimizations are proposed to enhance the quality of lane detection algorithms in automotive applications. Considering the diagonal directions of lanes, the proposed limited Hough transform newly introduces image-splitting and angle-limiting schemes that relax the number of possible angles at the line voting process. In addition, unnecessary edges along the horizontal and vertical directions are pre-defined and removed during the edge detection procedures, increasing the detecting accuracy remarkably. Simulation results shows that the proposed lane recognition algorithm achieves an accuracy of more than 90% and a computing speed of 92 frame/sec, which are superior to the results from the previous algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.547-550
• /
• 2007

현재 초중등 학교에서는 오프라인 방식과 온라인 방식으로 투표를 실시하고 있다. 오프라인 투표는 수업 결손이 많아지고 담당자의 업무 부담이 가중되는 문제점이 있다. 상용화된 전자투표시스템은 학생들의 개인 정보가 외부로 유출될 우려가 있고, 투표 시스템 사용 경비를 지출하는 문제점이었다. 따라서 본 논문에서는 초중등학교에서 시행하는 오프라인 방식과 온라인 방식 투표 방식의 문제점을 보완하면서 효율성, 경제성, 접근성, 안전성, 편리성 등을 갖는 전자투표시스템의 설계 내용을 기술한다.