Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms. | 0 | 0.34 | 2021 |
Block-avoiding point sequencings of directed triple systems | 1 | 0.40 | 2020 |
Block-avoiding point sequencings of arbitrary length in Steiner triple systems | 0 | 0.34 | 2020 |
Bounds for orthogonal arrays with repeated rows. | 0 | 0.34 | 2019 |
Nonsequenceable Steiner triple systems | 0 | 0.34 | 2019 |
On The Equivalence Of Authentication Codes And Robust (2, 2)-Threshold Schemes | 1 | 0.37 | 2019 |
Multi-prover proof of retrievability. | 1 | 0.35 | 2018 |
Ideal ramp schemes and related combinatorial objects. | 0 | 0.34 | 2018 |
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes. | 0 | 0.34 | 2018 |
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later. | 0 | 0.34 | 2018 |
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. | 0 | 0.34 | 2017 |
Optimal Ramp Schemes and Related Combinatorial Objects. | 0 | 0.34 | 2017 |
Localised Multisecret Sharing. | 0 | 0.34 | 2017 |
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices. | 0 | 0.34 | 2017 |
A survey and refinement of repairable threshold schemes. | 0 | 0.34 | 2017 |
Multi-prover Proof-of-Retrievability. | 1 | 0.35 | 2016 |
Sequential Secret Sharing as a New Hierarchical Access Structure. | 1 | 0.36 | 2015 |
Extended results on privacy against coalitions of users in user-private information retrieval protocols | 1 | 0.41 | 2015 |
Linear approaches to resilient aggregation in sensor networks. | 2 | 0.37 | 2015 |
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families | 7 | 0.78 | 2015 |
Guest Editorial: Special Issue in Honor of Scott A. Vanstone | 0 | 0.34 | 2015 |
A tight bound on the size of certain separating hash families | 1 | 0.37 | 2015 |
Resilient Aggregation in Simple Linear Sensor Networks. | 0 | 0.34 | 2014 |
Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing | 7 | 0.48 | 2014 |
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs. | 1 | 0.36 | 2014 |
Is Extracting Data The Same As Possessing Data? | 0 | 0.34 | 2013 |
Practical approaches to varying network size in combinatorial key predistribution schemes. | 1 | 0.35 | 2013 |
On dealer-free dynamic threshold schemes. | 6 | 0.53 | 2013 |
Constructions for retransmission permutation arrays | 0 | 0.34 | 2012 |
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes | 3 | 0.44 | 2012 |
Social secret sharing in cloud computing using a new trust function | 8 | 0.59 | 2012 |
Socio-Rational Secret Sharing as a New Direction in Rational Cryptography. | 5 | 0.40 | 2012 |
Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes | 14 | 0.70 | 2011 |
Unconditionally secure signature schemes revisited | 8 | 0.74 | 2011 |
Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski. | 0 | 0.34 | 2011 |
Honeycomb arrays | 0 | 0.34 | 2010 |
Practical unconditionally secure two-channel message authentication | 5 | 0.47 | 2010 |
Brief announcement: secret sharing based on the social behaviors of players | 3 | 0.38 | 2010 |
Dealer-Free Dynamic Secret Sharing Schemes with Unconditional Security. | 0 | 0.34 | 2009 |
The effectiveness of receipt-based attacks on ThreeBallot | 12 | 0.69 | 2009 |
A Highly Scalable RFID Authentication Protocol | 5 | 0.44 | 2009 |
Anonymity in Shared Symmetric Key Primitives. | 2 | 0.58 | 2009 |
Unconditionally secure social secret sharing scheme | 21 | 1.17 | 2009 |
A critical analysis and improvement of advanced access content system drive-host authentication | 0 | 0.34 | 2009 |
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks | 3 | 0.38 | 2009 |
Group testing and batch verification | 14 | 0.63 | 2009 |
Two Attacks On A Sensor Network Key Distribution Scheme Of Cheng And Agrawal | 7 | 0.52 | 2008 |
How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG. | 0 | 0.34 | 2008 |
A Critical Analysis and Improvement of AACS Drive-Host Authentication | 1 | 0.38 | 2008 |
Combinatorial Designs: Constructions and Analysis | 72 | 6.00 | 2008 |