• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2407-2426
• /
• 2016

A group signature scheme allows any member to sign on behalf of a group. It is applied to practical distributed security communication environments, such as privacy-preserving, data mining. In particular, the excellent features of group signatures, including membership joining and revocation, anonymity, traceability, non-frameability and controllable linkability, make group signature scheme more attractive. Among these features, non-frameability can guarantee that a member's signature cannot be forged by any other (including issuer), and controllable linkability supports to confirm whether or not two group signatures are created by the same signer while preserving anonymity. Until now, only Hwang et al.'s group schemes (proposed in 2013 and 2015) can support all of these features. In this paper, we present a new dynamic group signature scheme which can achieve all of the above excellent features. Compared with their schemes, our scheme has the following advantages. Firstly, our scheme achieves more efficient membership revocation, signing and verifying. The cost of update key in our scheme is two-thirds of them. Secondly, the tracing algorithm is simpler, since the signer can be determined without the judging step. Furthermore, in our scheme, the size of group public key and member's private key are shorter. Lastly, we also prove security features of our scheme, such as anonymity, traceability, non-frameability, under a random oracle model.

• 정보보호학회논문지
• /
• 제19권4호
• /
• pp.105-114
• /
• 2009

충돌회피, 협력운전과 같은 서비스를 차량 애드혹 네트워크(VANET. Vehicular Ad hoc NETwork)에서 제공하기 위해서는 차량 간 교환되는 메시지의 인증이 매우 중요하다. 하지만 일반 전자서명 기법을 사용할 경우에는 프라이버시 침해 문제가 발생할 수 있어, 조건부 익명성을 제공하는 인증시스템이 필요하다. 최근에 Zhang 등은 조작불가능한 하드웨어를 활용하는 VANET를 위한 조건부 익명 인증시스템을 제안하였다. 이 시스템은 차량에서 조건부익명성이 보장되는 신원기반의 공개키 쌍을 생성하여 메시지를 서명하여 교환한다. 또한 많은 메시지를 효과적으로 검증하기 위해 일괄 확인 기법을 사용한다. 이 논문에서는 Zhang 등의 시스템을 다음 측면에서 개선한다. 첫째, 보다 효율적인 확률 서명기법을 사용한다. 둘째, Zhang 등과 달리 안전성이 증명된 일괄확인 기법을 사용한다. 이 밖에 키 철회 문제, 익명 철회 문제 등에 대한 효과적인 해결방안도 제시한다.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.81-89
• /
• 2002

In this paper, we design and implement an efficient fair off-line electronic cash system based on Elliptic Curve Discrete Logarithm Problem (ECDLP), in which the anonymity of coins is revocable by a trustee in case of dispute. To achieve this, we employ the Petersen and Poupard s electronic cash system [1] and extend it by using an elliptic curve over the finite field GF($2^n$). This naturally reduces message size by 85% compared with the original scheme and makes a smart card to store coins easily. Furthermore, we use the Baek et al. s provably secure public key encryption scheme [2] to improve the security of electronic cash system. As an extension, we propose a method to add atomicity into new electronic cash system. To the best of our knowledge, this is the first result to implement a fair off-line electronic cash system based on ECDLP with provable security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.6169-6187
• /
• 2017

With the fast growth of mobile services, Mobile Cloud Computing(MCC) has gained a great deal of attention from researchers in the academic and industrial field. User authentication and privacy are significant issues in MCC environment. Recently, Tsai and Lo proposed a privacy-aware authentication scheme for distributed MCC services, which claimed to support mutual authentication and user anonymity. However, Irshad et.al. pointed out this scheme cannot achieve desired security goals and improved it. Unfortunately, this paper shall show that security features of Irshad et.al.'s scheme are achieved at the price of multiple time-consuming operations, such as three bilinear pairing operations, one map-to-point hash function operation, etc. Besides, it still suffers from two minor design flaws, including incapability of achieving three-factor security and no user revocation and re-registration. To address these issues, an enhanced and provably secure authentication scheme for distributed MCC services will be designed in this work. The proposed scheme can meet all desirable security requirements and is able to resist against various kinds of attacks. Moreover, compared with previously proposed schemes, the proposed scheme provides more security features while achieving lower computation and communication costs.

• 정보보호학회논문지
• /
• 제19권5호
• /
• pp.93-103
• /
• 2009

차량 애드혹 네트워크(VANET, Vehicular Ad hoc NETwork)에서 차량 간 교환되는 메시지가 위 변조되면 심각한 결과를 초래할 수 있어 중요 메시지의 인증은 반드시 필요하지만 이를 위해 일반 전자서명 기법을 사용하면 프라이버시가 침해될 수 있다. 따라서 VANET에서는 프라이버시를 보장하지만 문제를 발생시킨 차량을 식별할 수 있는 조건부 익명성이 제공되어야 한다. 이 논문에서는 각 차량에서 자체적으로 조건부 익명성이 보장되는 익명ID를 재암호화 기법을 이용하져 갱신할 수 있으며, 익명ID에 대한 표현문제를 이용하여 메시지를 서명한 다음 다른 차량에게 전달할 수 있는 VANET를 위한 새로운 인증시스템을 제안한다. 이 시스템은 ID의 사용기간을 제한하여 개별ID의 철회가 불필요하며, 필요할 경우에는 특정 차량의 서비스 참여를 제한시킬 수 있다. 제안된 시스템의 안전성은 일부 조작불가능한 하드웨어를 통해 제공하고 있다.

• 정보보호학회논문지
• /
• 제20권4호
• /
• pp.53-62
• /
• 2010

차량 애드혹 네트워크에서는 차량의 프라이버시를 보장하지만 문제를 일으킨 차량을 식별할 수 있는 조건부 익명성이 제공되어야 한다. 이를 위해 제안된 기존 기법들은 개별 메시지의 익명성을 철회할 수 있는 기능을 제공하고 있다. 만약 차량의 운행 경로를 파악할 수 있다면 사고에서 책임소재 규명과 범죄 수사에 유용하게 사용될 수 있다. 기존 메시지 철회 기능을 이용하여 차량의 운행 경로를 파악할 수 있지만 대상 차량뿐만 아니라 다른 차량의 익명성도 철회가 되는 문제점이 있다. 본 논문은 대상 차량을 제외한 다른 차량의 프라이버시를 침해하지 않으면서 차량의 운행 경로를 파악할 수 있는 효율적인 기법을 제안한다. 제안한 방법은 기존에 사용되는 메시지 인증 기법과 독립적으로 추가하여 사용할 수 있으며, 신뢰기관의 권한 상용을 방지하기 위한 메커니즘을 포함하고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6121-6144
• /
• 2019

Numerous privacy-preserving authentication schemes have been proposed but vehicular ad hoc networks (VANETs) still suffer from security and privacy issues as well as computation and communication overheads. In this paper, we proposed a robust conditional privacy-preserving authentication scheme based on pseudonym root with cuckoo filter to meet security and privacy requirements and reduce computation and communication overheads. In our proposed scheme, we used a new idea to generate pseudonyms for vehicles where each on-board unit (OBU) saves one pseudonym, named as "pseudonym root," and generates all pseudonyms from the same pseudonym. Therefore, OBU does not need to enlarge its storage. In addition, the scheme does not use bilinear pairing operation that causes computation overhead and has no certification revocation list that leads to computation and communication overheads. The proposed scheme has lightweight mutual authentication among all parties and just for once. Moreover, it provides strong anonymity to preserve privacy and resists ordinary attacks. We analyzed our proposed scheme and showed that it meets security and privacy requirements of VANETs and is more efficient than traditional schemes. The communication and computation overheads were also discussed to show the cost-effectiveness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3365-3383
• /
• 2021

The rapid growth of data has successfully promoted the development of modern information and communication technologies, which are used to process data generated by public urban departments and citizens in modern cities. In specific application areas where the ciphertext of messages generated by different users' needs to be transmitted, the concept of broadcast encryption is important. It can not only improve the transmission efficiency but also reduce the cost. However, the existing schemes cannot entirely ensure the privacy of receivers and dynamically adjust the user authorization. To mitigate these deficiencies, we propose an efficient, secure identity-based broadcast encryption scheme that achieves direct revocation and receiver anonymity, along with the analysis of smart grid solutions. Moreover, we constructed a security model to ensure wireless data transmission under cloud computing and internet of things integrated devices. The achieved results reveal that the proposed scheme is semantically secure in the random oracle model. The performance of the proposed scheme is evaluated through theoretical analysis and numerical experiments.