The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kenneth G. Paterson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kenneth G. Paterson, Jacob C. N. Schuldt
    Efficient Identity-Based Signatures Secure in the Standard Model. [Citation Graph (0, 0)][DBLP]
    ACISP, 2006, pp:207-222 [Conf]
  2. Colin Boyd, Wenbo Mao, Kenneth G. Paterson
    Key Agreement Using Statically Keyed Authenticators. [Citation Graph (0, 0)][DBLP]
    ACNS, 2004, pp:248-262 [Conf]
  3. Sattam S. Al-Riyami, Kenneth G. Paterson
    Certificateless Public Key Cryptography. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2003, pp:452-473 [Conf]
  4. Caroline Kudla, Kenneth G. Paterson
    Modular Security Proofs for Key Agreement Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:549-565 [Conf]
  5. Andreas Fuchsberger, Dieter Gollmann, Paul J. G. Lothian, Kenneth G. Paterson, Abraham Sidiropoulos
    Public-key Cryptography on Smart Cards. [Citation Graph (0, 0)][DBLP]
    Cryptography: Policy and Algorithms, 1995, pp:250-269 [Conf]
  6. Kenneth G. Paterson, Arnold K. L. Yau
    Padding Oracle Attacks on the ISO CBC Mode Encryption Standard. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2004, pp:305-323 [Conf]
  7. Steven D. Galbraith, Wenbo Mao, Kenneth G. Paterson
    RSA-Based Undeniable Signatures for General Moduli. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2002, pp:200-217 [Conf]
  8. Hoon Wei Lim, Kenneth G. Paterson
    Identity-Based Cryptography for Grid Security. [Citation Graph (0, 0)][DBLP]
    e-Science, 2005, pp:395-404 [Conf]
  9. Liqun Chen, Caroline Kudla, Kenneth G. Paterson
    Concurrent Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:287-305 [Conf]
  10. Kenneth G. Paterson, Arnold K. L. Yau
    Cryptography in Theory and Practice: The Case of Encryption in IPsec. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:12-29 [Conf]
  11. Simon R. Blackburn, Kenneth G. Paterson
    Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan. [Citation Graph (0, 0)][DBLP]
    FSE, 2004, pp:446-453 [Conf]
  12. Kenneth G. Paterson
    Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1999, pp:201-214 [Conf]
  13. Arnold K. L. Yau, Kenneth G. Paterson, Chris J. Mitchell
    Padding Oracle Attacks on CBC-Mode Encryption with Secret and Random IVs. [Citation Graph (0, 0)][DBLP]
    FSE, 2005, pp:299-319 [Conf]
  14. Sattam S. Al-Riyami, Kenneth G. Paterson
    Tripartite Authenticated Key Agreement Protocols from Pairings. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:332-359 [Conf]
  15. Caroline Kudla, Kenneth G. Paterson
    Non-interactive Designated Verifier Proofs and Undeniable Signatures. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2005, pp:136-154 [Conf]
  16. Kenneth G. Paterson
    Applications of Exponential Sums in Communications Theory. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 1999, pp:1-24 [Conf]
  17. Shane Balfe, Amit D. Lakhani, Kenneth G. Paterson
    Trusted Computing: Providing Security for Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Computing, 2005, pp:117-124 [Conf]
  18. Sattam S. Al-Riyami, Kenneth G. Paterson
    CBE from CL-PKE: A Generic Construction and Efficient Schemes. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2005, pp:398-415 [Conf]
  19. Jean Paul Degabriele, Kenneth G. Paterson
    Attacking the IPsec Standards in Encryption-only Configurations. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2007, pp:335-349 [Conf]
  20. Colin Boyd, Wenbo Mao, Kenneth G. Paterson
    Deniable Authenticated Key Establishment for Internet Protocols. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2003, pp:255-271 [Conf]
  21. Chris J. Mitchell, Kenneth G. Paterson
    Decoding Perfect Maps. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:1, pp:11-30 [Journal]
  22. Kenneth G. Paterson
    Perfect Factors in the de Bruijn Graph. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:5, n:2, pp:115-138 [Journal]
  23. Kenneth G. Paterson
    Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:3, pp:247-259 [Journal]
  24. Simon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson
    Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:55-82 [Journal]
  25. Glenn Hurlbert, Chris J. Mitchell, Kenneth G. Paterson
    On the Existence of de Bruijn Tori with Two by Two Windows. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:2, pp:213-230 [Journal]
  26. Kenneth G. Paterson
    New Classes of Perfect Maps I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:302-334 [Journal]
  27. Kenneth G. Paterson
    New Classes of Perfect Maps II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:335-345 [Journal]
  28. Sean Murphy, Kenneth G. Paterson, Peter R. Wild
    A Weak Cipher that Generates the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:1, pp:61-65 [Journal]
  29. Chris J. Mitchell, Kenneth G. Paterson
    Perfect Factors from Cyclic Codes and Interleaving. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:2, pp:241-264 [Journal]
  30. Simon R. Blackburn, Sean Murphy, Kenneth G. Paterson
    Comments on "Theory and Applications of Cellular Automata in Cryptography". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:5, pp:637-638 [Journal]
  31. Tuvi Etzion, Kenneth G. Paterson
    Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3186-3199 [Journal]
  32. Tuvi Etzion, Kenneth G. Paterson
    Near optimal single-track Gray codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:779-789 [Journal]
  33. Alain P. Hiltgen, Kenneth G. Paterson
    Single-track circuit codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2587-2595 [Journal]
  34. Alain P. Hiltgen, Kenneth G. Paterson, M. Brandestini
    Single-track Gray codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1555-1561 [Journal]
  35. Alan G. B. Lauder, Kenneth G. Paterson
    Computing the error linear complexity spectrum of a binary sequence of period 2n. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:273-280 [Journal]
  36. Chris J. Mitchell, Tuvi Etzion, Kenneth G. Paterson
    A method for constructing decodable de Bruijn sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1472-1478 [Journal]
  37. Kenneth G. Paterson
    Generalized Reed-Muller codes and power control in OFDM modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:104-120 [Journal]
  38. Kenneth G. Paterson
    Perfect maps. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:743-753 [Journal]
  39. Kenneth G. Paterson
    Binary Sequence Sets with Favorable Correlations from Difference Sets and MDS Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:172-180 [Journal]
  40. Kenneth G. Paterson, Paul J. G. Lothian
    Bounds on Partial Correlations of Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1164-1175 [Journal]
  41. Kenneth G. Paterson, Vahid Tarokh
    On the existence and construction of good codes with low peak-to-average power ratios. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:1974-1987 [Journal]
  42. Kenneth G. Paterson, Jonathan Tuliani
    Some New Circuit Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1305-1309 [Journal]

  43. Efficient One-Round Key Exchange in the Standard Model. [Citation Graph (, )][DBLP]


  44. Building Key-Private Public-Key Encryption Schemes. [Citation Graph (, )][DBLP]


  45. Trust management for secure information flows. [Citation Graph (, )][DBLP]


  46. e-EMV: emulating EMV for internet payments with trusted computing technologies. [Citation Graph (, )][DBLP]


  47. Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR. [Citation Graph (, )][DBLP]


  48. Augmenting Internet-Based Card Not Present Transactions with Trusted Computing (Extended Abstract). [Citation Graph (, )][DBLP]


  49. Multi-key Hierarchical Identity-Based Signatures. [Citation Graph (, )][DBLP]


  50. Proxy Signatures Secure Against Proxy Key Exposure. [Citation Graph (, )][DBLP]


  51. Certificateless Encryption Schemes Strongly Secure in the Standard Model. [Citation Graph (, )][DBLP]


  52. Time-Specific Encryption. [Citation Graph (, )][DBLP]


  53. Immunising CBC Mode Against Padding Oracle Attacks: A Formal Security Treatment. [Citation Graph (, )][DBLP]


  54. Plaintext Recovery Attacks against SSH. [Citation Graph (, )][DBLP]


  55. Secret Public Key Protocols Revisited. [Citation Graph (, )][DBLP]


  56. Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities. [Citation Graph (, )][DBLP]


  57. What can identity-based cryptography offer to web services? [Citation Graph (, )][DBLP]


  58. Pairings for cryptographers. [Citation Graph (, )][DBLP]


  59. On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002