Douglas Robert Stinson
Orcid: 0000-0001-5635-8122Affiliations:
- University of Waterloo, Canada
According to our database1,
Douglas Robert Stinson
authored at least 248 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, April, 2024
2023
Discret. Math., August, 2023
Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families.
CoRR, 2023
Splitting authentication codes with perfect secrecy: New results, constructions and connections with algebraic manipulation detection codes.
Adv. Math. Commun., 2023
2022
An analysis and critique of the scoring method used for sport climbing at the 2020 Tokyo Olympics.
Bull. ICA, 2022
2021
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms.
IACR Cryptol. ePrint Arch., 2021
New results on modular Golomb rulers, optical orthogonal codes and related structures.
Ars Math. Contemp., 2021
2020
Australas. J Comb., 2020
2019
IACR Cryptol. ePrint Arch., 2019
A network reliability approach to the analysis of combinatorial repairable threshold schemes.
Adv. Math. Commun., 2019
Australas. J Comb., 2019
Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019
2018
Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets.
IEEE Trans. Inf. Theory, 2018
A brief retrospective look at the Cayley-Purser public-key cryptosystem, 19 years later.
Bull. ICA, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Some Nonexistence Results for Strong External Difference Families using Character Theory.
Bull. ICA, 2017
Australas. J Comb., 2017
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices.
Australas. J Comb., 2017
2016
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families.
Discret. Math., 2016
2015
J. Math. Cryptol., 2015
J. Internet Serv. Inf. Secur., 2015
Des. Codes Cryptogr., 2015
Extended results on privacy against coalitions of users in user-private information retrieval protocols.
Cryptogr. Commun., 2015
2014
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs.
Discret. Math., 2014
Combinatorial solutions providing improved security for the generalized Russian cards problem.
Des. Codes Cryptogr., 2014
Des. Codes Cryptogr., 2014
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs.
Electron. J. Comb., 2014
Proceedings of the Information Security Practice and Experience, 2014
2013
Practical approaches to varying network size in combinatorial key predistribution schemes.
IACR Cryptol. ePrint Arch., 2013
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes.
Cryptogr. Commun., 2013
2012
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage.
IACR Cryptol. ePrint Arch., 2012
A Simplified Combinatorial Treatment of Constructions and Threshold Gaps of Ramp Schemes.
IACR Cryptol. ePrint Arch., 2012
Des. Codes Cryptogr., 2012
Extended combinatorial constructions for peer-to-peer user-private information retrieval.
Adv. Math. Commun., 2012
Proceedings of the Tenth Annual International Conference on Privacy, Security and Trust, 2012
Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012
2011
Wirel. Pers. Commun., 2011
Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission.
IEEE Trans. Dependable Secur. Comput., 2011
Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski.
IACR Cryptol. ePrint Arch., 2011
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieva
CoRR, 2011
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures.
Cryptogr. Commun., 2011
2010
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes.
ACM Trans. Sens. Networks, 2010
Int. J. Appl. Cryptogr., 2010
Des. Codes Cryptogr., 2010
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
IEEE Trans. Inf. Forensics Secur., 2009
J. Math. Cryptol., 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.
Int. J. Appl. Cryptogr., 2009
Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission.
IACR Cryptol. ePrint Arch., 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
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. Inf. Theory, 2008
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs.
ACM Trans. Inf. Syst. Secur., 2008
How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG.
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 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
Proceedings of the Information Theoretic Security, Third International Conference, 2008
2007
IEEE Trans. Inf. Theory, 2007
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks.
IEEE Trans. Computers, 2007
Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols.
J. Math. Cryptol., 2007
Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions.
IET Inf. Secur., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Des. Codes Cryptogr., 2007
Adv. Math. Commun., 2007
2006
Math. Comput., 2006
IACR Cryptol. ePrint Arch., 2006
Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions.
IACR Cryptol. ePrint Arch., 2006
Des. Codes Cryptogr., 2006
Des. Codes Cryptogr., 2006
Discret. Appl. Math., 2006
On the low hamming weight discrete logarithm problem for nonadjacent representations.
Appl. Algebra Eng. Commun. Comput., 2006
2005
Electron. J. Comb., 2005
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005
Proceedings of the Topics in Cryptology, 2005
2004
IACR Cryptol. ePrint Arch., 2004
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Discret. Math., 2004
Des. Codes Cryptogr., 2004
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
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. Cryptol., 2002
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels.
Des. Codes Cryptogr., 2002
Preface: In Honour of Ronald C. Mullin.
Des. Codes Cryptogr., 2002
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes.
Des. Codes Cryptogr., 2002
Proceedings of the Selected Areas in Cryptography, 2002
Proceedings of the Advances in Cryptology, 2002
2001
IEEE Trans. Inf. Theory, 2001
J. Cryptol., 2001
Slope packings and coverings, and generic algorithms for the discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2001
Something About All or Nothing (Transforms).
Des. Codes Cryptogr., 2001
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 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
IACR Cryptol. ePrint Arch., 2000
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000
Proceedings of the Computer Security, 2000
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
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. Discret. Math., 1998
Des. Codes Cryptogr., 1998
Des. Codes Cryptogr., 1998
Proceedings of the Selected Areas in Cryptography '98, 1998
1997
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption.
Des. Codes Cryptogr., 1997
Des. Codes Cryptogr., 1997
1996
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds.
SIAM J. Discret. Math., 1996
Inf. Process. Lett., 1996
Electron. Colloquium Comput. Complex., 1996
Des. Codes Cryptogr., 1996
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
Proceedings of the Advances in Cryptology, 1996
1995
An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions.
J. Cryptol., 1995
J. Comput. Secur., 1995
On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes
Electron. Colloquium Comput. Complex., 1995
Des. Codes Cryptogr., 1995
Cryptography - theory and practice.
Discrete mathematics and its applications series, CRC Press, ISBN: 978-0-8493-8521-6, 1995
1994
IEEE Trans. Inf. Theory, 1994
Proceedings of the Advances in Cryptology, 1994
1993
Towards the Spectrum of Room Squares with Subsquares.
J. Comb. Theory, Ser. A, 1993
Inf. Process. Lett., 1993
1992
J. Cryptol., 1992
Inf. Process. Lett., 1992
Discret. Math., 1992
Proceedings of the Advances in Cryptology, 1992
1991
J. Comb. Theory, Ser. A, 1991
1990
SIAM J. Comput., 1990
A Construction for Authentication/secrecy Codes from 3-homogeneous Permutation Groups.
Eur. J. Comb., 1990
Discret. Math., 1990
Australas. J Comb., 1990
1989
J. Graph Theory, 1989
J. Comb. Theory, Ser. A, 1989
1988
J. Cryptol., 1988
Proceedings of the Advances in Cryptology, 1988
1987
1986
Discret. Math., 1986
Discret. Appl. Math., 1986
1985
1984
A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six.
J. Comb. Theory, Ser. A, 1984
1983
1982
Problem 26.
Discret. Math., 1982
1981
1980