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

Hyundo Yoon

dblp:260/1212 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-5803-3898ORCID · reported

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

Security and privacy · 1 · 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
1 paper
Cryptographic primitives and cryptanalysis · 87% Authentication and access control · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › searchable encryption › searchable symmetric encryption
multi-key searchable encryption
0.712023
Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic primitives and cryptanalysis
searchable encryption
0.712023
Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query · IEEE Trans. Inf. Forensics Secur. 2023
Cloud and datacenter computing › cloud data management
cloud data sharing
0.712023
Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query · IEEE Trans. Inf. Forensics Secur. 2023
Cloud and datacenter computing › utility computing › cloud pricing
pay-per-query billing
0.712023
Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query · IEEE Trans. Inf. Forensics Secur. 2023

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

multi-key searchable encryption · 1.3
YearPublicationVenuePosition
2023 Multi-Key Similar Data Search on Encrypted Storage With Secure Pay-Per-Query
abstract
Many commercial cloud service providers (CSPs) adopt pay-per-query pricing models, in which data owners are charged based on the amount of data scanned by each query. In such a data sharing model, not only the privacy preservation for the data and queries but also the trustworthiness of the underlying billing system is of the utmost importance. In this paper, we revisit multi-key searchable encryption (MKSE), an efficient and secure data search algorithm allowing a data owner to grant users the ability to retrieve data of interest over the outsourced, encrypted datasets. We first investigate which factor in existing MKSE schemes renders authorized users over-privileged such that, without risking their credits (e.g., leaking the private keys and/or the passwords for their accounts associated with a project where the shared data resides), they can allow unauthorized users to make valid queries. Unfortunately, this concern may be devastating because the queries made by unauthorized users would incur unexpected financial damage to the owner in practical pay-per-query models. We then propose a novel multi-key data search scheme that is resilient to unauthorized queries. The proposed scheme features a novel user authorization mechanism that carefully limits user privilege such that even an authorized user cannot illegally invite unauthorized users to query unless he entirely leaks his credit. We demonstrate the proposed scheme is comparable to prior work in terms of performance while achieving a higher level of security.
Changhee Hahn, Hyundo Yoon, Junbeom Hur
IEEE Trans. Inf. Forensics Secur.2