dblp.uni-trier.dewww.uni-trier.de

Simon R. Blackburn

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
29EESimon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson: Key Refreshing in Wireless Sensor Networks. ICITS 2008: 156-170
28EESimon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson: Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. ICITS 2008: 54-69
27EESimon 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): 1246-1256 (2008)
2007
26EESimon R. Blackburn, Igor Shparlinski: Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. Discrete Mathematics 307(9-10): 1218-1219 (2007)
2006
25EESimon R. Blackburn, Igor Shparlinski: Character sums and nonlinear recurrence sequences. Discrete Mathematics 306(12): 1126-1131 (2006)
24EESimon R. Blackburn: Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. IEEE Transactions on Information Theory 52(7): 3305-3309 (2006)
23EESimon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006)
22EESimon R. Blackburn: Sets of permutations that generate the symmetric group pairwise. J. Comb. Theory, Ser. A 113(7): 1572-1581 (2006)
2004
21EESimon R. Blackburn, Kenneth G. Paterson: Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. FSE 2004: 446-453
2003
20EESimon R. Blackburn, Domingo Gomez-Perez, Jaime Gutierrez, Igor Shparlinski: Predicting the Inversive Generator. IMA Int. Conf. 2003: 264-275
19EESimon R. Blackburn: An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A 102(1): 179-185 (2003)
18EESimon R. Blackburn, Andrew J. Spencer: Products of subsets in an abelian group. J. Comb. Theory, Ser. A 103(1): 53-68 (2003)
17EESimon R. Blackburn: Frameproof Codes. SIAM J. Discrete Math. 16(3): 499-510 (2003)
2000
16 Simon R. Blackburn, Edlyn Teske: Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS 2000: 153-168
15EESimon R. Blackburn: Perfect Hash Families: Probabilistic Methods and Explicit Constructions. J. Comb. Theory, Ser. A 92(1): 54-60 (2000)
1999
14 Simon R. Blackburn, Steven D. Galbraith: Cryptanalysis of Two Cryptosystems Based on Group Actions. ASIACRYPT 1999: 52-61
13EESimon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith: Weaknesses in Shared RSA Key Generation Protocols. IMA Int. Conf. 1999: 300-306
12 Simon R. Blackburn: The linear complexity of the self-shrinking generator. IEEE Transactions on Information Theory 45(6): 2073-2077 (1999)
1998
11EESimon R. Blackburn, Peter R. Wild: Optimal Linear Perfect Hash Families. J. Comb. Theory, Ser. A 83(2): 233-250 (1998)
1997
10 Simon R. Blackburn: A Generalization of Rational Interpolation Problem and the Solution of the Welch-Berlekamp Key Equation. Des. Codes Cryptography 11(3): 223-234 (1997)
9 Simon R. Blackburn, Sean Murphy, Kenneth G. Paterson: Comments on "Theory and Applications of Cellular Automata in Cryptography". IEEE Trans. Computers 46(5): 637-638 (1997)
1996
8EESimon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild: Efficient Multiplicative Sharing Schemes. EUROCRYPT 1996: 107-118
7 Simon R. Blackburn: A Note on Sequences with the Shift and Add Property. Des. Codes Cryptography 9(3): 251-256 (1996)
6EESimon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson: Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. J. Comb. Theory, Ser. A 76(1): 55-82 (1996)
5 Simon R. Blackburn: Node Bisectors of Cayley Graphs. Mathematical Systems Theory 29(6): 589-598 (1996)
1995
4 Simon R. Blackburn, Sean Murphy, Jacques Stern: The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings. J. Cryptology 8(3): 157-166 (1995)
1994
3 Ulrich Baum, Simon R. Blackburn: Clock-Controlled Pseudorandom Generators on Finite Groups. FSE 1994: 6-21
2 Simon R. Blackburn: Increasing the Rate of Output of m-Sequences. Inf. Process. Lett. 51(2): 73-77 (1994)
1993
1EESimon R. Blackburn, Sean Murphy, Jacques Stern: Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups. EUROCRYPT 1993: 50-54

Coauthor Index

1Ulrich Baum [3]
2Simon Blake-Wilson [13]
3Mike Burmester [8] [13]
4Yvo Desmedt [8]
5Tuvi Etzion [6] [27] [28]
6Steven D. Galbraith [13] [14]
7Domingo Gomez-Perez [20] [23]
8Jaime Gutierrez [20] [23]
9Keith M. Martin [28] [29]
10Sean Murphy [1] [4] [9]
11Kenneth G. Paterson [6] [9] [21]
12Maura B. Paterson [28] [29]
13Igor Shparlinski [20] [23] [25] [26]
14Andrew J. Spencer [18]
15Jacques Stern [1] [4]
16Douglas R. Stinson [27] [29]
17Edlyn Teske [16]
18Peter R. Wild [8] [11]
19Gregory M. Zaverucha [27]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)