#### Filter Results:

- Full text PDF available (131)

#### Publication Year

1994

2017

- This year (4)
- Last 5 years (50)
- Last 10 years (92)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sattam S. Al-Riyami, Kenneth G. Paterson
- IACR Cryptology ePrint Archive
- 2003

This paper introduces the concept of certificateless public key cryptography (CL-PKC).<lb>In contrast to traditional public key cryptographic systems, CL-PKC does not require the<lb>use of certificates to guarantee the authenticity of public keys. It does rely on the use<lb>of a trusted third party (TTP) who is in possession of a master key. In these… (More)

- Sattam S. Al-Riyami, Kenneth G. Paterson
- Public Key Cryptography
- 2005

We present a new Certificateless Public Key Encryption (CLPKE) scheme whose security is proven to rest on the hardness of the Bilinear Diffie-Hellman Problem (BDHP) and that is more efficient than the original scheme of Al-Riyami and Paterson. We then give an analysis of Gentry’s Certificate Based Encryption (CBE) concept, repairing a number of problems… (More)

- Kenneth G. Paterson
- IACR Cryptology ePrint Archive
- 2002

- Kenneth G. Paterson, Jacob C. N. Schuldt
- ACISP
- 2006

The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based signatures. This folklore construction method leads to schemes that are somewhat inefficient and leaves open the problem of finding more efficient direct constructions. We present… (More)

- Kenneth G. Paterson
- IEEE Trans. Information Theory
- 2000

Controlling the peak-to-mean envelope power ratio (PMEPR) of Orthogonal Frequency Division Multiplexed (OFDM) transmissions is a notoriously di cult problem, though one which is of vital importance for the practical application of OFDM in low-cost applications. The utility of Golay complementary sequences in solving this problem has been recognised for some… (More)

- Steven D. Galbraith, Kenneth G. Paterson, Nigel P. Smart
- Discrete Applied Mathematics
- 2006

Many research papers in pairing based cryptography treat pairings as a “black box”. These papers build cryptographic schemes making use of various properties of pairings. If this approach is taken, then it is easy for authors to make invalid assumptions concerning the properties of pairings. The cryptographic schemes developed may not be realizable in… (More)

- Nadhem J. AlFardan, Kenneth G. Paterson
- 2013 IEEE Symposium on Security and Privacy
- 2013

The Transport Layer Security (TLS) protocol aims to provide confidentiality and integrity of data in transit across untrusted networks. TLS has become the de facto secure protocol of choice for Internet and mobile applications. DTLS is a variant of TLS that is growing in importance. In this paper, we present distinguishing and plaintext recovery attacks… (More)

- Caroline Kudla, Kenneth G. Paterson
- ASIACRYPT
- 2005

The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular approach to the construction of proofs of security for a large class of key agreement protocols. By following a modular approach to proof construction, we hope to enable simpler and less error-prone analysis and proof generation… (More)

- Nadhem J. AlFardan, Daniel J. Bernstein, Kenneth G. Paterson, Bertram Poettering, Jacob C. N. Schuldt
- USENIX Security Symposium
- 2013

The Transport Layer Security (TLS) protocol aims to provide confidentiality and integrity of data in transit across untrusted networks. TLS has become the de facto protocol standard for secured Internet and mobile applications. TLS supports several symmetric encryption options, including a scheme based on the RC4 stream cipher. In this paper, we present… (More)

- Liqun Chen, Caroline Kudla, Kenneth G. Paterson
- EUROCRYPT
- 2004

We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures are ambiguous with respect to the identity of the signing party until an extra piece of information (the keystone) is released by one of the parties. Upon release of the… (More)