 | 2009 |
|---|
| 61 |       | Kenneth G. Paterson,
Sriramkrishnan Srinivasan:
Building Key-Private Public-Key Encryption Schemes.
ACISP 2009: 276-292 |
| 60 | | Martin R. Albrecht,
Kenneth G. Paterson,
Gaven J. Watson:
Plaintext Recovery Attacks against SSH.
IEEE Symposium on Security and Privacy 2009: 16-26 |
| 59 | | Kenneth G. Paterson,
Sriramkrishnan Srinivasan:
On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups.
Des. Codes Cryptography 52(2): 219-241 (2009) |
| 58 | | Colin Boyd,
Yvonne Cliff,
Juan Manuel González Nieto,
Kenneth G. Paterson:
One-round key exchange in the standard model.
IJACT 1(3): 181-199 (2009) |
| 2008 |
|---|
| 57 |  | Steven D. Galbraith,
Kenneth G. Paterson:
Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings
Springer 2008 |
| 56 | | Colin Boyd,
Yvonne Cliff,
Juan Manuel González Nieto,
Kenneth G. Paterson:
Efficient One-Round Key Exchange in the Standard Model.
ACISP 2008: 69-83 |
| 55 | | Mudhakar Srivatsa,
Shane Balfe,
Kenneth G. Paterson,
Pankaj Rohatgi:
Trust management for secure information flows.
ACM Conference on Computer and Communications Security 2008: 175-188 |
| 54 | | Shane Balfe,
Kenneth G. Paterson:
Augmenting Internet-Based Card Not Present Transactions with Trusted Computing (Extended Abstract).
Financial Cryptography 2008: 171-175 |
| 53 | | Kenneth G. Paterson,
Sriramkrishnan Srinivasan:
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities.
Pairing 2008: 354-375 |
| 52 | | Jacob C. N. Schuldt,
Kanta Matsuura,
Kenneth G. Paterson:
Proxy Signatures Secure Against Proxy Key Exposure.
Public Key Cryptography 2008: 141-161 |
| 51 | | Alexander W. Dent,
Benoît Libert,
Kenneth G. Paterson:
Certificateless Encryption Schemes Strongly Secure in the Standard Model.
Public Key Cryptography 2008: 344-359 |
| 50 | | Kenneth G. Paterson,
Gaven J. Watson:
Immunising CBC Mode Against Padding Oracle Attacks: A Formal Security Treatment.
SCN 2008: 340-357 |
| 49 | | Shane Balfe,
Kenneth G. Paterson:
e-EMV: emulating EMV for internet payments with trusted computing technologies.
STC 2008: 81-92 |
| 48 | | Steven D. Galbraith,
Kenneth G. Paterson,
Nigel P. Smart:
Pairings for cryptographers.
Discrete Applied Mathematics 156(16): 3113-3121 (2008) |
| 47 | | Shane Balfe,
Eimear Gallery,
Chris J. Mitchell,
Kenneth G. Paterson:
Challenges for Trusted Computing.
IEEE Security & Privacy 6(6): 60-66 (2008) |
| 2007 |
|---|
| 46 | | Jean Paul Degabriele,
Kenneth G. Paterson:
Attacking the IPsec Standards in Encryption-only Configurations.
IEEE Symposium on Security and Privacy 2007: 335-349 |
| 45 | | Hoon Wei Lim,
Kenneth G. Paterson:
Multi-key Hierarchical Identity-Based Signatures.
IMA Int. Conf. 2007: 384-402 |
| 44 | | Jason Crampton,
Hoon Wei Lim,
Kenneth G. Paterson:
What can identity-based cryptography offer to web services?
SWS 2007: 26-36 |
| 2006 |
|---|
| 43 | | Kenneth G. Paterson,
Jacob C. N. Schuldt:
Efficient Identity-Based Signatures Secure in the Standard Model.
ACISP 2006: 207-222 |
| 42 | | Kenneth G. Paterson,
Arnold K. L. Yau:
Cryptography in Theory and Practice: The Case of Encryption in IPsec.
EUROCRYPT 2006: 12-29 |
| 41 | | Kenneth G. Paterson,
Arnold K. L. Yau:
Lost in translation: theory and practice in cryptography.
IEEE Security & Privacy 4(3): 69-72 (2006) |
| 2005 |
|---|
| 40 | | Caroline Kudla,
Kenneth G. Paterson:
Modular Security Proofs for Key Agreement Protocols.
ASIACRYPT 2005: 549-565 |
| 39 | | Arnold K. L. Yau,
Kenneth G. Paterson,
Chris J. Mitchell:
Padding Oracle Attacks on CBC-Mode Encryption with Secret and Random IVs.
FSE 2005: 299-319 |
| 38 | | Caroline Kudla,
Kenneth G. Paterson:
Non-interactive Designated Verifier Proofs and Undeniable Signatures.
IMA Int. Conf. 2005: 136-154 |
| 37 | | Shane Balfe,
Amit D. Lakhani,
Kenneth G. Paterson:
Trusted Computing: Providing Security for Peer-to-Peer Networks.
Peer-to-Peer Computing 2005: 117-124 |
| 36 | | Sattam S. Al-Riyami,
Kenneth G. Paterson:
CBE from CL-PKE: A Generic Construction and Efficient Schemes.
Public Key Cryptography 2005: 398-415 |
| 35 | | Hoon Wei Lim,
Kenneth G. Paterson:
Identity-Based Cryptography for Grid Security.
e-Science 2005: 395-404 |
| 34 | | Tuvi Etzion,
Kenneth G. Paterson:
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays.
IEEE Transactions on Information Theory 51(9): 3186-3199 (2005) |
| 2004 |
|---|
| 33 | | Colin Boyd,
Wenbo Mao,
Kenneth G. Paterson:
Key Agreement Using Statically Keyed Authenticators.
ACNS 2004: 248-262 |
| 32 | | Kenneth G. Paterson,
Arnold K. L. Yau:
Padding Oracle Attacks on the ISO CBC Mode Encryption Standard.
CT-RSA 2004: 305-323 |
| 31 | | Liqun Chen,
Caroline Kudla,
Kenneth G. Paterson:
Concurrent Signatures.
EUROCRYPT 2004: 287-305 |
| 30 | | Simon R. Blackburn,
Kenneth G. Paterson:
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan.
FSE 2004: 446-453 |
| 2003 |
|---|
| 29 | | Kenneth G. Paterson:
Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings
Springer 2003 |
| 28 | | Sattam S. Al-Riyami,
Kenneth G. Paterson:
Certificateless Public Key Cryptography.
ASIACRYPT 2003: 452-473 |
| 27 | | Sattam S. Al-Riyami,
Kenneth G. Paterson:
Tripartite Authenticated Key Agreement Protocols from Pairings.
IMA Int. Conf. 2003: 332-359 |
| 26 | | Colin Boyd,
Wenbo Mao,
Kenneth G. Paterson:
Deniable Authenticated Key Establishment for Internet Protocols.
Security Protocols Workshop 2003: 255-271 |
| 25 | | Alan G. B. Lauder,
Kenneth G. Paterson:
Computing the error linear complexity spectrum of a binary sequence of period 2n.
IEEE Transactions on Information Theory 49(1): 273-280 (2003) |
| 2002 |
|---|
| 24 | | Steven D. Galbraith,
Wenbo Mao,
Kenneth G. Paterson:
RSA-Based Undeniable Signatures for General Moduli.
CT-RSA 2002: 200-217 |
| 2001 |
|---|
| 23 | | Alain P. Hiltgen,
Kenneth G. Paterson:
Single-track circuit codes.
IEEE Transactions on Information Theory 47(6): 2587-2595 (2001) |
| 2000 |
|---|
| 22 | | Kenneth G. Paterson:
Generalized Reed-Muller codes and power control in OFDM modulation.
IEEE Transactions on Information Theory 46(1): 104-120 (2000) |
| 21 | | Kenneth G. Paterson,
Vahid Tarokh:
On the existence and construction of good codes with low peak-to-average power ratios.
IEEE Transactions on Information Theory 46(6): 1974-1987 (2000) |
| 1999 |
|---|
| 20 | | Kenneth G. Paterson:
Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers.
FSE 1999: 201-214 |
| 19 | | Kenneth G. Paterson:
Applications of Exponential Sums in Communications Theory.
IMA Int. Conf. 1999: 1-24 |
| 1998 |
|---|
| 18 | | Kenneth G. Paterson:
Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering.
Des. Codes Cryptography 14(3): 247-259 (1998) |
| 17 | | Kenneth G. Paterson:
Binary Sequence Sets with Favorable Correlations from Difference Sets and MDS Codes.
IEEE Transactions on Information Theory 44(1): 172-180 (1998) |
| 16 | | Kenneth G. Paterson,
Paul J. G. Lothian:
Bounds on Partial Correlations of Sequences.
IEEE Transactions on Information Theory 44(3): 1164-1175 (1998) |
| 15 | | Kenneth G. Paterson,
Jonathan Tuliani:
Some New Circuit Codes.
IEEE Transactions on Information Theory 44(3): 1305-1309 (1998) |
| 14 | | Chris J. Mitchell,
Kenneth G. Paterson:
Perfect Factors from Cyclic Codes and Interleaving.
SIAM J. Discrete Math. 11(2): 241-264 (1998) |
| 1997 |
|---|
| 13 | | 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 |
|---|
| 12 | | Tuvi Etzion,
Kenneth G. Paterson:
Near optimal single-track Gray codes.
IEEE Transactions on Information Theory 42(3): 779-789 (1996) |
| 11 | | Chris J. Mitchell,
Tuvi Etzion,
Kenneth G. Paterson:
A method for constructing decodable de Bruijn sequences.
IEEE Transactions on Information Theory 42(5): 1472-1478 (1996) |
| 10 | | Alain P. Hiltgen,
Kenneth G. Paterson,
M. Brandestini:
Single-track Gray codes.
IEEE Transactions on Information Theory 42(5): 1555-1561 (1996) |
| 9 | | Kenneth G. Paterson:
New Classes of Perfect Maps I.
J. Comb. Theory, Ser. A 73(2): 302-334 (1996) |
| 8 | | Kenneth G. Paterson:
New Classes of Perfect Maps II.
J. Comb. Theory, Ser. A 73(2): 335-345 (1996) |
| 7 | | Simon 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) |
| 6 | | Glenn Hurlbert,
Chris J. Mitchell,
Kenneth G. Paterson:
On the Existence of de Bruijn Tori with Two by Two Windows.
J. Comb. Theory, Ser. A 76(2): 213-230 (1996) |
| 1995 |
|---|
| 5 | | Andreas Fuchsberger,
Dieter Gollmann,
Paul J. G. Lothian,
Kenneth G. Paterson,
Abraham Sidiropoulos:
Public-key Cryptography on Smart Cards.
Cryptography: Policy and Algorithms 1995: 250-269 |
| 4 | | Kenneth G. Paterson:
Perfect Factors in the de Bruijn Graph.
Des. Codes Cryptography 5(2): 115-138 (1995) |
| 1994 |
|---|
| 3 | | Chris J. Mitchell,
Kenneth G. Paterson:
Decoding Perfect Maps.
Des. Codes Cryptography 4(1): 11-30 (1994) |
| 2 | | Kenneth G. Paterson:
Perfect maps.
IEEE Transactions on Information Theory 40(3): 743-753 (1994) |
| 1 | | Sean Murphy,
Kenneth G. Paterson,
Peter R. Wild:
A Weak Cipher that Generates the Symmetric Group.
J. Cryptology 7(1): 61-65 (1994) |
