Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
New methods for public key cryptosystems based on XTR
Date
2015-12-01
Author
AKLEYLEK, SEDAT
KIRLAR, Barış Bülent
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
256
views
0
downloads
Cite This
In this paper, we propose novel deterministic and probabilistic public key cryptographic schemes based on an effective and compact subgroup trace representation cryptosystem to handle with the problem of secure and efficient communication between the server and resource-constrained device. The proposed schemes use the hardness of the Trace-discrete logarithmic like problem. We also show that the deterministic version of the proposed scheme is a one-way trapdoor, and the probabilistic version of the proposed scheme is semantically secure. Moreover, we discuss the efficiency of the proposed schemes by comparing with effective and compact subgroup schemes. Copyright (C) 2015 John Wiley & Sons, Ltd.
Subject Keywords
Public key encryption scheme
,
XTR
,
Characteristic sequence
,
Trace-DLP
,
Semantic security
,
Lightweight device
URI
https://hdl.handle.net/11511/65093
Journal
SECURITY AND COMMUNICATION NETWORKS
DOI
https://doi.org/10.1002/sec.1291
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
An efficient RSA public key encryption scheme
Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09)
In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...
On provable security of some public key encryption schemes
Hanoymak, Turgut; Akyıldız, Ersan; Selçuk, Ali Aydın; Department of Cryptography (2012)
In this thesis, we analyse the security criteria of some public key encryption schemes. In this respect, we present the notion of adversarial goals and adversarial capabilities. We give the definition of provably security by means of several games between the challenger and the adversary in some security models, namely the standard model and the random oracle model. We state the main differences between these two models and observe the advantage of the success probability of the adversary in breaking the cr...
Design and performance evaluation of a flexible and efficient server assisted signature protocol
Bicakci, K; Baykal, Nazife (2003-07-03)
One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server In this paper, we propose a (verifiable) server assisted signature protocol which is the first one that totally elliminates public key operations for the ordinary user Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signatures to prove its cheating.
AN OPTIMISTIC LOCKING TECHNIQUE FOR CONCURRENCY-CONTROL IN DISTRIBUTED DATABASES
Halıcı, Uğur (1991-07-01)
An optimistic scheme, called ODL, which uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems, is suggested. The dummy locks are long-term locks; however, they do not conflict with any other lock. By the use of long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and during the validation test only the related sites are checked. Also, the transactions to be aborted are immediately recogniz...
Message transmission for GH-public key cryptosystem
Ashraf, Muhammad; KIRLAR, Barış Bülent (2014-03-15)
In this paper we propose an ElGamal type encryption scheme based on the concepts of public key cryptosystem over cubic finite field extension proposed by Gong and Ham (GH). The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving 3-LFSR-DLP, 3-LFSR-DHP and 3-LFSR-DDHP. It then provides secure message transmission by having also the property of sema...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. AKLEYLEK and B. B. KIRLAR, “New methods for public key cryptosystems based on XTR,”
SECURITY AND COMMUNICATION NETWORKS
, pp. 3682–3689, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65093.