메뉴 건너뛰기




Volumn 8, Issue 1, 1995, Pages 39-64

Graph decompositions and secret sharing schemes

Author keywords

Graph access structure; Linear programming; Secret sharing scheme

Indexed keywords

GRAPH THEORY; INFORMATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

EID: 0029631974     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/BF00204801     Document Type: Article
Times cited : (109)

References (41)
  • 1
    • 84950364502 scopus 로고
    • Universally ideal secret sharing schemes
    • Lecture Notes in Computer Science, Vol. 740, Springer-Verlag, Berlin
    • (1993) Proc. Crypto '92 , pp. 185-197
    • Beimel, A.1    Chor, B.2
  • 6
    • 85025847350 scopus 로고    scopus 로고
    • C. Blundo. Secret Sharing Schemes for Access Structures Based on Graphs. Tesi di Laurea, University of Salerno, 1991 (in Italian).
  • 12
    • 84950364505 scopus 로고    scopus 로고
    • E. F. Brickell and D. R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. Department of Computer Science and Engineering Report Series # 106, University of Nebraska, May 1990.
  • 19
    • 84950364506 scopus 로고    scopus 로고
    • O. Goldreich, S. Micall, and A. Wigderson. How to play any mental game. Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 218–229.
  • 20
    • 84921169347 scopus 로고
    • A protocol to set up shared secret schemes without the assistance of a mutually trusted party
    • Lecture Notes in Computer Science, Vol. 473, Springer-Verlag, Berlin
    • (1991) Proc. Eurocrypt '90 , pp. 266-282
    • Ingemarsson, I.1    Simmons, G.J.2
  • 21
    • 84950364507 scopus 로고    scopus 로고
    • M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. Proc. IEEE Globecom '87, 1987, pp. 99–102.
  • 23
    • 84950364508 scopus 로고    scopus 로고
    • W.-A. Jackson and K. M. Martin. On ideal secret sharing schemes. Preprint.
  • 26
    • 85025849513 scopus 로고    scopus 로고
    • K. M. Martin. Discrete Structures in the Theory of Secret Sharing. Ph.D. thesis, University of London, 1991.
  • 29
    • 84950364510 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.
  • 32
    • 0005180192 scopus 로고
    • Robust shared secret schemes or “how to be sure you have the right answer even though you don't know the question.”
    • (1989) Congr. Numer. , vol.68 , pp. 215-248
    • Simmons, G.J.1
  • 33
    • 84898132112 scopus 로고
    • How to (really) share a secret
    • Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, Berlin
    • (1990) Proc. Crypto '88 , pp. 390-448
    • Simmons, G.J.1
  • 34
    • 84898275803 scopus 로고
    • Prepositioned shared secret and/or shared control schemes
    • Lecture Notes in Computer Science, Vol. 434, Springer-Verlag, Berlin
    • (1990) Proc. Eurocrypt '89 , pp. 436-467
    • Simmons, G.J.1
  • 35
    • 85030321871 scopus 로고
    • Shared secret and/or shared control schemes
    • Lecture Notes in Computer Science, Vol. 537, Springer-Verlag, Berlin
    • (1991) Proc. Crypto '90 , pp. 216-241
    • Simmons, G.J.1
  • 39
    • 0039947820 scopus 로고
    • New general lower bounds on the information rate of secret sharing schemes
    • Lectures Notes in Computer Science, Vol. 740, Springer-Verlag, Berlin
    • (1993) Proc. Crypto '92 , pp. 170-184
    • Stinson, D.R.1


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