Now showing items 1-13 of 13

    • Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms 

      Kaya, Kamer; Uçar, B.; Aykanat, Cevdet (Springer, Berlin, Heidelberg, 2008)
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and one or more file repositories. The application consists of a large number of file-sharing, otherwise ...
    • Capture resilient ElGamal signature protocols 

      Acan, Hüseyin; Kaya, Kamer; Selçuk, Ali Aydın (Springer, 2006-11)
      One of the fundamental problems of public key cryptography is protecting the private key. Private keys are too long to be remembered by the user, and storing them in the device which performs the private key operation is ...
    • Exact algorithms for a task assignment problem 

      Kaya, Kamer; Uçar, B. (World Scientific Publishing Company, 2009)
      We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution ...
    • Foreword: 1st International Workshop on High Performance Computing for Big Data 

      Kaya, Kamer; Gedik, Buğra; Çatalyürek, Ümit V. (IEEE, 2014-09)
      The 1st International Workshop on High Performance Computing for Big Data (HPC4BD) is held on September 10, 2014 in concordance with 43rd International Conference on Parallel Processing (ICPP-2014). The workshop aimed to ...
    • Generalized ID-based blind signatures from bilinear pairings 

      Kalkan, Said; Kaya, Kamer; Selçuk, Ali Aydın (IEEE, 2008-10)
      Blind signature schemes provide the feature that a user is able to get a signature without giving the actual message to the signer. Recently a number of ID-based blind signatures have been proposed. In this paper, we ...
    • Generalized ID-based ElGamal signatures 

      Kalkan, Said; Kaya, Kamer; Selçuk, Ali Aydın (IEEE, 2007-11)
      ID-based cryptography has been a very active area of research in cryptography since bilinear pairings were introduced as a cryptographic tool, and there have been many proposals for ID-based signatures recently. In this ...
    • Practical threshold signatures with linear secret sharing schemes 

      Bozkurt, İlker Nadi; Kaya, Kamer; Selçuk, Ali Aydın (Springer, 2009-06)
      Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating ...
    • Robust threshold schemes based on the Chinese remainder theorem 

      Kaya, Kamer; Selçuk, Ali Aydın (Springer, 2008-06)
      Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the ...
    • Threshold broadcast encryption with reduced complexity 

      Kaşkaloǧlu, K.; Kaya, Kamer; Selçuk, Ali Aydın (IEEE, 2007-11)
      Threshold Broadcast Encryption (TBE) is a promising extension of threshold cryptography with its advantages over traditional threshold cryptosystems, such as eliminating the need of a trusted party, the ability of setting ...
    • Threshold cryptography based on asmuth-bloom secret sharing 

      Kaya, Kamer; Selçuk, Ali Aydın; Tezcan, Zahir (Springer, 2006-11)
      In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal ...
    • Threshold cryptography with Chinese remainder theorem 

      Kaya, Kamer (Bilkent University, 2009)
      Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements ...
    • A verifiable secret sharing scheme based on the chinese remainder theorem 

      Kaya, Kamer; Selçuk, Ali Aydın (Springer, 2008-12)
      In this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed earlier are not secure by an attack where the dealer ...