• Publications
  • Influence
A Certificate-Based Signature Scheme
In this paper, we propose the security notion of certificate-based signature that uses the same parameters and certificate revocation strategy as the encryption scheme presented at Eurocrypt 2003 byExpand
  • 106
  • 14
Forward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates
The recently proposed file-injection type attacks are highlighting the importance of forward security in dynamic searchable symmetric encryption (DSSE). Forward security enables to thwart thoseExpand
  • 46
  • 4
Is it possible to have CBE from CL-PKE?
Recently, Al-Riyami and Paterson proposed a generic conversion from CL-PKE (Certificateless Public Key Encryption) to CBE (Certificate Based Encryption) and claimed that the derived CBE scheme isExpand
  • 36
  • 3
A Simple Variant of the Merkle-Damgård Scheme with a Permutation
We propose a new composition scheme for hash functions. It is a variant of the Merkle-Damgard construction with a permutation applied right before the processing of the last message block. We analyzeExpand
  • 56
  • 2
Authenticated Key Exchange Secure under the Computational Diffie-Hellman Assumption
In this paper, we present a new authenticated key exchange(AKE) protocol and prove its security under the random oracle assumption and the computational Diffie-Hellman(CDH) assumption. In theExpand
  • 46
  • 2
Efficient Delegation of Pairing Computation
Pairing computation requires a lot of efforts for portable small devices such as smart cards. It was first considered concretely by Chevallier-Mames et al. that the cards delegate computation ofExpand
  • 37
  • 2
A Simple Variant of the Merkle–Damgård Scheme with a Permutation
We propose a new composition scheme for hash functions. It is a variant of the Merkle–Damgård construction with a permutation applied right before the processing of the last message block. We analyzeExpand
  • 30
  • 2
Cryptanalysis of the Public-Key Encryption Based on Braid Groups
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By this method, we showExpand
  • 45
  • 2
Improved Impossible Differential Attacks on Large-Block Rijndael
In this paper, we present some improved impossible differential attacks on large-block Rijndael whose block sizes are larger than 128 bits. First of all, we present some important observations whichExpand
  • 7
  • 2
A New Forward Secure Signature Scheme
In this paper, we present two forward secure signature schemes based on gap DiffieHellman groups and prove these schemes to be secure in the sense of slightly stronger security notion than that byExpand
  • 34
  • 1