• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.380-399
• /
• 2010

In this paper, we present a new class of attacks against an anonymous communication protocol, originally presented in ACNS 2008. The protocol itself was proposed as an improved version of ModOnions, which exploits universal re-encryption in order to avoid replay attacks. However, ModOnions allowed the detour attack, introduced by Danezis to re-route ModOnions to attackers in such a way that the entire path is revealed. The ACNS 2008 proposal addressed this by using a more complicated key management scheme. The revised protocol is immune to detour attacks. We show, however, that the ModOnion construction is highly malleable and this property can be exploited in order to redirect ModOnions. Our attacks require detailed probing and are less efficient than the detour attack, but they can nevertheless recover the full onion path while avoiding detection and investigation. Motivated by this, we present modifications to the ModOnion protocol that dramatically reduce the malleability of the encryption primitive. It addresses the class of attacks we present and it makes other attacks difficult to formulate.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.247-250
• /
• 2005

Recently, a concept of bid-rigging is issued in electronic auction. To prevent this attack, Abe-Suzuki proposed firstly receipt-free scheme based on bidding-booth. Chen-Lee-Kim pointed out that Abe-Suzuki's scheme only provides receipt-freeness for losing bidders. Also, they introduced a new receipt-free sealed bid auction scheme using the homomorphic encryption technique. The main participants of their scheme are Auctioneer, Auction Issuer, Bidder and Seller. Bid-rigging can happen by a seller in their scheme. We propose receipt-free sealed-bid auction scheme using a universal re-encryption mixnet. For our receipt-free sealed-bid auction, we use Pseudo ID of a bidder and universal re-encryption technique of Golle et al. Also, our scheme satisfies privacy, correctness, public verifiability, non-reputation, and receipt-freeness.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.607-614
• /
• 2009

Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP.

• 정보보호학회논문지
• /
• 제19권1호
• /
• pp.33-42
• /
• 2009

익명성을 지원하는 시스템을 위하여 현재, 익명 신용장 시스템이 많이 연구되고 있다. 그러나 이러한 시스템은 높은 보안 수준을 가질 뿐, 정교한 접근 제어, 필요에 따른 추적 기능 등 실제 응용 환경에서 필요로 하는 특징을 충족시키지 못하는 경우가 대부분이다. 이러한 시스템에 대한 새로운 도전으로써, 복수의 참여자가 가명과 실명에 대한 연결 정보를 분리하여 저장하는 몇몇 연구가 진행되었다. 이 논문에서는 그 중 Oblivious Transfer를 이용한 가명 획득 프로토콜에 기반을 두고, 가명 고갈의 문제를 해결하고, 재암호화(Re-Encyption), 일방향 함수 등을 사용하여 외부에서의 가명의 연결 불가능성과 같은 다른 여러 요구조건을 충족하는 프로토콜을 제안하고 있다.