The following pages link to D. R. Stinson (Q218816):
Displaying 50 items.
- Mols with holes (Q1837186) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Quorum systems constructed from combinatorial designs (Q1854450) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- The Lovász local lemma and its applications to some combinatorial arrays (Q1877346) (← links)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (Q1895965) (← links)
- Combinatorial characterizations of authentication codes. II (Q1910435) (← links)
- Nonincident points and blocks in designs (Q1937556) (← links)
- On dealer-free dynamic threshold schemes (Q1948449) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes (Q2033514) (← links)
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties (Q2114780) (← links)
- On security properties of all-or-nothing transforms (Q2243897) (← links)
- Is extracting data the same as possessing data? (Q2247969) (← links)
- Combinatorial solutions providing improved security for the generalized Russian cards problem (Q2248647) (← links)
- On the spectrum of resolvable orthogonal arrays invariant under the Klein group \(K_ 4\) (Q2266718) (← links)
- Combinatorial batch codes (Q2268236) (← links)
- A network reliability approach to the analysis of combinatorial repairable threshold schemes (Q2274238) (← links)
- Block-avoiding point sequencings of directed triple systems (Q2297726) (← links)
- Block-avoiding point sequencings of Mendelsohn triple systems (Q2305913) (← links)
- Constructions of optimal orthogonal arrays with repeated rows (Q2312788) (← links)
- Attack on a concast signature scheme (Q2390279) (← links)
- A survey and refinement of repairable threshold schemes (Q2413291) (← links)
- On message recognition protocols: recoverability and explicit confirmation (Q2430141) (← links)
- A unified approach to combinatorial key predistribution schemes for sensor networks (Q2448085) (← links)
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs (Q2449136) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Properties and constraints of cheating-immune secret sharing schemes (Q2489917) (← links)
- Some observations on the theory of cryptographic hash functions (Q2491271) (← links)
- A new characterization of semi-bent and bent functions on finite fields (Q2491272) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Visual cryptography for general access structures (Q2506485) (← links)
- Anonymity in shared symmetric key primitives (Q2638423) (← links)
- Small embeddings for partial cycle systems of odd length (Q2639071) (← links)
- On unconditionally secure distributed oblivious transfer (Q2642256) (← links)
- On partial parallel classes in partial Steiner triple systems (Q2659191) (← links)
- A new practical algorithm for the construction of a perfect hash function (Q2708246) (← links)
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem (Q2759107) (← links)
- (Q2762750) (← links)
- Cryptography. Theory and practice (Q2770462) (← links)
- A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage (Q2861348) (← links)
- Packing Costas arrays (Q2895355) (← links)
- Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes (Q2949524) (← links)
- (Q2960961) (← links)
- Unconditionally Secure Signature Schemes Revisited (Q3002106) (← links)
- (Q3023656) (← links)
- A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares (Q3029017) (← links)
- On Nonisomorphic Room Squares (Q3037455) (← links)
- (Q3089173) (← links)
- (Q3136988) (← links)
