Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Md. Mamunur Rashid Akand

dblp:153/0064 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2023
0000-0003-1655-6225ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 3 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 89% Authentication and access control · 11%
Computer networks
1 paper
Wireless sensing and localization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
location privacy
0.922023
Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering · IEEE Trans. Dependable Secur. Comput. 2023
POSTER: Privacy Enhanced Secure Location Verification · CCS 2016
Privacy and data protection › location privacy
location proof
0.712023
Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering · IEEE Trans. Dependable Secur. Comput. 2023
Wireless sensing and localization › secure localization
location verification
0.212016
POSTER: Privacy Enhanced Secure Location Verification · CCS 2016
Authentication and access control › user authentication
location-based authentication
0.212023
Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering · IEEE Trans. Dependable Secur. Comput. 2023

Methods — techniques the papers use, named apart from their topics

euclidean distance matrices · 0.7cryptographic protocol design · 0.7distance bounding protocols · 0.5
YearPublicationVenuePosition
2023 Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering
abstract
A Proof-of-Location (POL) system is used to issue a proof-of-location token ($pol$) to a user who has been present at a location$\ell oc$, such that it can be later presented to a verifier to assure the presence of the user at$\ell oc$. Basic POL security requirements areunforgeabilityof$pol$, and itsnon-transferability(a$pol$issued to user$u_1$cannot be used by$u_2$). An additional important property of POL systems isuser privacyagainst the issuers and verifiers. We make two contributions. First, we formalize the POL security and privacy properties, and construct the first system providing provable security and privacy against the issuer and the verifier, both. Second, we introduce ageo-tampering attackthat completely breaks POL system security, by simply changing the location of a$pol$issuing node. The attack applies to portable infrastructure nodes that are not continually monitored. We propose an algorithm that is used by a$pol$issuer to provide a location integrity “proof”, that will be embedded in a$pol$to protect against this attack. The proof relies on a novel application of euclidean Distance Matrices. We implemented our POL on an off-the-shelf Android smartphone to show the practicality of the proposed algorithms.
Md. Mamunur Rashid Akand, Reihaneh Safavi-Naini, Marc Kneppers, Matthieu Giraud, Pascal Lafourcade 0001
IEEE Trans. Dependable Secur. Comput.1
2018 New Attacks and Secure Design for Anonymous Distance-Bounding
Ahmad Ahmadi, Reihaneh Safavi-Naini, Md. Mamunur Rashid Akand
ACISP3
2018 In-Region Authentication
Md. Mamunur Rashid Akand, Reihaneh Safavi-Naini
ACNS1
2016 POSTER: Privacy Enhanced Secure Location Verification
abstract
We propose a privacy enhanced location verification system that uses in-region location verification to verify if a location claim is from within an area specified by a policy. The novelty of our work is the use of distance bounding protocols to construct a pseudo-rectangle (P-rectangle) that optimizes coverage of the policy area, and uses it to verify the claim with respect to the P-rectangle, thereby minimizing error. We propose a privacy enhancement for the system that ensures that the prover's location cannot be inferred by an adversary who monitors protocol messages. We discuss our results and propose directions for future research.
Md. Mamunur Rashid Akand, Reihaneh Safavi-Naini
CCS1