Simon R. Blackburn

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 25

Top Venues

CoRR

IEEE Trans. Inf. Theory

IACR Cryptol. ePrint Arch.

ISIT

Publications

Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson
Constructions and Bounds for Codes With Restricted Overlaps. IEEE Trans. Inf. Theory 70 (4) (2024)
Simon R. Blackburn
Permutations that separate close elements. J. Comb. Theory, Ser. A 196 (2023)
Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson
Constructions and bounds for codes with restricted overlaps. CoRR (2022)
Simon R. Blackburn, Jessica Claridge
The capacity of a finite field matrix channel. CoRR (2022)
Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson
PIR Schemes With Small Download Complexity and Low Storage Requirements. IEEE Trans. Inf. Theory 66 (1) (2020)
Simon R. Blackburn, Tuvi Etzion
PIR Array Codes With Optimal Virtual Server Rate. IEEE Trans. Inf. Theory 65 (10) (2019)
Simon R. Blackburn, Jessica Claridge
Finite-Field Matrix Channels for Network Coding. IEEE Trans. Inf. Theory 65 (3) (2019)
Simon R. Blackburn, Cheyne Homberger, Peter Winkler
The minimum Manhattan distance and minimum jump of permutations. J. Comb. Theory, Ser. A 161 (2019)
Simon R. Blackburn
Inglenook Shunting Puzzles. Electron. J. Comb. 26 (2) (2019)
Ward Beullens, Simon R. Blackburn
Practical attacks against the Walnut digital signature scheme. IACR Cryptol. ePrint Arch. 2018 (2018)
Simon R. Blackburn
Inglenook Shunting Puzzles. CoRR (2018)
Ward Beullens, Simon R. Blackburn
Practical Attacks Against the Walnut Digital Signature Scheme. ASIACRYPT (1) (2018)
Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal, Leo Storme, Ángeles Vázquez-Castro, Alfred Wassermann
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86 (2) (2018)
Simon R. Blackburn, Tuvi Etzion
PIR array codes with optimal PIR rates. ISIT (2017)
Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson
PIR schemes with small download complexity and low storage requirements. ISIT (2017)
Simon R. Blackburn, Tuvi Etzion
PIR Array Codes with Optimal PIR Rates. CoRR (2016)
Simon R. Blackburn, Tuvi Etzion
PIR Array Codes with Optimal PIR Rate. CoRR (2016)
Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban
A Practical Cryptanalysis of the Algebraic Eraser. CRYPTO (1) (2016)
Simon R. Blackburn, Jessica Claridge
Finite field matrix channels for network coding. CoRR (2016)
Simon R. Blackburn, Matthew J. B. Robshaw
On the Security of the Algebraic Eraser Tag Authentication Protocol. IACR Cryptol. ePrint Arch. 2016 (2016)
Simon R. Blackburn, Matthew J. B. Robshaw
On the security of the Algebraic Eraser tag authentication protocol. CoRR (2016)
Simon R. Blackburn
Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch. IEEE Trans. Inf. Theory 62 (3) (2016)
Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson
PIR schemes with small download complexity and low storage requirements. CoRR (2016)
Simon R. Blackburn, Matthew J. B. Robshaw
On the Security of the Algebraic Eraser Tag Authentication Protocol. ACNS (2016)
Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn
Pearson Codes. IEEE Trans. Inf. Theory 62 (1) (2016)
Simon R. Blackburn
Probabilistic existence results for separable codes. CoRR (2015)
Simon R. Blackburn
Non-Overlapping Codes. IEEE Trans. Inf. Theory 61 (9) (2015)
Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban
A Practical Cryptanalysis of the Algebraic Eraser. IACR Cryptol. ePrint Arch. 2015 (2015)
Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn
Pearson codes. CoRR (2015)
Simon R. Blackburn
Probabilistic Existence Results for Separable Codes. IEEE Trans. Inf. Theory 61 (11) (2015)
Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban
A Practical Cryptanalysis of the Algebraic Eraser. CoRR (2015)
Simon R. Blackburn
Maximum likelihood decoding for multilevel channels with gain and offset mismatch. CoRR (2015)
Simon R. Blackburn, Thomas A. McCourt
Triangulations of the sphere, bitrades and abelian groups. Comb. 34 (5) (2014)
Simon R. Blackburn, Sam Scott
The discrete logarithm problem for exponents of bounded height. LMS J. Comput. Math. 17 (Theory) (2014)
Simon R. Blackburn
Enumerating Finite Racks, Quandles and Kei. Electron. J. Comb. 20 (3) (2013)
Simon R. Blackburn
Non-overlapping codes CoRR (2013)
Simon R. Blackburn, Tuvi Etzion
The Asymptotic Behavior of Grassmannian Codes. IEEE Trans. Inf. Theory 58 (10) (2012)
Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay
On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptogr. 64 (1-2) (2012)
Simon R. Blackburn
The existence of k-radius sequences. J. Comb. Theory, Ser. A 119 (1) (2012)
Simon R. Blackburn, John R. Britnell, Mark Wildon
The probability that a pair of elements of a finite group are conjugate. J. Lond. Math. Soc. 86 (3) (2012)
Simon R. Blackburn, Carlos Cid, Ciaran Mullan
Cryptanalysis of three matrix-based key establishment protocols. J. Math. Cryptol. 5 (2) (2012)
Simon R. Blackburn, James F. McKee
Constructing k-radius sequences. Math. Comput. 81 (280) (2012)
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves CoRR (2011)
Simon R. Blackburn, Carlos Cid, Ciaran Mullan
Cryptanalysis of three matrix-based key establishment protocols. IACR Cryptol. ePrint Arch. 2011 (2011)
Simon R. Blackburn, Tuvi Etzion
The asymptotic behavior of Grassmannian codes CoRR (2011)
Simon R. Blackburn, Carlos Cid, Ciaran Mullan
Cryptanalysis of three matrix-based key establishment protocols CoRR (2011)
Simon R. Blackburn, Alina Ostafe, Igor E. Shparlinski
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. IACR Cryptol. ePrint Arch. 2011 (2011)
Simon R. Blackburn
The existence of k-radius sequences CoRR (2011)
Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Trans. Inf. Theory 56 (8) (2010)
Simon R. Blackburn
The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem. J. Math. Cryptol. 4 (2) (2010)
Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay
On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions. IACR Cryptol. ePrint Arch. 2010 (2010)
Simon R. Blackburn
The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin-Abu cryptosystem. IACR Cryptol. ePrint Arch. 2010 (2010)
Simon R. Blackburn, Anastasia Panoui, Maura B. Paterson, Douglas R. Stinson
Honeycomb Arrays. Electron. J. Comb. 17 (1) (2010)
Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes. IEEE Trans. Inf. Theory 56 (3) (2010)
Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng
Traceability codes. J. Comb. Theory, Ser. A 117 (8) (2010)
Simon R. Blackburn
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem. J. Math. Cryptol. 3 (3) (2009)
Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson
Putting Dots in Triangles CoRR (2009)
Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng
Traceability Codes. IACR Cryptol. ePrint Arch. 2009 (2009)
Simon R. Blackburn, Stefanie Gerke
Connectivity of the uniform random intersection graph. Discret. Math. 309 (16) (2009)
Simon R. Blackburn, Carlos Cid, Ciaran Mullan
Public Key Cryptosystem. IACR Cryptol. ePrint Arch. 2009 (2009)
Simon R. Blackburn, Carlos Cid, Ciaran Mullan
Cryptanalysis of the MST 3 public key cryptosystem. J. Math. Cryptol. 3 (4) (2009)
Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. IACR Cryptol. ePrint Arch. 2009 (2009)
Simon R. Blackburn
Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem. IACR Cryptol. ePrint Arch. 2008 (2008)
Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng
Prolific Codes with the Identifiable Parent Property. SIAM J. Discret. Math. 22 (4) (2008)
Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson
Key Refreshing in Wireless Sensor Networks. ICITS (2008)
Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. ICITS (2008)
Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha
A bound on the size of separating hash families. J. Comb. Theory, Ser. A 115 (7) (2008)
Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha
A Bound on the Size of Separating Hash Families. IACR Cryptol. ePrint Arch. 2007 (2007)
Simon R. Blackburn, Igor E. Shparlinski
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discret. Math. 307 (9-10) (2007)
Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng
Prolific Codes with the Identifiable Parent Property. IACR Cryptol. ePrint Arch. 2007 (2007)
Su-Jeong Choi, Simon R. Blackburn, Peter R. Wild
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. J. Math. Cryptol. 1 (4) (2007)
Simon R. Blackburn, Igor E. Shparlinski
Character sums and nonlinear recurrence sequences. Discret. Math. 306 (12) (2006)
Su-Jeong Choi, Simon R. Blackburn, Peter R. Wild
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. IACR Cryptol. ePrint Arch. 2006 (2006)
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61 (2) (2006)
Simon R. Blackburn
Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. IEEE Trans. Inf. Theory 52 (7) (2006)
Simon R. Blackburn
Sets of permutations that generate the symmetric group pairwise. J. Comb. Theory, Ser. A 113 (7) (2006)
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
Predicting nonlinear pseudorandom number generators. Math. Comput. 74 (251) (2005)
Simon R. Blackburn, Kenneth G. Paterson
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. FSE (2004)
Simon R. Blackburn
Frameproof Codes. SIAM J. Discret. Math. 16 (3) (2003)
Simon R. Blackburn, Andrew J. Spencer
Products of subsets in an abelian group. J. Comb. Theory, Ser. A 103 (1) (2003)
Simon R. Blackburn
Perfect Hash Families with Few Functions. IACR Cryptol. ePrint Arch. 2003 (2003)
Simon R. Blackburn, Carlos Cid, Steven D. Galbraith
Cryptanalysis of a Cryptosystem based on Drinfeld modules. IACR Cryptol. ePrint Arch. 2003 (2003)
Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski
Predicting the Inversive Generator. IMACC (2003)
Simon R. Blackburn, Kenneth G. Paterson
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. IACR Cryptol. ePrint Arch. 2003 (2003)
Simon R. Blackburn
An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A 102 (1) (2003)
Simon R. Blackburn
An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. IACR Cryptol. ePrint Arch. 2002 (2002)
Simon R. Blackburn, Edlyn Teske
Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS (2000)
Simon R. Blackburn
Perfect Hash Families: Probabilistic Methods and Explicit Constructions. J. Comb. Theory, Ser. A 92 (1) (2000)
Simon R. Blackburn
The linear complexity of the self-shrinking generator. IEEE Trans. Inf. Theory 45 (6) (1999)
Simon R. Blackburn, Steven D. Galbraith
Cryptanalysis of Two Cryptosystems Based on Group Actions. ASIACRYPT (1999)
Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith
Weaknesses in Shared RSA Key Generation Protocols. IMACC (1999)
Simon R. Blackburn, Peter R. Wild
Optimal Linear Perfect Hash Families. J. Comb. Theory, Ser. A 83 (2) (1998)
Simon R. Blackburn, Sean Murphy, Kenneth G. Paterson
Comments on "Theory and Applications of Cellular Automata in Cryptography". IEEE Trans. Computers 46 (5) (1997)
Simon R. Blackburn
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. IEEE Trans. Inf. Theory 43 (2) (1997)
Simon R. Blackburn
A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation. Des. Codes Cryptogr. 11 (3) (1997)
Simon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. J. Comb. Theory, Ser. A 76 (1) (1996)
Simon R. Blackburn
A Note on Sequences with the Shift and Add Property. Des. Codes Cryptogr. 9 (3) (1996)
Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild
Efficient Multiplicative Sharing Schemes. EUROCRYPT (1996)
Simon R. Blackburn, William G. Chambers
Some remarks on an algorithm of Fitzpatrick. IEEE Trans. Inf. Theory 42 (4) (1996)
Simon R. Blackburn
Node Bisectors of Cayley Graphs. Math. Syst. Theory 29 (6) (1996)

Simon R. Blackburn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Simon R. Blackburn