Onur, Cansu Betin

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14411/7832
Name Variants
O.,Cansu Betin
Onur,C.B.
O., Cansu Betin
C.,Onur
Onur, Cansu Betin
C., Onur
Cansu Betin, Onur
C.B.Onur
Betin, Cansu
Job Title
Doktor Öğretim Üyesi
Email Address
cansu.betin@atilim.edu.tr
Main Affiliation
Mathematics
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

6

Articles

4

Views / Downloads

13/75

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

4

Scopus Citation Count

5

WoS h-index

1

Scopus h-index

2

Patents

0

Projects

0

WoS Citations per Publication

0.67

Scopus Citations per Publication

0.83

Open Access Source

2

Supervised Theses

1

Google Analytics Visitor Traffic

JournalCount
15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech) -- NOV 06-10, 2017 -- IEEE Tech Comm on Scalable Comp, Orlando, FL1
Communications in Algebra1
Open Mathematics1
Turkish Journal of Mathematics1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2017 - 20182
Reset filters

Settings

Author: Onur, Cansu Betin

Scholarly Output Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    On Strongly Autinertial Groups
    (Tubitak Scientific & Technological Research Council Turkey, 2018) Onur, Cansu Betin
    A subgroup X of G is said to be inert under automorphisms (autinert) if |X : $X^\\alpha$ ∩ X| is finite for allα ∈ Aut(G) and it is called strongly autinert if | < X, $X^\\alpha$ >: X| is finite for all α ∈ Aut(G). A group is calledstrongly autinertial if all subgroups are strongly autinert. In this article, the strongly autinertial groups are studied. Wecharacterize such groups for a finitely generated case. Namely, we prove that a finitely generated group G is stronglyautinertial if and only if one of the following hold:i) G is finite;ii) G = ⟨a⟩ ⋉ F where F is a finite subgroup of G and ⟨a⟩ is a torsion-free subgroup of G.Moreover, in the preliminary part, we give basic results on strongly autinert subgroups.
  • Thumbnail Image
    Conference Object
    Revisiting Shamir's No-key Protocol: Lightweight Key Transport
    (Ieee Computer Soc, 2017) Kilic, Adnan; Onur, Ertan; Onur, Cansu Betin
    Key-transport protocols, subclasses of key-establishment protocols, are employed to convey secret keys from a principal to another for establishing a security association. In this paper, we propose a lightweight, practicable, tweakable, energy-efficient, and secure key-transport protocol, suitable for wireless sensor networks (WSN), Internet of Things (IoT) and mobile networks. The proposed protocol is based on the Shamir's no-key protocol. Although Shamir's no-key protocol does not require any pre-shared secret between principals, we show that it is impossible to employ the no-key protocol over public commutative groups. We modify Diffie-Hellman key-agreement protocol to morph it into a key-transport protocol by applying a set of changes on the original protocol and it becomes possible to compare both protocols in terms of memory usage and total time to accomplish a single key transport. The experimental results show that the proposed key transport protocol perform faster than the modified Diffie-Hellman protocol, and the total time to transport a single key by using the modified Diffie-Hellman protocol grows drastically with the increase in key size.