|
UNDER CONSTRUCTION
This listing currently contains my publications from 2000-2012.
For a complete list of all my publications, please refer to my
curriculum vitae.
Links are frequently provided to published versions of papers; however,
subscriptions may be required to access them.
Papers Published in 2013
Papers Published in 2012
- J. H. Dinitz, P. R. J. Ostergard and D. R. Stinson.
Packing Costas arrays.
JCMCC 80 (2012), 385-403.
- S. R. Blackburn, D. R. Stinson and J. Upadhyay.
On the complexity of the herding attack and some related attacks on hash functions.
Designs, Codes and Cryptography
64 (2012), 171-193.
- J. H. Dinitz, M. B. Paterson, D. R. Stinson and R. Wei.
Constructions for retransmission permutation arrays.
Designs, Codes and Cryptography
65 (2012), 325-351.
-
M. Nojoumian and D. R. Stinson.
Social secret sharing in cloud computing using a
new trust function.
Tenth Annual Conference on
Privacy, Security and Trust (PST 2012),
pp. 161-167.
-
M. Nojoumian and D. R. Stinson.
Socio-rational secret sharing as a new direction in rational cryptography.
LNCS 7638 (2012), 18-37
(Conference on Decision and
Game Theory for Security, GameSec 2012).
-
C. M. Swanson and D. R. Stinson.
Extended combinatorial constructions for peer-to-peer user-private
information retrieval.
Advances in Mathematics of Communications
6 (2012), 479-497.
Papers Published in 2011
-
K. M. Martin, M. B. Paterson and D. R. Stinson.
Error decodable secret sharing and one-round perfectly secure
message transmission for general adversary structures.
Cryptography and Communications - Discrete
Structures, Boolean Functions and Sequences 3 (2011), 65-86.
- K. Henry and D. R. Stinson.
Secure network discovery in wireless sensor
networks using combinatorial key pre-distribution.
2011 IEEE Workshop on Lightweight Security & Privacy: Devices, Protocols
and Applications (LightSec 2011), pp. 34-43.
-
C. Swanson and D. R. Stinson.
Unconditionally secure signature schemes revisited.
Lecture Notes in Computer Science 6673 (2011),
100-116.
(ICITS 2011 Proceedings.)
-
S. R. Blackburn, M. Paterson and D. R. Stinson.
Putting dots in triangles.
JCMCC 78 (2011), 23-32.
- G. M. Zaverucha and D. R. Stinson.
Short one-time signatures.
Advances in Mathematics of Communications
5 (2011), 473-488.
- J. Wu and D. R. Stinson.
Three improved algorithms for multipath key establishment in sensor networks using protocols for secure message transmission.
IEEE Transactions on Dependable and Secure Computing
8 (2011), 929-937.
- R. C.-W. Phan, J. Wu, K. Ouafi and D. R. Stinson.
Privacy analysis of forward and backward untraceable RFID identification schemes.
Wireless Personal Communications 61 (2011), 69-81.
Papers Published in 2010
-
A. Mashatan and D.R. Stinson.
Practical unconditionally secure two-channel message authentication.
Designs, Codes and Cryptography
55 (2010), 169-188.
-
M.B. Paterson and D.R. Stinson.
Yet another hat game.
Electronic Journal of Combinatorics
17(1) (2010), #R86, 12 pp.
-
G.M. Zaverucha and D.R. Stinson.
Anonymity in shared symmetric key primitives.
Designs, Codes and Cryptography
57 (2010), 139-160.
-
K.M. Martin, M.B. Paterson and D.R. Stinson.
Key predistribution for homogeneous wireless sensor
networks with group deployment of nodes.
ACM Transactions on Sensor Networks
7-2 (2010), article No. 11, 27 pp.
-
S.R. Blackburn, A. Panoui, M.B. Paterson and D.R. Stinson.
Honeycomb arrays.
Electronic Journal of Combinatorics
17(1) (2010), #R172, 10 pp.
-
M. Nojoumian, D.R. Stinson and M. Grainger.
Unconditionally secure social secret sharing scheme.
IET Information Security 4 (2010), 202-211.
[Special issue on Multi-agent & Distributed information Security.]
-
I. Goldberg, A. Mashatan and D. R. Stinson.
On message recognition protocols: recoverability and explicit confirmation.
International Journal of Applied Cryptography
2 (2010), 100-120.
-
G. M. Zaverucha and D. R. Stinson.
Group testing and batch verification.
Lecture Notes in Computer Science 5973 (2010),
140-157.
(ICITS 2010 Proceedings.)
- M. Nojoumian and D.R. Stinson.
Unconditionally secure first-price auction protocols using
a multicomponent commitment scheme.
Lecture Notes in Computer Science 6476 (2010),
266-280. (ICICS 2010 Proceedings.)
Papers Published in 2009
-
A. Mashatan and D.R. Stinson.
Interactive two-channel message authentication
based on interactive-collision resistant hash functions.
International Journal of Information Security
8 (2009), 49-60.
-
M.B. Paterson, D.R. Stinson and R. Wei.
Combinatorial batch codes.
Advances in Mathematics of Communications
3 (2009), 13-27.
-
J. Sui and D.R. Stinson.
A critical analysis and improvement of AACS drive-host authentication.
International Journal of Applied Cryptography
1 (2009), 169-180.
-
H. Cao, J. Dinitz, D. Kreher, D.R. Stinson and R. Wei.
On orthogonal generalized equitable rectangles.
Designs, Codes and Cryptography
51 (2009), 225-230.
-
K. Henry, D.R. Stinson and J. Sui.
The effectiveness of receipt-based attacks on ThreeBallot.
IEEE Transactions on Information Forensics 4 (2009), 699-707.
[Special Issue on Electronic Voting.]
-
J. Wu and D.R. Stinson.
An efficient identification protocol secure against concurrent-reset attacks.
Journal of Mathematical Cryptology 3 (2009), 339-352.
-
J. Wu and D.R. Stinson.
How to improve security and reduce hardware demands of the WIPR RFID protocol.
2009 IEEE International Conference on RFID, pp. 192-199.
-
I. Goldberg, A. Mashatan and D.R. Stinson.
A new message recognition protocol with self-recoverability
for ad hoc pervasive networks.
Lecture Notes in Computer Science 5336 (2009),
219-237.
(7th International Conference on Applied Cryptography and Network Security, ACNS '09.)
-
J. Wu and D.R. Stinson.
A highly scalable RFID authentication protocol.
Lecture Notes in Computer Science 5594 (2009), 360-376.
(14th Australasian Conference on Information Security and Privacy, ACISP '09).
Papers Published in 2008
- D.R. Stinson, R. Wei and K. Chen.
On generalized separating hash families.
JCT A 115 (2008), 105-120.
- J. Lee and D.R. Stinson.
On the construction of practical key predistribution schemes
for distributed sensor networks using
combinatorial designs.
TISSEC 11 (2008), article 5, 35 pp.
- D.R. Stinson and G.M. Zaverucha.
Some improved bounds for secure frameproof codes and
related separating hash families.
IEEE Transactions on Information Theory
54 (2008), 2508-2514.
- S.R. Blackburn, T. Etzion, D.R. Stinson and G.M. Zaverucha.
A bound on the size of separating hash families.
JCT A 115 (2008), 1246-1256.
-
M.B. Paterson and D.R. Stinson.
Two attacks on a sensor network key distribution scheme of
Cheng and Agrawal.
Journal of Mathematical Cryptology 2 (2008), 393-403.
- J. Wu and D.R. Stinson.
Minimum node degree and kappa-connectivity for key predistribution
schemes and distributed sensor networks.
Proceedings of the First ACM Conference on Wireless
Network Security (WiSec 2008), pp. 119-124.
- J. Sui and D.R. Stinson.
A critical analysis and improvement of AACS
drive-host authentication.
Lecture Notes in Computer Science 5107 (2008),
37-52.
(ACISP 2008 Proceedings).
- S.R. Blackburn, K.M. Martin, M.B. Paterson and D.R. Stinson.
Key refreshing in wireless
sensor networks.
Lecture Notes in Computer Science 5155 (2008),
156-170.
(ICITS 2008 Proceedings.)
-
J. Wu and D.R. Stinson.
Authorship proof for textual document.
Lecture Notes in Computer Science 5284 (2008),
209-223.
(Information Hiding 2008.)
-
K. Gopalakrishnan and D.R. Stinson.
Applications of orthogonal arrays to computer science.
Lecture Notes Series in Mathematics
(Ramanujan Mathematical Society) 7 (2008), 149-164.
(International Conference on Discrete Mathematics, ICDM 2006.)
-
A. Mashatan and D.R. Stinson.
A new message recognition protocol for ad hoc pervasive networks.
Lecture Notes in Computer Science 5339 (2008),
378-394.
(Seventh International Conference on
Cryptology and Network Security, CANS 2008.)
Papers Published in 2007
-
D. Deng, D.R. Stinson, P.C. Li, G.H.J. van Rees and R. Wei.
Constructions and bounds for splitting systems.
Discrete Mathematics 307 (2007), 18-37.
-
B. Sunar, W.J. Martin and D.R. Stinson.
A provably secure true random number generator with
built-in tolerance to active attacks.
IEEE Transactions on Computers 56 (2007), 109-119
-
M. Nandi and D.R. Stinson.
Multicollision attacks on some
generalized sequential hash functions.
IEEE Transactions on Information Theory 53 (2007), 759-767.
- J. Dinitz, A. Ling and D.R. Stinson.
Perfect hash families from transversal designs.
Australasian Journal of Combinatorics
37 (2007), 233-242.
- D.R. Stinson and R. Wei.
Some results on query processes and reconstruction functions
for unconditionally secure 2-server 1-round binary private
information retrieval protocols.
Journal of Mathematical Cryptology 1 (2007), 33-46.
- D.R. Stinson.
Unconditionally secure chaffing and winnowing with short authentication tags.
Advances in Mathematics of Communication. 1 (2007), 269-280.
- D.R. Stinson and S. Zhang.
Algorithms for detecting cheaters in threshold schemes
JCMCC 61 (2007), 169-191.
- C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson.
On unconditionally secure distributed oblivious transfer.
Journal of Cryptology 20 (2007), 323-373.
- D.R. Stinson and J. Wu.
An efficient and secure two-flow zero-knowledge identification protocol.
Journal of Mathematical Cryptology 1 (2007), 201-220.
- A. Mashatan and D.R. Stinson.
Noninteractive two-channel message authentication
based on hybrid-collision resistant hash functions.
IET Information Security 1 (2007), 111-118.
- D.R. Stinson.
Generalized mix functions and orthogonal equitable rectangles.
Designs, Codes and Cryptography
45 (2007), 347-357.
- Chapters in the
Handbook of Combinatorial Designs, Second Edition, CRC Press, Inc., 2007:
-
Bent functions, pp. 337-339.
-
Correlation-immune and resilient functions,
coauthored with K. Gopalakrishnan, pp. 355-357.
-
Coverings, coauthored with D.M. Gordon, pp. 365-373.
-
Derandomization, coauthored with K. Gopalakrishnan, pp. 389-391.
-
Packings, coauthored with R. Wei and J. Yin, pp. 550-556.
-
Secrecy and authentication codes, coauthored with K. Gopalakrishnan,
pp. 606-611.
-
Threshold and ramp schemes, coauthored with K. Gopalakrishnan,
pp. 635-639.
Papers Published in 2006
-
J.A. Muir and D.R. Stinson.
Minimality and other properties of the width-w nonadjacent form.
Mathematics of Computation 75 (2006), 369-384.
-
P. D'Arco, W. Kishimoto and D.R. Stinson.
Properties and constraints of
cheating-immune secret sharing schemes.
Discrete Applied Mathematics 154 (2006), 219-233.
[Special Issue on Coding and Cryptography.]
-
D.R. Stinson.
Some observations on the theory of cryptographic hash functions.
Designs, Codes and Cryptography 38 (2006), 259-277.
-
K. Khoo, G. Gong and D.R. Stinson.
A new characterization of bent and semi-bent functions on finite fields.
Designs, Codes and Cryptography 38 (2006), 279-295.
- J.A. Muir and D.R. Stinson.
On the low hamming weight discrete logarithm problem
for nonadjacent representations.
Applicable Algebra in Engineering, Communication and Computing
16 (2006), 461-472.
[Special issue on mathematical techniques in cryptology.]
- W. Ogata, K. Kurosawa and D.R. Stinson.
Optimum secret sharing scheme secure against cheating.
SIAM Journal on Discrete Mathematics 20 (2006), 79-95.
- J. Lee and D.R. Stinson.
Common intersection designs.
Journal of Combinatorial Designs
14 (2006), 251-269.
- J.H. Dinitz, A. Ling and D.R. Stinson.
Fault tolerant routings with minimum optical index.
Networks 48 (2006), 47-55.
- J. Lee and D.R. Stinson.
Tree-based key distribution patterns.
Lecture Notes in Computer Science 3897 (2006), 189-204.
(SAC 2005 Proceedings.)
- P. C. Li, D. R. Stinson, G. H. J. van Rees and R. Wei.
On {123,124,134}-free hypergraphs.
Congressus Numerantium
183 (2006), 161-174.
(Thirty-seventh Southeastern International Conference on Combinatorics,
Graph Theory and Computing, 2006.)
Papers Published in 2005
-
J.H. Dinitz and D.R. Stinson.
On the maximum number of different ordered pairs
of symbols in sets of latin squares.
Journal of Combinatorial Designs 13 (2005), 1-15.
- J.H. Dinitz, P. Dukes and D.R. Stinson.
Sequentially perfect and uniform one-factorizations of the
complete graph.
Electronic Journal of Combinatorics
12 (2005), #R1, 12pp.
- J.H. Dinitz and D.R. Stinson.
On assigning referees to tournament schedules
Bulletin of the ICA 44 (2005), 22-28.
-
J.A. Muir and D.R. Stinson.
Alternative digit sets for nonadjacent representations.
SIAM J. on Discrete Math. 19 (2005), 165-191.
-
K.A. Lauinger, D.L. Kreher, R.S. Rees and D.R. Stinson.
Computing transverse t-designs.
J. Combin. Math. Combin. Comput.
54 (2005), 33-56.
-
J. Lee and D.R. Stinson.
Deterministic key predistribution schemes for distributed
sensor networks.
Lecture Notes in Computer Science 3357 (2005), 294-307.
(SAC 2004 Proceedings.)
- J.A. Muir and D.R. Stinson.
New minimal weight representations for left-to-right window methods.
Lecture Notes in Computer Science 3376 (2005), 366-383.
(CT-RSA 2005 Proceedings.)
- J. Lee and D.R. Stinson.
A combinatorial approach to key predistribution for
distributed sensor networks
.
IEEE Wireless Communications and Networking Conference (WCNC 2005),
vol. 2, pp. 1200-1205.
Papers Published in 2004
Papers Published in 2003
-
M. Chateauneuf, A.C.H. Ling and D.R. Stinson.
Slope packings and coverings, and generic algorithms
for the discrete logarithm problem.
Journal of Combinatorial Designs 11 (2003), 36-50.
-
C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson.
Contrast optimal threshold visual
cryptography schemes.
SIAM J. on Discrete Math. 16 (2003), 224-261.
- C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson.
New results on unconditionally secure distributed oblivious transfer:
extended abstract.
Lecture Notes in Computer Science
2595 (2003), 291-309. (SAC 2002 Proceedings.)
-
P. D'Arco and D.R. Stinson.
Fault tolerant and distributed broadcast encryption.
Lecture Notes in Computer Science 2612 (2003), 263-280.
(Topics in Cryptography, CT-RSA 2003.)
Papers Published in 2002
-
D.R. Stinson.
Some baby-step giant-step algorithms for the low hamming weight
discrete logarithm problem.
Mathematics of Computation
71 (2002), 379-391.
-
P.A. Eisen and D.R. Stinson.
Threshold visual cryptography schemes
with specified whiteness levels of reconstructed pixels.
Designs, Codes and Cryptography
25 (2002), 15-61.
-
C.J. Colbourn, D.L. Kreher, J.P. McSorley and D.R. Stinson.
Orthogonal arrays of strength three from regular
3-wise balanced designs.
Journal of Statistical Planning and Inference
100 (2002), 191-195.
-
C. Blundo, B. Masucci, D.R. Stinson and R. Wei.
Constructions and bounds for unconditionally secure
non-interactive commitment schemes.
Designs, Codes and Cryptography
26 (2002), 97-110.
[Special volume in honour of Ron Mullin.]
-
S.S. Magliveras, D.R. Stinson and Tran van Trung.
New approaches to designing public key cryptosystems
using one-way functions and trap-doors in finite groups.
Journal of Cryptology 15 (2002), 285-297.
-
D.R. Stinson.
Universal hash families and the leftover hash lemma,
and applications to cryptography and computing.
J. Combin. Math. Combin. Comput.
42 (2002), 3-31.
-
P. D'Arco and D.R. Stinson.
On unconditionally secure robust distributed key
distribution centers.
Lecture Notes in Computer Science
2501 (2002), 346-363.
(ASIACRYPT 2002 Proceedings.)
-
J.H. Dinitz and D.R. Stinson.
A singular direct product for bicolorable Steiner triple systems.
In Codes and Designs,
Walter de Gruyter, 2002, pages 87-97
(Ohio State University Mathematical
Research Institute Publications, volume 10).
[Special volume in honour of Dijen Ray-Chaudhuri.]
-
M. Qu, D. Stinson and S. Vanstone.
Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based
key distribution system over elliptic curves.
In Finite Fields with Applications to Coding Theory,
Cryptography and Related Areas,
Springer-Verlag, 2002, pp. 263-269.
(Sixth International Conference on
Finite Fields and Applications.)
Papers Published in 2001
-
G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson.
Extended capabilities for visual cryptography.
Theoretical Computer Science
250 (2001), 143-161.
-
D. R. Stinson.
Something about all or nothing (transforms).
Designs, Codes and Cryptography
22 (2001), 133-138.
-
J. N. Staddon, D.R. Stinson and R. Wei.
Combinatorial properties of frameproof and traceability codes.
IEEE Transactions on Information Theory
47 (2001), 1042-1049.
-
C. J. Colbourn, J. H. Dinitz and D. R. Stinson.
Quorum systems constructed
from combinatorial designs.
Information and Computation
169 (2001), 160-173.
-
K. Kurosawa, T. Johansson and D. R. Stinson.
Almost k-wise independent sample spaces and their cryptologic applications.
Journal of Cryptology 14 (2001), 231-253.
-
B. Masucci and D. R. Stinson.
Efficient metering schemes with pricing.
IEEE Transactions on Information Theory
47 (2001), 2835-2844.
-
C. Blundo, A. De Bonis, B. Masucci and D. R. Stinson.
Dynamic multi-threshold metering schemes.
Lecture Notes in Computer Science
2012 (2001), 130-143.
(SAC 2000.)
-
D. R. Stinson and R. Strobl.
Provably secure distributed Schnorr signatures
and a (t,n) threshold scheme for implicit certificates.
Lecture Notes in Computer Science
2119 (2001), 417-434. (Sixth Australasian Conference
on Information Security and Privacy, ACISP 2001.)
-
P. Sarkar and D. R. Stinson.
Frameproof and IPP codes.
Lecture Notes in Computer Science
2247 (2001), 117-126.
(INDOCRYPT 2001.)
-
P. D'Arco and D. R. Stinson.
Generalized zig-zag functions and
oblivious transfer reductions.
Lecture Notes in Computer Science
2259 (2001), 87-102.
(Selected Areas in Cryptography, 2001.)
Papers Published in 2000
-
D. R. Stinson, Tran van Trung and R. Wei.
Secure frameproof codes,
key distribution patterns, group testing algorithms
and related structures.
Journal of Statistical Planning and Inference.
86 (2000), 595-617.
-
D. R. Stinson, R. Wei and L. Zhu.
New constructions for perfect hash families
and related structures using combinatorial designs and codes.
J. Combin. Designs 8 (2000), 189-200.
-
D. R. Stinson, R. Wei and L. Zhu.
Some new bounds for cover-free families.
J. Combin. Theory A. 90 (2000), 224-234.
-
D. L. Kreher and D. R. Stinson.
Pseudocode: a LaTeX style file for displaying algorithms.
Bulletin of the ICA
30 (2000), 11-24.
-
M. Atici, D. R. Stinson and R. Wei.
A new practical algorithm for the
construction of a perfect hash function.
J. Combin. Math. Combin. Comput.
35 (2000), 127-145.
-
G. Gong, T. A. Berson and D. R. Stinson.
Elliptic curve pseudorandom sequence generators.
Lecture Notes in Computer Science
1758 (2000), 34-48.
(SAC '99 Proceedings.)
-
D. R. Stinson and R. Wei.
Unconditionally secure proactive secret sharing scheme
with combinatorial structure.
Lecture Notes in Computer Science
1758 (2000), 200-214. (SAC '99 Proceedings.)
-
B. Masucci and D. R. Stinson.
Metering schemes for general
access structures.
Lecture Notes in Computer Science
1895 (2000), 72-87.
(Sixth European Symposium on Research in Computer Security, ESORICS 2000.)
|