Muhammed Ali Bingol

Dr. Muhammed Ali Bingol


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2018 in ACM Computing Surveys
Verified
Journal Article
Open access
PDF file
GAGildas Avoine
Gildas Avoine
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
IBIoana Boureanu
Ioana Boureanu
SČSrdjan Čapkun
Srdjan Čapkun
GHGerhard Hancke
Gerhard Hancke
SVSerge Vaudenay
Serge Vaudenay
Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g., electronic payment or access control systems, which are vulnerable to distance-based frauds. This survey analyzes and compares in a unified manner many existing distance-bounding protocols with respect to several key security and complexity features.

14 March 2011 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
GAGildas Avoine
Gildas Avoine
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
SKSüleyman Kardaş
Süleyman Kardaş
CLCédric Lauradoux
Cédric Lauradoux
BMBenjamin Martin
Benjamin Martin
Many distance bounding protocols appropriate for the RFID technology have been proposed recently. Unfortunately, they are commonly designed without any formal approach, which leads to inaccurate analyzes and unfair comparisons. Motivated by this need

6 August 2012 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
GAGildas Avoine
Gildas Avoine
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
XCXavier Carpent
Xavier Carpent
SYSiddika Berna Ors Yalcin
Siddika Berna Ors Yalcin
The recent advent of ubiquitous technologies has raised an important concern for citizens: the need to protect their privacy. So far, this wish was not heard of industrials, but national and international regulation authorities, as the European Commission recently published some guidelines to enforce customers' privacy in RFID systems: "Privacy by designâ is the way to be followed as stated in EC Recommendation of 12.5.2009. Research on privacy is an active domain but there is still a wide gap between theory and everyday life's applications. Filling this gap will require academia to design protocols and algorithms that fit the real-life constraints. In this paper, we provide a comprehensive analysis of privacy-friendly authentication protocols devoted to RFID that: 1) are based on well-established symmetric-key cryptographic building blocks; 2) require a reader complexity lower than O(N) where N is the number of provers in the system. These two properties are sine qua non conditions for deploying privacy-friendly authentication protocols in large-scale applications, for example, access control in mass transportation. We describe existing protocols fulfilling these requirements and point out their drawbacks and weaknesses. We especially introduce attacks on CHT, CTI,YA-TRAP*, and the variant of OSK/AO with mutual authentication. We also raise that some protocols, such as O-RAP, O-FRAP, and OSK/BF, are not resistant to timing attacks. Finally, we select some candidates that are, according to our criteria, the most appropriate ones for practical uses.

1 January 2012
Verified
Book Chapter
Closed access
PDF file
SKSüleyman Kardaş
Süleyman Kardaş
Mehmet Sabir KirazMehmet Sabir Kiraz
Mehmet Sabir Kiraz
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
HDHuseyin Demirci
Huseyin Demirci

24 December 2018 in The Computer Journal
Verified
Journal Article
Closed access
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
OBOsman Biçer
Osman Biçer
Mehmet Sabir KirazMehmet Sabir Kiraz
Mehmet Sabir Kiraz
ALAlbert Levi
Albert Levi

15 July 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
OBOsman Bicer
Osman Bicer
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
Mehmet Sabir KirazMehmet Sabir Kiraz
Mehmet Sabir Kiraz
ALAlbert Levi
Albert Levi
Private function evaluation aims to securely compute a function f(x_1,…, x_n) without leaking any information other than what is revealed by the output, where f is a private input of one of the parties (say Party1) and x_i is a private input of the i-th party Party_i. In this work, we propose a novel and secure two-party private function evaluation (2PFE) scheme based on the DDH assumption. Our scheme introduces a reusability feature that significantly improves the state-of-the-art. Accordingly, our scheme has two variants, one is utilized in the initial execution of the function f, and the other is utilized in its subsequent evaluations. To the best of our knowledge, this is the first and most efficient 2PFE scheme that enjoys a reusability feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.