• Title/Summary/Keyword: 능동적인 비밀 분산

Search Result 3, Processing Time 0.017 seconds

Share Renewal Scheme in Proactive Secret Sharing for Threshold Cryptosystem (임계 암호시스템 구현을 위한 능동적 비밀 분산에서의 공유 갱신 방법)

  • 이윤호;김희열;정병천;이재원;윤현수
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.239-249
    • /
    • 2003
  • The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs $O(n^2)$ modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less than img ${\frac{1}{2}}$ n-1 adversaries exist and they are static adversary.

Computer Science Division, EECS Dept. , KAIST (효율적인 임계 암호시스템 구현을 위한 능동적 비밀 분산에서의 빠른 공유 갱신에 관한 연구)

  • 이윤호;김희열;이제원;정병천;윤현수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.769-771
    • /
    • 2002
  • 임계 암호시스템은 현대 암호학에서 중요한 한 축을 이루는 암호학의 한 분야이다. 본 논문에서는 임계 암호시스템의 근간이 되는 비밀 분산(Secret Sharing)의 한 분야인 (k, n) threshold scheme에서 능동적 비밀 분산 (Proactive Secret Sharing)을 위한 공유(Share)갱신 방법을 개선한 새로운 공유 갱신 방법을 제안한다. 이전 방법은 각 참여자당 O(n$^2$)의 모듈라 멱승 연산을 수행하는데 비하여 제안 방법은 O(n)의 모듈라 멱승 연산만으로 공유갱신이 가능하다. 이와 함께 본 논문에서는 k <(1/2)n-1인 경우에 대하여 제안 방법의 안전함을 증명한다.

  • PDF

Fair Private Block Encryption Protocol with Proactive Secret Sharing for Delegated Node of Public Blockchain (동등한 권한을 가진 대표노드를 위한 능동적 비밀 분산을 이용한 비공개 블록 암호화 기법)

  • Jung, Seung Wook
    • Convergence Security Journal
    • /
    • v.20 no.4
    • /
    • pp.177-186
    • /
    • 2020
  • In current public blockchain, any node can see every blocks, so that public blockchain provider transparent property. However, some application requires the confidential information to be stored in the block. Therefore, this paper proposes a multi-layer blockchain that have the public block layer and the private block for confidential information. This paper suggests the requirement for encryption of private block. Also, this paper shows the t-of-n threshold cryptosystem without dealer who is trusted third party. Moreover, the delegated node who has key information can be withdraw the delegated node group or a new delegated node can join in the delegated node group. Therefore, the paper proposes an efficient key information resharing scheme for withdraw and join. Finally proposed scheme satisfies the requirements for encryption and fairness.