| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2008 | Practical Construction and Analysis of Pseudo-Randomness Primitives | jofc | 1-26 |
| 2 | 2004 | New Results on the Hardness of Diffie-Hellman Bits | pkc | online |
| 3 | 2003 | On the Bit Security of NTRUEncrypt | pkc | 62-70 |
| 4 | 2002 | Hidden Number Problem with the Trace and Bit Security of XTR and LUC | crypto | online |
| 5 | 2001 | Practical Construction and Analysis of Pseudo-Randomness Primitives | asiacrypt | 442-459 |
| 6 | 2001 | Complexity Bounds on General Hard-Core Predicates | jofc | 177-195 |
| 7 | 1997 | The Complexity of Computing Hard Core Predicates | crypto | 1-15 |
| 8 | 1996 | All Bits ax+b mod p are Hard (Extended Abstract) | crypto | 114-128 |
| 9 | 1995 | Universal Hash Functions & Hard Core Bits | eurocrypt | 356-366 |
Coauthors of Mats Näslund |