메뉴 건너뛰기




Volumn 178, Issue 9, 2008, Pages 2262-2274

New efficient and practical verifiable multi-secret sharing schemes

Author keywords

Discrete logarithm; Homogeneous linear recursion; Multi secret sharing; Public value; RSA cryptosystem; Secure channel

Indexed keywords

COMPUTATIONAL COMPLEXITY; SECURITY OF DATA;

EID: 39949083022     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.11.031     Document Type: Article
Times cited : (99)

References (26)
  • 2
    • 84968468488 scopus 로고
    • Solution of Vandermonde systems of equations
    • Björck A., and Pereyra V. Solution of Vandermonde systems of equations. Mathematics of Computation 24 (1970) 893-903
    • (1970) Mathematics of Computation , vol.24 , pp. 893-903
    • Björck, A.1    Pereyra, V.2
  • 5
    • 39949085275 scopus 로고    scopus 로고
    • L. Chen, D. Gollman, C.J. Mitchell, P. Wild, Secret sharing with reusable polynomials, Proceeding of the Second Australisian Conference on Information Security and Privacy-ACISP'97[C], ACISP, Australia, 1997.
    • L. Chen, D. Gollman, C.J. Mitchell, P. Wild, Secret sharing with reusable polynomials, Proceeding of the Second Australisian Conference on Information Security and Privacy-ACISP'97[C], ACISP, Australia, 1997.
  • 6
    • 34547810385 scopus 로고    scopus 로고
    • A multiple-level visual secret-sharing scheme without image size expansion
    • Chen Y.-F., Chan Y.-K., Huang C.-C., Tsai M.-H., and Chu Y.-P. A multiple-level visual secret-sharing scheme without image size expansion. Information Sciences 177 21 (2007) 4696-4710
    • (2007) Information Sciences , vol.177 , Issue.21 , pp. 4696-4710
    • Chen, Y.-F.1    Chan, Y.-K.2    Huang, C.-C.3    Tsai, M.-H.4    Chu, Y.-P.5
  • 8
    • 39949083805 scopus 로고    scopus 로고
    • B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults [A], in: Proc. of 26th IEEE Symposium on Foundations of Computer Science [C], IEEE, Portland, 1985, pp. 251-260.
    • B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults [A], in: Proc. of 26th IEEE Symposium on Foundations of Computer Science [C], IEEE, Portland, 1985, pp. 251-260.
  • 9
    • 37649017555 scopus 로고    scopus 로고
    • An efficient threshold verifiable multi-secret sharing
    • Hadian Dehkordi M., and Mashhadi S. An efficient threshold verifiable multi-secret sharing. Computer Standards & Interfaces 30 3 (2008) 187-190
    • (2008) Computer Standards & Interfaces , vol.30 , Issue.3 , pp. 187-190
    • Hadian Dehkordi, M.1    Mashhadi, S.2
  • 10
    • 0023538330 scopus 로고    scopus 로고
    • P. Feldman, A practical scheme for non-interactive verifiable secret sharing [A], in: Proceedings of 28th IEEE Symposium on Foundations of Computer Science [C], IEEE, Canada, 1987.
    • P. Feldman, A practical scheme for non-interactive verifiable secret sharing [A], in: Proceedings of 28th IEEE Symposium on Foundations of Computer Science [C], IEEE, Canada, 1987.
  • 11
    • 0029305471 scopus 로고
    • Efficient sharing (broadcasting) of multiple secret
    • Harn L. Efficient sharing (broadcasting) of multiple secret. IEEE Proc. Computers and Digital Techniques 142 3 (1995) 237-240
    • (1995) IEEE Proc. Computers and Digital Techniques , vol.142 , Issue.3 , pp. 237-240
    • Harn, L.1
  • 12
    • 0028498073 scopus 로고
    • Multistage secret sharing based on one-way function
    • He J., and Dawson E. Multistage secret sharing based on one-way function. Electronics Letters 30 19 (1994) 1591-1592
    • (1994) Electronics Letters , vol.30 , Issue.19 , pp. 1591-1592
    • He, J.1    Dawson, E.2
  • 13
    • 0029197220 scopus 로고
    • Multisecret-sharing scheme based on one-way function
    • He J., and Dawson E. Multisecret-sharing scheme based on one-way function. Electronics Letters 31 2 (1995) 93-95
    • (1995) Electronics Letters , vol.31 , Issue.2 , pp. 93-95
    • He, J.1    Dawson, E.2
  • 14
    • 33644688053 scopus 로고    scopus 로고
    • A novel efficient (t, n) threshold proxy signature scheme
    • Huang H.F., and Chang C.C. A novel efficient (t, n) threshold proxy signature scheme. Information Sciences 176 10 (2006) 1338-1349
    • (2006) Information Sciences , vol.176 , Issue.10 , pp. 1338-1349
    • Huang, H.F.1    Chang, C.C.2
  • 15
    • 0032163101 scopus 로고    scopus 로고
    • An on-line secret sharing scheme for multi-secrets
    • Hwang R.-J., and Chang C.-C. An on-line secret sharing scheme for multi-secrets. Computer Communications 21 (1998) 1170-1176
    • (1998) Computer Communications , vol.21 , pp. 1170-1176
    • Hwang, R.-J.1    Chang, C.-C.2
  • 16
    • 34347271261 scopus 로고    scopus 로고
    • General secret sharing based on the chinese remainder theorem with applications in e-voting
    • Iftene S. General secret sharing based on the chinese remainder theorem with applications in e-voting. Electronic Notes in Theoretical Computer Science 186 (2007) 67-84
    • (2007) Electronic Notes in Theoretical Computer Science , vol.186 , pp. 67-84
    • Iftene, S.1
  • 17
    • 34447343339 scopus 로고    scopus 로고
    • Threshold cryptography based on AsmuthBloom secret sharing
    • Kaya K., and Selçuk A.A. Threshold cryptography based on AsmuthBloom secret sharing. Information Sciences 177 (2007) 4148-4160
    • (2007) Information Sciences , vol.177 , pp. 4148-4160
    • Kaya, K.1    Selçuk, A.A.2
  • 18
    • 33748802286 scopus 로고    scopus 로고
    • Linear multi-secret sharing schemes based on multi-party computation
    • Liu M., Xiao L., and Zhang Z. Linear multi-secret sharing schemes based on multi-party computation. Finite Fields and Their Applications 12 4 (2006) 704-713
    • (2006) Finite Fields and Their Applications , vol.12 , Issue.4 , pp. 704-713
    • Liu, M.1    Xiao, L.2    Zhang, Z.3
  • 19
    • 0348202233 scopus 로고    scopus 로고
    • An iterative error-free algorithm to solve Vandermonde systems
    • Morháč M. An iterative error-free algorithm to solve Vandermonde systems. Applied Mathematics and Computation 117 (2001) 45-54
    • (2001) Applied Mathematics and Computation , vol.117 , pp. 45-54
    • Morháč, M.1
  • 20
    • 25144472173 scopus 로고    scopus 로고
    • A new (t, n) multi-secret sharing scheme based on Shamir's secret sharing
    • Pang L.-J., and Wang Y.-M. A new (t, n) multi-secret sharing scheme based on Shamir's secret sharing. Applied Mathematics and Computation 167 (2005) 840-848
    • (2005) Applied Mathematics and Computation , vol.167 , pp. 840-848
    • Pang, L.-J.1    Wang, Y.-M.2
  • 21
    • 0018545449 scopus 로고
    • How to share a secret
    • Shamir A. How to share a secret. Communications of ACM 22 11 (1979) 612-613
    • (1979) Communications of ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 22
    • 25644460988 scopus 로고    scopus 로고
    • A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme
    • Shao J., and Cao Z.-F. A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation 168 (2005) 135-140
    • (2005) Applied Mathematics and Computation , vol.168 , pp. 135-140
    • Shao, J.1    Cao, Z.-F.2
  • 24
    • 34047136082 scopus 로고    scopus 로고
    • Multiuser-based shadow watermark extraction system
    • Wang F.-H., Yen K.-K., Jain L.C., and Pan J.-S. Multiuser-based shadow watermark extraction system. Information Sciences 177 12 (2007) 2522-2532
    • (2007) Information Sciences , vol.177 , Issue.12 , pp. 2522-2532
    • Wang, F.-H.1    Yen, K.-K.2    Jain, L.C.3    Pan, J.-S.4
  • 26
    • 33751101633 scopus 로고    scopus 로고
    • A practical verifiable multi-secret sharing scheme
    • Zhao J., Zhang J., and Zhao R. A practical verifiable multi-secret sharing scheme. Computer Standards and Interfaces 29 1 (2007) 138-141
    • (2007) Computer Standards and Interfaces , vol.29 , Issue.1 , pp. 138-141
    • Zhao, J.1    Zhang, J.2    Zhao, R.3


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