Douglas R. Stinson

According to our database1, Douglas R. Stinson authored at least 253 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets.
IEEE Trans. Information Theory, 2018

Multi-prover proof of retrievability.
J. Mathematical Cryptology, 2018

A survey and refinement of repairable threshold schemes.
J. Mathematical Cryptology, 2018

A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later.
IACR Cryptology ePrint Archive, 2018

Ideal ramp schemes and related combinatorial objects.
Discrete Mathematics, 2018

Combinatorial repairability for threshold schemes.
Des. Codes Cryptography, 2018

2017
Optimal Ramp Schemes and Related Combinatorial Objects.
IACR Cryptology ePrint Archive, 2017

A Survey and Refinement of Repairable Threshold Schemes.
IACR Cryptology ePrint Archive, 2017

Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets.
IACR Cryptology ePrint Archive, 2017

Localised multisecret sharing.
Cryptography and Communications, 2017

A tight bound on the size of certain separating hash families.
Australasian J. Combinatorics, 2017

Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices.
Australasian J. Combinatorics, 2017

2016
Combinatorial Repairability for Threshold Schemes.
IACR Cryptology ePrint Archive, 2016

Multi-prover Proof-of-Retrievability.
IACR Cryptology ePrint Archive, 2016

Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families.
Discrete Mathematics, 2016

All or Nothing at All.
Electr. J. Comb., 2016

On encoding symbol degrees of array BP-XOR codes.
Cryptography and Communications, 2016

2015
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs.
J. Mathematical Cryptology, 2015

Linear approaches to resilient aggregation in sensor networks.
J. Mathematical Cryptology, 2015

Sequential Secret Sharing as a New Hierarchical Access Structure.
J. Internet Serv. Inf. Secur., 2015

Sequential Secret Sharing as a New Hierarchical Access Structure.
IACR Cryptology ePrint Archive, 2015

Localised Multisecret Sharing.
IACR Cryptology ePrint Archive, 2015

All or Nothing at All.
IACR Cryptology ePrint Archive, 2015

On tight bounds for binary frameproof codes.
Des. Codes Cryptography, 2015

Guest Editorial: Special Issue in Honor of Scott A. Vanstone.
Des. Codes Cryptography, 2015

Extended results on privacy against coalitions of users in user-private information retrieval protocols.
Cryptography and Communications, 2015

2014
Broadcast-Enhanced Key Predistribution Schemes.
TOSN, 2014

Is extracting data the same as possessing data?
J. Mathematical Cryptology, 2014

Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs.
IACR Cryptology ePrint Archive, 2014

Resilient Aggregation in Simple Linear Sensor Networks.
IACR Cryptology ePrint Archive, 2014

A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs.
Discrete Mathematics, 2014

Combinatorial solutions providing improved security for the generalized Russian cards problem.
Des. Codes Cryptography, 2014

A unified approach to combinatorial key predistribution schemes for sensor networks.
Des. Codes Cryptography, 2014

Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs.
Electr. J. Comb., 2014

Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing.
Proceedings of the Information Security Practice and Experience, 2014

2013
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage.
J. Mathematical Cryptology, 2013

Is extracting data the same as possessing data?
IACR Cryptology ePrint Archive, 2013

Nonincident points and blocks in designs.
Discrete Mathematics, 2013

A simple combinatorial treatment of constructions and threshold gaps of ramp schemes.
Cryptography and Communications, 2013

On dealer-free dynamic threshold schemes.
Adv. in Math. of Comm., 2013

Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes.
Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

2012
Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem.
IACR Cryptology ePrint Archive, 2012

A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage.
IACR Cryptology ePrint Archive, 2012

A Simplified Combinatorial Treatment of Constructions and Threshold Gaps of Ramp Schemes.
IACR Cryptology ePrint Archive, 2012

Broadcast-enhanced Key Predistribution Schemes.
IACR Cryptology ePrint Archive, 2012

Constructions for retransmission permutation arrays.
Des. Codes Cryptography, 2012

On the complexity of the herding attack and some related attacks on hash functions.
Des. Codes Cryptography, 2012

Extended combinatorial constructions for peer-to-peer user-private information retrieval.
Adv. in Math. of Comm., 2012

Social secret sharing in cloud computing using a new trust function.
Proceedings of the Tenth Annual International Conference on Privacy, Security and Trust, 2012

Socio-Rational Secret Sharing as a New Direction in Rational Cryptography.
Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

2011
Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes.
Wireless Personal Communications, 2011

Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission.
IEEE Trans. Dependable Sec. Comput., 2011

Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval.
IACR Cryptology ePrint Archive, 2011

Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski.
IACR Cryptology ePrint Archive, 2011

A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks.
IACR Cryptology ePrint Archive, 2011

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures.
Cryptography and Communications, 2011

Short one-time signatures.
Adv. in Math. of Comm., 2011

Unconditionally Secure Signature Schemes Revisited.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2010
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes.
TOSN, 2010

On message recognition protocols: recoverability and explicit confirmation.
IJACT, 2010

Unconditionally secure social secret sharing scheme.
IET Information Security, 2010

Short One-Time Signatures.
IACR Cryptology ePrint Archive, 2010

On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions.
IACR Cryptology ePrint Archive, 2010

Anonymity in shared symmetric key primitives.
Des. Codes Cryptography, 2010

Practical unconditionally secure two-channel message authentication.
Des. Codes Cryptography, 2010

Yet Another Hat Game.
Electr. J. Comb., 2010

Honeycomb Arrays.
Electr. J. Comb., 2010

Brief announcement: secret sharing based on the social behaviors of players.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme.
Proceedings of the Information and Communications Security - 12th International Conference, 2010

2009
The effectiveness of receipt-based attacks on ThreeBallot.
IEEE Trans. Information Forensics and Security, 2009

An efficient identification protocol secure against concurrent-reset attacks.
J. Mathematical Cryptology, 2009

Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions.
Int. J. Inf. Sec., 2009

A critical analysis and improvement of advanced access content system drive-host authentication.
IJACT, 2009

Anonymity in Shared Symmetric Key Primitives.
IACR Cryptology ePrint Archive, 2009

Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission.
IACR Cryptology ePrint Archive, 2009

Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures.
IACR Cryptology ePrint Archive, 2009

On orthogonal generalized equitable rectangles.
Des. Codes Cryptography, 2009

Combinatorial batch codes.
Adv. in Math. of Comm., 2009

Group Testing and Batch Verification.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks.
Proceedings of the Applied Cryptography and Network Security, 7th International Conference, 2009

A Highly Scalable RFID Authentication Protocol.
Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families.
IEEE Trans. Information Theory, 2008

On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs.
ACM Trans. Inf. Syst. Secur., 2008

Combinatorial designs: constructions and analysis.
SIGACT News, 2008

Two attacks on a sensor network key distribution scheme of Cheng and Agrawal.
J. Mathematical Cryptology, 2008

On generalized separating hash families.
J. Comb. Theory, Ser. A, 2008

A bound on the size of separating hash families.
J. Comb. Theory, Ser. A, 2008

How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG.
IACR Cryptology ePrint Archive, 2008

On The Security of The ElGamal Encryption Scheme and Damgard's Variant.
IACR Cryptology ePrint Archive, 2008

Combinatorial batch codes.
IACR Cryptology ePrint Archive, 2008

Two attacks on a sensor network key distribution scheme of Cheng and Agrawal.
IACR Cryptology ePrint Archive, 2008

Recognition in Ad Hoc Pervasive Networks.
IACR Cryptology ePrint Archive, 2008

Key Predistribution for Homogeneous Wireless Sensor Networks with Group Deployment of Nodes.
IACR Cryptology ePrint Archive, 2008

Minimum node degree and kappa-connectivity for key predistribution schemes and distributed sensor networks.
Proceedings of the First ACM Conference on Wireless Network Security, 2008

Authorship Proof for Textual Document.
Proceedings of the Information Hiding, 10th International Workshop, 2008

Key Refreshing in Wireless Sensor Networks.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

A New Message Recognition Protocol for Ad Hoc Pervasive Networks.
Proceedings of the Cryptology and Network Security, 7th International Conference, 2008

A Critical Analysis and Improvement of AACS Drive-Host Authentication.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007
Multicollision Attacks on Some Generalized Sequential Hash Functions.
IEEE Trans. Information Theory, 2007

A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks.
IEEE Trans. Computers, 2007

On Unconditionally Secure Distributed Oblivious Transfer.
J. Cryptology, 2007

An efficient and secure two-flow zero-knowledge identification protocol.
J. Mathematical Cryptology, 2007

Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols.
J. Mathematical Cryptology, 2007

Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions.
IET Information Security, 2007

An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption.
IACR Cryptology ePrint Archive, 2007

A Zero-Knowledge Identification and Key Agreement Protocol.
IACR Cryptology ePrint Archive, 2007

Generalized mix functions and orthogonal equitable rectangles.
IACR Cryptology ePrint Archive, 2007

Interactive two-channel message authentication based on interactive-collision Resistant hash functions.
IACR Cryptology ePrint Archive, 2007

The Effectiveness of Receipt-Based Attacks on ThreeBallot.
IACR Cryptology ePrint Archive, 2007

A Bound on the Size of Separating Hash Families.
IACR Cryptology ePrint Archive, 2007

Constructions and bounds for (m, t)-splitting systems.
Discrete Mathematics, 2007

Generalized mix functions and orthogonal equitable rectangles.
Des. Codes Cryptography, 2007

Unconditionally secure chaffing and winnowing with short authentication tags.
Adv. in Math. of Comm., 2007

Perfect hash families from transversal designs.
Australasian J. Combinatorics, 2007

2006
Optimum Secret Sharing Scheme Secure against Cheating.
SIAM J. Discrete Math., 2006

Fault-tolerant routings with minimum optical index.
Networks, 2006

Minimality and other properties of the width-w nonadjacent form.
Math. Comput., 2006

An Efficient and Secure Two-flow Zero-Knowledge Identification Protocol.
IACR Cryptology ePrint Archive, 2006

Unconditionally secure chaffing and winnowing with short authentication tags.
IACR Cryptology ePrint Archive, 2006

Multicollision Attacks on some Generalized Sequential Hash Functions.
IACR Cryptology ePrint Archive, 2006

Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions.
IACR Cryptology ePrint Archive, 2006

Some Observations on the Theory of Cryptographic Hash Functions.
Des. Codes Cryptography, 2006

A New Characterization of Semi-bent and Bent Functions on Finite Fields*.
Des. Codes Cryptography, 2006

Properties and constraints of cheating-immune secret sharing schemes.
Discrete Applied Mathematics, 2006

On the low hamming weight discrete logarithm problem for nonadjacent representations.
Appl. Algebra Eng. Commun. Comput., 2006

2005
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph.
Electr. J. Comb., 2005

A combinatorial approach to key predistribution for distributed sensor networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005

Tree-Based Key Distribution Patterns.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

New Minimal Weight Representations for Left-to-Right Window Methods.
Proceedings of the Topics in Cryptology, 2005

2004
Attack on a concast signature scheme.
Inf. Process. Lett., 2004

Multicollision Attacks on Generalized Hash Functions.
IACR Cryptology ePrint Archive, 2004

Generalized cover-free families.
Discrete Mathematics, 2004

New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Discrete Mathematics, 2004

The Lovász Local Lemma and Its Applications to some Combinatorial Arrays.
Des. Codes Cryptography, 2004

Deterministic Key Predistribution Schemes for Distributed Sensor Networks.
Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Combinatorial designs - constructions and analysis.
Springer, ISBN: 978-0-387-95487-5, 2004

2003
Contrast Optimal Threshold Visual Cryptography Schemes.
SIAM J. Discrete Math., 2003

Alternative Digit Sets for Nonadjacent Representations.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

Fault Tolerant and DistributedBroadcast Encryption.
Proceedings of the Topics in Cryptology, 2003

2002
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem.
Math. Comput., 2002

New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups.
J. Cryptology, 2002

Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels.
Des. Codes Cryptography, 2002

Preface: In Honour of Ronald C. Mullin.
Des. Codes Cryptography, 2002

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes.
Des. Codes Cryptography, 2002

New Results on Unconditionally Secure Distributed Oblivious Transfer.
Proceedings of the Selected Areas in Cryptography, 2002

On Unconditionally Secure Robust Distributed Key Distribution Centers.
Proceedings of the Advances in Cryptology, 2002

2001
Combinatorial properties of frameproof and traceability codes.
IEEE Trans. Information Theory, 2001

Efficient metering schemes with pricing.
IEEE Trans. Information Theory, 2001

Extended capabilities for visual cryptography.
Theor. Comput. Sci., 2001

Quorum Systems Constructed from Combinatorial Designs.
Inf. Comput., 2001

Some observations on the theory of cryptographic hash functions.
IACR Cryptology ePrint Archive, 2001

Slope packings and coverings, and generic algorithms for the discrete logarithm problem.
IACR Cryptology ePrint Archive, 2001

Something About All or Nothing (Transforms).
Des. Codes Cryptography, 2001

Generalized Zig-zag Functions and Oblivious Transfer Reductions.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Frameproof and IPP Codes.
Proceedings of the Progress in Cryptology, 2001

Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates.
Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000
Some New Bounds for Cover-Free Families.
J. Comb. Theory, Ser. A, 2000

Combinatorial Properties of Frameproof and Traceability Codes.
IACR Cryptology ePrint Archive, 2000

Constructions and Bounds for Unconditionally Secure Commitment Schemes.
IACR Cryptology ePrint Archive, 2000

Dynamic Multi-threshold Metering Schemes.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000

Metering Schemes for General Access Structures.
Proceedings of the Computer Security, 2000

1999
Combinatorial algorithms: generation, enumeration, and search.
SIGACT News, 1999

On the Contrast in Visual Cryptography Schemes.
J. Cryptology, 1999

An Application of Ramp Schemes to Broadcast Encryption.
Inf. Process. Lett., 1999

An application of covering designs: determining the maximum consistent set of shares in a threshold scheme.
Ars Comb., 1999

Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures.
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

Elliptic Curve Pseudorandom Sequence Generators.
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

1998
Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution.
Theor. Comput. Sci., 1998

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes.
SIAM J. Discrete Math., 1998

Some New Results on Key Distribution Patterns and Broadcast Encryption.
Des. Codes Cryptography, 1998

New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes.
Des. Codes Cryptography, 1998

Key Preassigned Traceability Schemes for Broadcast Encryption.
Proceedings of the Selected Areas in Cryptography '98, 1998

1997
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption.
Des. Codes Cryptography, 1997

Anonymous Secret Sharing Schemes.
Discrete Applied Mathematics, 1997

Almost k-wise Independent Sample Spaces and Their Cryptologic Applications.
Proceedings of the Advances in Cryptology, 1997

1996
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds.
SIAM J. Discrete Math., 1996

A Simple Analysis of the Error Probability of Two-Point Based Sampling.
Inf. Process. Lett., 1996

Visual Cryptography for General Access Structures.
Inf. Comput., 1996

On the Contrast in Visual Cryptography Schemes.
IACR Cryptology ePrint Archive, 1996

Visual Cryptography for General Access Structures
Electronic Colloquium on Computational Complexity (ECCC), 1996

Combinatorial Characterizations of Authentication Codes II.
Des. Codes Cryptography, 1996

Constructions and Bounds for Visual Cryptography.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution.
Proceedings of the Advances in Cryptology, 1996

Universal Hashing and Multiple Authentication.
Proceedings of the Advances in Cryptology, 1996

1995
An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions.
J. Cryptology, 1995

Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels.
Journal of Computer Security, 1995

On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes
Electronic Colloquium on Computational Complexity (ECCC), 1995

Three Characterizations of Non-binary Correlation-Immune and Resilient Functions.
Des. Codes Cryptography, 1995

Cryptography - theory and practice.
Discrete mathematics and its applications series, CRC Press, ISBN: 978-0-8493-8521-6, 1995

1994
Decomposition constructions for secret-sharing schemes.
IEEE Trans. Information Theory, 1994

Combinatorial Techniques for Universal Hashing.
J. Comput. Syst. Sci., 1994

On the Spectra of Certain Classes of Room Frames.
Electr. J. Comb., 1994

On the Dealer's Randomness Required in Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1994

Bounds for Resilient Functions and Orthogonal Arrays.
Proceedings of the Advances in Cryptology, 1994

1993
Towards the Spectrum of Room Squares with Subsquares.
J. Comb. Theory, Ser. A, 1993

A Note on a Conjecture Concerning Symmetric Resilient Functions.
Inf. Process. Lett., 1993

1992
A Parallelization of Miller's n^log n Isomorphism Technique.
Inf. Process. Lett., 1992

Nesting directed cycle systems of even length.
Eur. J. Comb., 1992

Some results on quadrilaterals in Steiner triple systems.
Discrete Mathematics, 1992

Further results on large sets of disjoint group-divisible designs.
Discrete Mathematics, 1992

An Explication of Secret Sharing Schemes.
Des. Codes Cryptography, 1992

Graph Decompositions and Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1992

New General Lower Bounds on the Information Rate of Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1992

1991
On bit-serial multiplication and dual bases in GF(2m).
IEEE Trans. Information Theory, 1991

Spanning sets and scattering sets in Steiner triple systems.
J. Comb. Theory, Ser. A, 1991

Designs constructed from maximal arcs.
Discrete Mathematics, 1991

A survey of Kirkman triple systems and related designs.
Discrete Mathematics, 1991

On the existence of three MOLS with equal-sized holes.
Australasian J. Combinatorics, 1991

Some small large sets of t-designs.
Australasian J. Combinatorics, 1991

Universal Hashing and Authentication Codes.
Proceedings of the Advances in Cryptology, 1991

Combinatorial Characterizations of Authentication Codes.
Proceedings of the Advances in Cryptology, 1991

1990
Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n).
SIAM J. Comput., 1990

The Combinatorics of Authentication and Secrecy Codes.
J. Cryptology, 1990

A Construction for Authentication/secrecy Codes from 3-homogeneous Permutation Groups.
Eur. J. Comb., 1990

On the number of blocks in a perfect covering of upsilon points.
Discrete Mathematics, 1990

Pairwise balanced designs with odd block sizes exceeding five.
Discrete Mathematics, 1990

Small embeddings for partial cycle systems of odd length.
Discrete Mathematics, 1990

Recent results on combinatorial constructions for threshold schemes.
Australasian J. Combinatorics, 1990

Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1990

1989
Some new perfect one-factorizations from starters in finite fields.
Journal of Graph Theory, 1989

The Oberwolfach problem and factors of uniform odd length cycles.
J. Comb. Theory, Ser. A, 1989

On combinatorial designs with subdesigns.
Discrete Mathematics, 1989

The existence of simple S3(3, 4, v).
Discrete Mathematics, 1989

Nesting of cycle systems of odd length.
Discrete Mathematics, 1989

1988
A perfect one-factorization for K36.
Discrete Mathematics, 1988

Authentication Codes with Multiple Arbiters (Extended Abstract).
Proceedings of the Advances in Cryptology, 1988

The Detection of Cheaters in Threshold Schemes.
Proceedings of the Advances in Cryptology, 1988

1987
Pairwise balanced designs with block sizes 6t + 1.
Graphs and Combinatorics, 1987

Frames for Kirkman triple systems.
Discrete Mathematics, 1987

A Combinatorial Approach to Threshold Schemes.
Proceedings of the Advances in Cryptology, 1987

A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs.
Proceedings of the Advances in Cryptology, 1987

1986
Concerning the spectrum of perpendicular arrays of triple systems.
Discrete Mathematics, 1986

Some NP-complete problems for hypergraph degree sequences.
Discrete Applied Mathematics, 1986

Some Constructions and Bounds for authentication Codes.
Proceedings of the Advances in Cryptology, 1986

1985
The spectrum of nested Steiner triple systems.
Graphs and Combinatorics, 1985

On sets of three mols with holes.
Discrete Mathematics, 1985

A Kirkman square of order 51 and block size 3.
Discrete Mathematics, 1985

On strong starters in cyclic groups.
Discrete Mathematics, 1985

1984
A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six.
J. Comb. Theory, Ser. A, 1984

The Existence of Howell Designs of Even Side.
J. Comb. Theory, Ser. A, 1984

Steiner pentagon systems.
Discrete Mathematics, 1984

The equivalence of certain equidistant binary codes and symmetric BIBDs.
Combinatorica, 1984

1983
Two-fold triple systems without repeated blocks.
Discrete Mathematics, 1983

Finite linear spaces and projective planes.
Discrete Mathematics, 1983

Room squares with holes of sides 3, 5, and 7.
Discrete Mathematics, 1983

Mols with holes.
Discrete Mathematics, 1983

1982
The Existence of Howell Designs of Odd Side.
J. Comb. Theory, Ser. A, 1982

Problem 26.
Discrete Mathematics, 1982

1981
The Spectrum of Room Cubes.
Eur. J. Comb., 1981

A general construction for group-divisible designs.
Discrete Mathematics, 1981

The existence of Howell designs of side n+1 and order 2n.
Combinatorica, 1981

1980
Some New Row-Complete Latin Squares.
J. Comb. Theory, Ser. A, 1980

A skew room square of order 129.
Discrete Mathematics, 1980


  Loading...