SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 403 LNCS, Issue , 1990, Pages 27-35

Generalized secret sharing and monotone functions

(2) Benaloh, Josh a Leichter, Jerry b

a UNIVERSITY OF TORONTO (Canada)

b YALE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERAL METHOD; MONOTONE FUNCTIONS; SECRET SHARING; SECRET SHARING SCHEMES; THRESHOLD SCHEMES;

CRYPTOGRAPHY;

EID: 85027202957 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/0-387-34799-2_3 Document Type: Conference Paper

Times cited : (413)

References (8)

1
- 85031817357
- A Modular Approach to Key Safeguarding.
- College Station, TX
- Asmuth, C. and Bloom, J. “A Modular Approach to Key Safeguarding.” Texas A&M University, Department of Mathematics, College Station, TX (1980).
- (1980) Texas A&M University, Department of Mathematics
- Asmuth, C.¹ Bloom, J.²

2
- 85034837254
- Secret Sharing Homomorpbism: Keeping Shares of a Secret Secret
- Santa Barbara, CA, Aug, Published as Advances in Cryptology, ed. by A. Odlyzko in Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York
- Benaloh, J. “Secret Sharing Homomorpbism: Keeping Shares of a Secret Secret” Proc. Crypto '86, Santa Barbara, CA (Aug. 1986), 251-260. Published as Advances in Cryptology, ed. by A. Odlyzko in Lecture Notes in Computer Science, vol. 263, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1987).
- (1986) Proc. Crypto '86 , vol.263 , pp. 251-260
- Benaloh, J.¹

3
- 0003945449
- Ph.D. Thesis presented at Yale University, Sep
- Benaloh, J. “Verifiable Secret-Ballot Elections.” Ph.D. Thesis presented at Yale University (Sep. 1987).
- (1987) Verifiable Secret-Ballot Elections.
- Benaloh, J.¹

4
- 85062838317
- Safeguarding Cryptographic Keys.
- New York, NY, June
- Blakley, G. “Safeguarding Cryptographic Keys.” Proc. AFIPS 1979 National Computer Conference, New York, NY (June 1979), 313-317.
- (1979) Proc. AFIPS 1979 National Computer Conference , pp. 313-317
- Blakley, G.¹

5
- 0023538330
- A Practical Scheme for Non-interactive Verifiable Secret Sharing.
- Los Angeles, CA, Oct
- Feldman, P. “A Practical Scheme for Non-interactive Verifiable Secret Sharing.” Proc. 28th IEEE Symp. on Foundations of Computer Science, Los Angeles, CA (Oct. 1987), 427-437.
- (1987) Proc. 28th IEEE Symp. on Foundations of Computer Science , pp. 427-437
- Feldman, P.¹

6
- 85028778267
- Secret Sharing Scheme Realizing General Access Structure
- Ito, M., Saito, A., and Nishizeki, T. “Secret Sharing Scheme Realizing General Access Structure.” Proc. Glob. Com, (1987).
- (1987) Proc. Glob. Com
- Ito, M.¹ Saito, A.² Nishizeki³

7
- 85023433586
- Generalized Linear Threshold Scheme.
- Santa Barbara, CA, Aug, Published as Advances in Cryptology, ed. by G. Blakley and D. Chaum in Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York
- Kothari, S. “Generalized Linear Threshold Scheme.” Proc. Crypto '84, Santa Barbara, CA (Aug. 1984), 231-241. Published as Advances in Cryptology, ed. by G. Blakley and D. Chaum in Lecture Notes in Computer Science, vol. 196, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1985).
- (1984) Proc. Crypto '84 , vol.196 , pp. 231-241
- Kothari, S.¹

8
- 0018545449
- How to Share a Secret.
- Nov
- Shamir, A. “How to Share a Secret.” Comm. ACM 22, 11 (Nov. 1979), 612-613.
- (1979) Comm. ACM , vol.22 , Issue.11 , pp. 612-613
- Shamir, A.¹

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