메뉴 건너뛰기




Volumn E91-A, Issue 9, 2008, Pages 2365-2378

On a fast (k, n)-threshold secret sharing scheme

Author keywords

Entropy; Exclusive or; Ideal secret sharing scheme; Random number; Secret sharing scheme; Threshold scheme

Indexed keywords

COMPUTER SCIENCE; ELECTRICAL ENGINEERING; ENTROPY;

EID: 77953474706     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.9.2365     Document Type: Article
Times cited : (37)

References (14)
  • 1
    • 0018545449 scopus 로고
    • How to share a secret
    • A. Shamir, "How to share a secret," Commun. ACM, vol.22, no.11, pp.612-613, 1979.
    • (1979) Commun. ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 2
    • 85062838317 scopus 로고
    • Safeguarding cryptographic keys
    • G.R. Blakley, "Safeguarding cryptographic keys," Proc. AFIPS, vol.48, pp. 313-317, 1979.
    • (1979) Proc. AFIPS , vol.48 , pp. 313-317
    • Blakley, G.R.1
  • 5
    • 56649096110 scopus 로고    scopus 로고
    • A fast (3, n)-threshold secret sharing scheme using exclusive-or operations
    • Jan.
    • J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, "A fast (3, n)-threshold secret sharing scheme using exclusive-or operations," IEICE Trans. Fundamentals, vol.E91-A, no.1, pp. 127-138, Jan. 2008.
    • (2008) IEICE Trans. Fundamentals , vol.E91-A , Issue.1 , pp. 127-138
    • Kurihara, J.1    Kiyomoto, S.2    Fukushima, K.3    Tanaka, T.4
  • 6
    • 77951265684 scopus 로고    scopus 로고
    • How to convert 1-out-of-n proof into k-out-of-n proof
    • N. Shiina, T. Okamoto, and E. Okamoto, "How to convert 1-out-of-n proof into k-out-of-n proof," Proc. SCIS2004, pp. 1435-1440, 2004.
    • (2004) Proc. SCIS2004 , pp. 1435-1440
    • Shiina, N.1    Okamoto, T.2    Okamoto, E.3
  • 7
    • 56649120777 scopus 로고    scopus 로고
    • A note on information rate for fast threshold schemes
    • H. Kunii and M. Tada, "A note on information rate for fast threshold schemes," Proc. CSS2006, pp. 101-106, 2006.
    • (2006) Proc. CSS2006 , pp. 101-106
    • Kunii, H.1    Tada, M.2
  • 11
    • 0028323999 scopus 로고
    • Decomposition constructions for secret sharing schemes
    • D.R. Stinson, "Decomposition constructions for secret sharing schemes," IEEE Trans. Inf. Theory, vol.40, no.1, pp.118-125, 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.1 , pp. 118-125
    • Stinson, D.R.1
  • 14
    • 0141913937 scopus 로고
    • On secret sharing systems using (k,L,n) threshold scheme
    • Sept.
    • H. Yamamoto, "On secret sharing systems using (k,L,n) threshold scheme," IEICE Trans. Fundamentals (Japanese Edition), vol.J68-A, no.9, pp.945-952, Sept. 1985.
    • (1985) IEICE Trans. Fundamentals (Japanese Edition) , vol.J68-A , Issue.9 , pp. 945-952
    • Yamamoto, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.