Browsing by Author "Selçuk, Ali Aydın"
Now showing items 1-16 of 16
-
Capture resilient ElGamal signature protocols
(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 ... -
Generalized ID-based blind signatures from bilinear pairings
(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
(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 ... -
Improved DST cryptanalysis of IDEA
(Springer, 2006-08)In this paper, we show how the Demirci-Selcuk-Ture attack, which is currently the deepest penetrating attack on the IDEA block cipher, can be improved significantly in performance. The improvements presented reduce the ... -
A meet-in-the-middle attack on 8-round AES
(Springer, 2008-02)We present a 5-round distinguisher for AES. We exploit this distinguisher to develop a meet-in-the-middle attack on 7 rounds of AES-192 and 8 rounds of AES-256. We also give a time-memory tradeoff generalization of the ... -
Practical threshold signatures with linear secret sharing schemes
(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 ... -
Preserving location privacy for a group of users
(Scientific and Technical Research Council of Turkey - TUBITAK, 2013)Location privacy is an interesting problem that has been receiving considerable attention. This problem has been widely discussed from the individual point of view; however, there exist only a few works that support ... -
Robust threshold schemes based on the Chinese remainder theorem
(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 ... -
A strong user authentication protocol for GSM
(IEEE, 2005-06)Traditionally, the authentication protocols for cellular phone networks have been designed for device authentication rather than user authentication, which brings certain limitations and restrictions on the functionality ... -
Threshold broadcast encryption with reduced complexity
(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
(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 ... -
A verifiable secret sharing scheme based on the chinese remainder theorem
(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 ... -
Word-based compression in full-text retrieval systems
(Bilkent University, 1995)Large space requirement of a full-text retrieval system can be reduced significantly by data compression. In this study, the problem of compressing the main text of a full-text retrieval system is addressed and performance ...
