by Ghulam Rasool Chaudhry, Jennifer Seberry
Combinatorics, Complexity and Logic, Proceedings of DMTCS'96, Springer-Verlag Singapore
http://www.cs.uow.edu.au/people/grc01/confer2.ps
Add To MetaCart
Abstract:
Abstract. In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares. 1
Citations
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1001
|
How to share a secret
– Shamir
- 1979
|
|
247
|
Safeguarding cryptographic keys
– Blakley
- 1979
|
|
69
|
An Introduction to Shared Secret and/or Shared Control Schemes and Their Application
– Simmons
- 1992
|
|
54
|
An explication of secret sharing schemes
– Stinson
- 1992
|
|
28
|
Critical sets in Latin squares
– Curran, Rees
- 1978
|
|
18
|
New secret sharing schemes from old
– Martin
- 1993
|
|
15
|
Secret Sharing Schemes Arising From Latin Squares
– Cooper, Donovan, et al.
- 1994
|
|
13
|
Latin squares and critical sets of minimal size
– Cooper, Donovan, et al.
- 1991
|
|
11
|
Discrete Structures in the Theory of Secret Sharing
– Martin
- 1991
|
|
11
|
The existence of Room squares
– Mullin, Wallis
- 1975
|
|
4
|
Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups
– Chaum
- 1979
|
|
4
|
Recent results on combinatorial constructions for threshold schemes
– Chen, Stinson
- 1990
|
|
3
|
Room squares, Contemporary Design Theory: a Collection of Surveys
– Dinitz, Stinson
- 1992
|
|
3
|
Equivalence of Room designs I
– Gross
- 1974
|
|
2
|
Minimal and maximal critical sets in Room squares
– Chaudhry, Seberry
|
|
2
|
Four orthogonal one-factorizations on 10
– Dinitz, Wallis
- 1985
|
|
2
|
Equivalence of Room designs II
– Gross
- 1974
|
|
1
|
Sets of pairwise orthogonal onefactorizations of K10
– Archdeacon, Dinitz, et al.
- 1984
|
|
1
|
Some ideal secret sharing schemes
– Brickel
- 1989
|
|
1
|
Non-isomorphic one-factorizations of K12
– Dinitz, Garnick, et al.
- 1994
|
