- Attack on a Concast Signature Scheme D.R. Stinson
- Alternative Digit Sets for Nonadjacent Representations
- RSA, Factoring, and Squeamish Ossifrage D. R. Stinson
- Universal hash families and the leftover hash lemma, and applications to cryptography and computing
- Properties and Constraints of CheatingImmune Secret Sharing Schemes \Lambda
- On the Contrast in Visual Cryptography Schemes
- Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic
- Quorum Systems Constructed from Combinatorial Designs Charles J. Colbourn
- Anonymous Secret Sharing Schemes Dipartimento di Informatica ed Applicazioni
- Constructions and Bounds for Visual Cryptography ?
- On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
- Cryptanalyzing a Keystream Obtained from the Product of Two LFSRs
- Combinatorial Characterizations of Authentication Rolf S. Rees
- The first edition of this book was published in March 1995. At that time, my objective was to produce a general textbook that treated all the essential core
- New combinatorial bounds for authentication codes and key predistribution schemes
- Three Characterizations of Nonbinary CorrelationImmune and Resilient Functions
- Efficient Metering Schemes with Pricing
- New Constructions for Perfect Hash Families and Related Structures using Combinatorial Designs
- Dynamic Multi--Threshold Metering Schemes
- Graph Decompositions and Secret Sharing Schemes 1
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem
- Frames with Block Size Four Rolf S. Rees
- A Singular Direct Product for Bicolorable Steiner Triple Systems
- Something about all or nothing (transforms) D. R. Stinson
- On the existence of certain SOLS with Holes D. R. Stinson
- Bounds for Resilient Functions and Orthogonal Extended Abstract
- On the maximum number of fixed points in automorphisms of prime order of 2(v; k; 1) designs
- An Application of Ramp Schemes to Broadcast Encryption D. R. Stinson
- The Group Operation for Elliptic Curves D. R. Stinson
- On Unconditionally Secure Robust Distributed Key Distribution Centers
- Generalized BeimelChor Schemes for Broadcast Encryption and Interactive Key Distribution \Lambda
- Generalized CoverFree Families D.R. Stinson
- Some Results on Nonlinear Zigzag Functions D. R. Stinson
- Threshold Visual Cryptography Schemes With Specified Whiteness Levels of Reconstructed Pixels
- Tradeoffs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast
- Computing transverse tdesigns Kimberly A. Lauinger and Donald L. Kreher
- Universal hashing and authentication codes 1 D. R. Stinson
- Universal Hashing and Multiple Authentication M. Atici 1;2 and D. R. Stinson 1;3
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
- Finding Primitive Elements in Z p D. R. Stinson
- New approaches to designing public key cryptosystems using one-way functions and trap-doors in nite groups
- Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes
- New Results on Unconditionally Secure Distributed Oblivious Transfer
- A generalized Rao bound for ordered orthogonal arrays and (t; m; s)nets
- Some New Results on Key Distribution Patterns and Broadcast Encryption
- Almost kwise Independent Sample Spaces and Their Cryptologic Applications
- On the Contrast in Visual Cryptography Schemes
- Some Recursive Constructions for Perfect Hash M. Atici, S. S. Magliveras, D. R. Stinson and W.D. Wei
- An application of covering designs: determining the maximum consistent set of
- Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels
- An explicit formulation of the second Johnson bound D. R. Stinson
- Metering Schemes for General Access Structures
- Extended Capabilities for Visual Cryptography
- Cryptography, http://cacr.math.uwaterloo.ca/ dstinson/index.html
- Pseudocode: A L A T E X Style File for Displaying D.L. Kreher
- 1 Classical Cryptography 1 1.1 Introduction: Some Simple Cryptosystems . . . . . . . 1
- On Assigning Referees to Tournament Je rey H. Dinitz
- Fault Tolerant and Distributed Broadcast Encryption Paolo D'Arco 1 and Douglas R. Stinson 2
- A Short Proof of the NonExistence of Certain Cryptographic K. Gopalakrishnan
- Small group divisible designs with block size four D. L. Kreher
- Orthogonal arrays of strength three from regular 3wise balanced designs
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- A Combinatorial Approach to Key Predistribution for Distributed Sensor Networks
- Generalized Zigzag Functions and Oblivious Transfer Reductions
- Combinatorial properties of frameproof and traceability codes
- Deterministic Key Predistribution Schemes for Distributed Sensor Networks
- New Combinatorial Designs and their Applications to Authentication Codes
- On the Connections Between Universal Hashing, Combinatorial Designs and
- The Lovasz Local Lemma and Its Applications to Some Combinatorial Arrays
- Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group
- Frameproof and IPP Codes Palash Sarkar and Douglas R. Stinson
- Universal hashing and authentication codes D. R. Stinson
- , , 1--26 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- ALTERNATIVE DIGIT SETS FOR NONADJACENT REPRESENTATIONS #
- A New Practical Algorithm for the Construction of a Perfect Hash Function
- A Note on a Conjecture concerning Symmetric Resilient Functions
- MINIMALITY AND OTHER PROPERTIES OF THE WIDTHw NONADJACENT FORM
- 1 Introduction Page 1 Provably Secure Distributed Schnorr Signatures and a (t; n) Threshold
- Contrast Optimal Threshold Visual Cryptography Schemes
- Association schemes for ordered orthogonal arrays and (t,m,s)nets
- Combinatorial characterizations of authentication codes D. R. Stinson
- On the Maximum Number of Di#erent Ordered Pairs of Symbols in Sets of Latin Squares
- Treebased Key Distribution Patterns Jooyoung Lee 1 and Douglas R. Stinson 2
- A note on the duality of linear programming bounds for orthogonal arrays and codes
- Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
- Applications of Combinatorial Designs to Communications, Cryptography, and Networking
- Extended Schemes for Visual Cryptography \Lambda Giuseppe Ateniese 1 , Carlo Blundo 2 , Alfredo De Santis 2 , and Douglas R. Stinson 3
- Constructions for Retransmission Permutation Arrays Jeffrey H. Dinitz
- Packing Costas Arrays J.H. Dinitz
- Constructions and Bounds for (m, t)-Splitting Systems D. Deng and D.R. Stinson
- A Provably Secure True Random Number Generator with Built-in Tolerance to Active Attacks
- A Bound on the Size of Separating Hash Families Simon R. Blackburn
- MULTI-PATH KEY ESTABLISHMENT IN SENSOR NETWORKS 1 Three Improved Algorithms for Multi-path Key
- Cryptanalysis of Secure Message Transmission Protocols with Qiushi Yang and Yvo Desmedt
- The Effectiveness of Receipt-Based Attacks on ThreeBallot
- Two attacks on a sensor network key distribution scheme of Cheng and Agrawal
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- How to Improve Security and Reduce Hardware Demands of
- A New Message Recognition Protocol for Ad Hoc Pervasive Networks
- Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes
- Combinatorial Batch Codes Maura B. Paterson1 Douglas R. Stinson2 Ruizhong Wei3
- Multicollision attacks on iterated hash Douglas R. Stinson
- Putting Dots in Triangles Simon R. Blackburn1 Maura B. Paterson2
- Minimum Node Degree and -connectivity for Key Predistribution Schemes and Distributed Sensor Networks
- A Critical Analysis and Improvement of AACS Drive-Host Authentication
- A NEW MESSAGE RECOGNITION PROTOCOL WITH SELF-RECOVERABILITY FOR AD HOC PERVASIVE NETWORKS
- Practical Unconditionally Secure Two-channel Message Authentication
- INTERACTIVE TWO-CHANNEL MESSAGE AUTHENTICATION BASED ON INTERACTIVE-COLLISION RESISTANT HASH FUNCTIONS
- Combinatorial Batch Codes M. B. Paterson
- An Efficient Identification Protocol Secure Against Concurrent-Reset Attacks
- Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for
- Linear Threshold Multisecret Sharing Schemes Oriol Farr`as, Ignacio Gracia, Sebasti`a Martin and Carles Padro
- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage
- A Highly Scalable RFID Authentication J. Wu and D. R. Stinson
- Leakage Resilience and the Bounded Retrieval Model Joel Alwen, Yevgeniy Dodis, and Daniel Wichs
- Nonincident Points and Blocks in Designs Douglas R. Stinson
