Yuliang Zheng, Thomas Hardjono, Jennifer Seberry  Home/Search
Context Related
| uncc.edu/~yzheng/paper...jcomp373.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uncc.edu/~yzheng/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A (t; w) threshold scheme is a method for sharing a secret among w shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. This paper is concerned with the re-use of shares possessed by shareholders in threshold schemes. We propose a simple (t; w) threshold scheme based on the use of cryptographically strong pseudo-random functions and universal hash functions. A remarkable advantage of the scheme is that a shareholder can... (Update)
Similar documents based on text: More All
0.8: Reusing Shares in Secret Sharing Schemes - Zheng, Hardjono, Seberry (1994) (Correct)
0.6: New Solutions to the Problem of Access Control in a Hierarchy - Zheng, Hardjono, al. (1993) (Correct)
0.5: Nonlinearity and Propagation Characteristics of Balanced.. - Seberry, Zhang, Zheng (1995) (Correct)
Related documents from co-citation: More All
4: How to Share a Secret (context) - Shamir - 1979
3: Using encryption for authentication in large networks of computers (context) - Needham, Schroeder - 1978
3: New directions in cryptography - Diffie, Hellman - 1976
BibTeX entry: (Update)
Y. Zheng, T. Hardjono, and J. Seberry, "Reusing shares in secret sharing schemes," The Computer Journal, vol. 17, pp. 199--205, March 1994. http://citeseer.ist.psu.edu/article/zheng94reusing.html More
@article{ zheng94reusing,
author = "Yuliang Zheng and T. Hardjono and J. Seberry",
title = "Reusing Shares in Secret Sharing Schemes",
journal = "The Computer Journal",
volume = "37",
number = "3",
month = "????",
pages = "199--205",
year = "1994",
url = "citeseer.ist.psu.edu/article/zheng94reusing.html" }
Citations (may not include all citations):645 How to share a secret (context) - Shamir - 1979
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
241 Communication theory of secrecy systems (context) - Shannon - 1949
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
174 Safeguarding cryptographic keys (context) - Blakley - 1979
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
99 One-way functions are necessary and sufficient for secure si.. (context) - Rompel - 1990
93 Generalized secret sharing and monotone functions (context) - Benaloh, Leichter - 1990
91 Secret sharing scheme realizing general access structure (context) - Ito, Saito et al. - 1987
44 Data encryption standard (context) - PUB - 1977
9 Pseudo-random generation under uniform assumptions (context) - Hastad - 1990
2 Robust shared secret schemes (context) - Simmons - 1989
Documents on the same site (http://www.sis.uncc.edu/~yzheng/papers/): More
Structures of Cryptographic Functions with Strong.. - Seberry, Zhang, Zheng (1994) (Correct)
Sibling Intractable Function Families and Their.. - Zheng, Hardjono.. (1992) (Correct)
Signcryption and Its Applications in Efficient Public Key Solutions - Zheng (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC