메뉴 건너뛰기




Volumn 2, Issue 4, 1992, Pages 357-390

An explication of secret sharing schemes

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000708528     PISSN: 09251022     EISSN: 15737586     Source Type: Journal    
DOI: 10.1007/BF00125203     Document Type: Article
Times cited : (312)

References (28)
  • 1
    • 84935950171 scopus 로고    scopus 로고
    • M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, Proc. 20th ACM Symp. on Theory of Computing, (1988), pp. 1–10.
  • 4
    • 84935949373 scopus 로고    scopus 로고
    • B. Blakley, G.R. Blakley, A.H. Chan, and J.L. Massey, Threshold schemes with disenrollment, presented at CRYPTO '92.
  • 6
    • 84935979604 scopus 로고    scopus 로고
    • C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decomposition and secret sharing schemes. Presented at EUROCRYPT '92, submitted to Journal of Cryptology.
  • 9
    • 85030321619 scopus 로고
    • Some improved bounds on the information rate of perfect secret sharing schemes
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, to appear in
    • (1991) J. Cryptology , pp. 242-252
    • Brickell, E.F.1    Stinson, D.R.2
  • 13
    • 84935939062 scopus 로고    scopus 로고
    • M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Globecom '87, (1987), pp. 99–102.
  • 14
    • 84935927167 scopus 로고    scopus 로고
    • W.-A. Jackson and K.M. Martin, On ideal secret sharing schemes. Submitted to J. Cryptology.
  • 16
    • 84935952354 scopus 로고    scopus 로고
    • K.M. Martin, New secret sharing schemes from old. Submitted to J. Comb. Math. Comb. Comp.
  • 17
    • 84935940662 scopus 로고    scopus 로고
    • K.M. Martin, Discrete Structures in the Theory of Secret Sharing. Ph.D. thesis, University of London, 1991.
  • 19
    • 84935958033 scopus 로고    scopus 로고
    • T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st ACM Symp. on Theory of Computing, (1989), pp. 73–85.
  • 20
    • 84935967475 scopus 로고    scopus 로고
    • P.D. Seymour, On secret-sharing matroids. To appear in Journal of Combin. Theory B.
  • 22
    • 0005180192 scopus 로고
    • Robust shared secret schemes or ‘how to be sure you have the right answer even though you don't known the question
    • (1989) Congressus Numer. , vol.68 , pp. 215-248
    • Simmons, G.J.1
  • 27
    • 84935956074 scopus 로고    scopus 로고
    • D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes. Presented at CRYPTO '92.


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