메뉴 건너뛰기




Volumn 34, Issue 4, 2006, Pages 587-589

An efficient (t, n) threshold multi-secret sharing scheme

Author keywords

Multi secret sharing; Secret sharing; Threshold scheme

Indexed keywords

CALCULATIONS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FUNCTIONS; THRESHOLD LOGIC;

EID: 33745758002     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (12)

References (12)
  • 1
    • 0018545449 scopus 로고
    • How to share a secret
    • A Shamir. How to share a secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 2
  • 3
    • 0028498073 scopus 로고
    • Multistage secret sharing based on one-way function
    • J He, E Dawson. Multistage secret sharing based on one-way function[J]. Electronics Letters, 1994, 30(19): 1591-1592.
    • (1994) Electronics Letters , vol.30 , Issue.19 , pp. 1591-1592
    • He, J.1    Dawson, E.2
  • 4
    • 0029197220 scopus 로고
    • Multisecret-sharing scheme based on one-way function
    • J He, E Dawson. Multisecret-sharing scheme based on one-way function[J]. Electronics Letters, 1995, 31(2): 93-95.
    • (1995) Electronics Letters , vol.31 , Issue.2 , pp. 93-95
    • He, J.1    Dawson, E.2
  • 5
    • 84886634682 scopus 로고
    • Comment: Multistage secret sharing based on one-way function
    • L Harn. Comment: multistage secret sharing based on one-way function[J]. Electronics Letters, 1995, 31(4): 262.
    • (1995) Electronics Letters , vol.31 , Issue.4 , pp. 262
    • Harn, L.1
  • 6
    • 0029305471 scopus 로고
    • Efficient sharing (broadcasting) of multiple secrets
    • L Harn. Efficient sharing (broadcasting) of multiple secrets[J]. IEE Proceedings Computers and Digital Techniques, 1995, 142(3): 237-240.
    • (1995) IEE Proceedings Computers and Digital Techniques , vol.142 , Issue.3 , pp. 237-240
    • Harn, L.1
  • 9
    • 0037463529 scopus 로고    scopus 로고
    • Sharing one secret vs. sharing many secrets: Tight Bounds on the average improvement ratio
    • Giovanni Di Crescenzo. Sharing one secret vs. sharing many secrets: Tight Bounds on the average improvement ratio[J]. Theoretical Computer Science, 2003, 295(1-3): 123-140.
    • (2003) Theoretical Computer Science , vol.295 , Issue.1-3 , pp. 123-140
    • Crescenzo, G.D.1
  • 10
    • 84874800178 scopus 로고
    • A public-key cryptosystem and a signature scheme based on discrete logarithms
    • T ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Transactions on Information Theory, 1985, 31(4): 469-472.
    • (1985) IEEE Transactions on Information Theory , vol.31 , Issue.4 , pp. 469-472
    • ElGamal, T.1
  • 11
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public key cryptosystems
    • R L Rivest, A Shamir, L Adleman. A method for obtaining digital signatures and public key cryptosystems[J]. Communication of the ACM, 1978, 21(2): 120-126.
    • (1978) Communication of the ACM , vol.21 , Issue.2 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 12
    • 0032623828 scopus 로고    scopus 로고
    • Cheater identification in (t, n) threshold scheme
    • K J Tan, H W Zhu, S J Gu. Cheater identification in (t, n) threshold scheme[J]. Computer Communications, 1999, 22(8): 762-765.
    • (1999) Computer Communications , vol.22 , Issue.8 , pp. 762-765
    • Tan, K.J.1    Zhu, H.W.2    Gu, S.J.3


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