The following pages link to Douglas R. Stinson (Q218816):
Displayed 50 items.
- (Q171425) (redirect page) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Unconditionally secure signature schemes revisited (Q269106) (← links)
- An application of ramp schemes to broadcast encryption (Q294638) (← links)
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Extended combinatorial constructions for peer-to-peer user-private information retrieval (Q394836) (← links)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
- On the complexity of the herding attack and some related attacks on hash functions (Q420639) (← links)
- Localised multisecret sharing (Q520075) (← links)
- Room squares with holes of sides 3, 5, and 7 (Q594099) (← links)
- The existence of Howell designs of even side (Q595662) (← links)
- Honeycomb arrays (Q612962) (← links)
- Unconditionally secure chaffing and winnowing with short authentication tags (Q629767) (← links)
- Short one-time signatures (Q644323) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Constructions for retransmission permutation arrays (Q690675) (← links)
- All or nothing at all (Q727180) (← links)
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families (Q738842) (← links)
- Nesting of cycle systems of odd length (Q750445) (← links)
- The equivalence of certain equidistant binary codes and symmetric BIBDS (Q761462) (← links)
- Looking back -- my life as a mathematician and cryptographer (Q778899) (← links)
- The spectrum of Room cubes (Q787986) (← links)
- A short proof of the nonexistence of a pair of orthogonal Latin squares of order six (Q793028) (← links)
- An even side analogue of Room squares (Q797589) (← links)
- Steiner pentagon systems (Q800362) (← links)
- On the number of blocks in a perfect covering of v points (Q810035) (← links)
- Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- Extended results on privacy against coalitions of users in user-private information retrieval protocols (Q892503) (← links)
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (Q897709) (← links)
- Linear approaches to resilient aggregation in sensor networks (Q897713) (← links)
- On combinatorial designs with subdesigns (Q908920) (← links)
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups (Q909643) (← links)
- The combinatorics of authentication and secrecy codes (Q914645) (← links)
- Pairwise balanced designs with odd block sizes exceeding five (Q915735) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Practical unconditionally secure two-channel message authentication (Q970538) (← links)
- Yet another hat game (Q976746) (← links)
- Generalized mix functions and orthogonal equitable rectangles (Q1008954) (← links)
- On orthogonal generalized equitable rectangles (Q1009150) (← links)
- A critical analysis and improvement of advanced access content system drive-host authentication (Q1017539) (← links)
- Finite linear spaces and projective planes (Q1055005) (← links)
- The non-existence of certain finite linear spaces (Q1056378) (← links)
- Two-fold triple systems without repeated blocks (Q1056751) (← links)
- A Kirkman square of order 51 and block size 3 (Q1057276) (← links)
- On sets of three mols with holes (Q1062061) (← links)
- On strong starters in cyclic groups (Q1066268) (← links)
- The spectrum of nested Steiner triple systems (Q1069945) (← links)
- Some NP-complete problems for hypergraph degree sequences (Q1076694) (← links)
- Orthogonal packings in PG(5,2) (Q1084398) (← links)