RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재

      Channel-based Encryption for Identity-based Traceability for a Decentralized Network

      한글로보기

      https://www.riss.kr/link?id=A108573533

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      In this paper, we propose channel based encryption with identity-based traceability for decentralized networks such as fog/edge networks. In a decentralized network, controlling access to data is difficult as the data are transmitted via multiple othe...

      In this paper, we propose channel based encryption with identity-based traceability for decentralized networks such as fog/edge networks. In a decentralized network, controlling access to data is difficult as the data are transmitted via multiple other nodes. Particularly, when data is transmitted using a protocol that has multiple legitimate recipients like a publish/subscribe protocol, tracing who has accessed broadcast data is difficult. To resolve this problem, we present a new encryption scheme that enables us to trace the data flow by confirming the identity of the actual recipient. We construct a channel-based encryption scheme tracing the data flow, which is suitable for a publish/subscribe protocol, based on revocable attribute-based encryption (ABE). We, then, set the edge server to preprocess the ciphertext by re-encrypting and partially decrypting the ciphertext for the actual recipient. Prior to our work, revocable attribute-based broadcast encryption (ABE) was used only to revoke users by re-encryption. However, this method only allows us to trace recipients after the ciphertext is re-encrypted. That means that the data before reaching the re-encryption oracle, that is the edge server in our proposed system, can be accessed by other recipients without leaving any trace and this makes tracing the data flow difficult. In our proposed scheme, the ciphertext cannot be decrypted only after it is partially decrypted by the edge server. Therefore, tracing the data flow is possible via the edge server. We provide proof of security using the Decisional Diffie-Hellman assumption in the paper.

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼