Simon R. Blackburn

International Association for Cryptologic Research

Simon R. Blackburn Search web for home page

1	2005	Asiacrypt	pc
2	2000	Eurocrypt	pc

	year	title	booktitle	pages
1	2010	The Discrete Logarithm Problem Modulo One: Cryptanalysing the Ariffin--Abu cryptosystem	eprint	online
2	2009	Traceability Codes	eprint	online
3	2009	Key Predistribution Techniques for Grid-Based Wireless Sensor Networks	eprint	online
4	2008	Cryptanalysing the Critical Group	eprint	online
5	2007	A Bound on the Size of Separating Hash Families	eprint	online
6	2007	Prolific Codes with the Identifiable Parent Property	eprint	online
7	2006	Cryptanalysis of a homomorphic public-key cryptosystem over a finite group	eprint	online
8	2004	Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan	fse	446-453
9	2003	Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan	eprint	online
10	2003	Cryptanalysis of a Cryptosystem based on Drinfeld modules	eprint	online
11	2003	Perfect Hash Families with Few Functions	eprint	online
12	2002	An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property	eprint	online
13	1999	Cryptanalysis of Two Cryptosystems Based on Group Actions	asiacrypt	52-61
14	1996	Efficient Multiplicative Sharing Schemes	eurocrypt	107-118
15	1995	The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings	jofc	157-166
16	1994	Clock-Controlled Pseudorandom Generators on Finite Groups	fse	6-21
17	1993	Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups	eurocrypt	50-54