A KEM/DEM-Based Construction for Secure and Anonymous Communication

Emura, Keita; Kanaoka, Akira; Ohta, Satoshi; Takahashi, Takeshi

doi:10.1109/compsac.2015.54

Cited by 5 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abe et al [20] put forward to a more efficient tag-KEM/DEM scheme. Then, many KEM/ DEM schemes [21][22][23][24][25][26][27][28] have been proposed. These designs support both components modular design.…”

Section: Related Workmentioning

confidence: 99%

Heterogeneous deniable authenticated encryption for location-based services

et al. 2021

View full text Add to dashboard Cite

The location-based services can provide users with the requested location information. But users also need to disclose their current location to the location-based service provider. Therefore, how to protect user’s location privacy is a major concern. In this paper, we propose a heterogeneous deniable authenticated encryption scheme called HDAE for location-based services. The proposed scheme permits a sender in a public key infrastructure environment to transmit a message to a receiver in an identity-based environment. Our design utilizes a hybrid encryption method combing the tag-key encapsulation mechanism (tag-KEM) and the data encapsulation mechanism (DEM), which is well adopted for location-based services applications. We give how to design an HDAE scheme utilizing a heterogeneous deniable authenticated tag-KEM (HDATK) and a DEM. We also construct an HDATK scheme and provide security proof in the random oracle model. Comprehensive analysis shows that our scheme is efficient and secure. In addition, we give an application of the HDAE to a location-based services system.

show abstract

Section: Related Workmentioning

confidence: 99%

Heterogeneous deniable authenticated encryption for location-based services

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Numerous organizations amass and use databases replete with personal information. [1][2][3][4][5][6][7][8] The proliferation of information and communication technology has exponentially increased the storage of personal data, encompassing elements such as names, birth dates, addresses, and biometric indicators. The variety and volume of this data continue to expand.…”

Section: Introductionmentioning

confidence: 99%

Algorithm to satisfy l‐diversity by combining dummy records and grouping

Oishi,

Sei,

Andrew

et al. 2024

Security and Privacy

View full text Add to dashboard Cite

Universities and corporations frequently use personal information databases for diverse objectives, such as research and marketing. The use of these databases inherently intersects with privacy issues, which have been the subject of extensive research. Traditional anonymization techniques predominantly focus on removing or altering identifiers and quasi‐identifiers (QIDs), the latter of which, although not unique, are closely correlated with individuals. However, this modification of QIDs can often impede data analysis. In this study, we introduce an innovative anonymization algorithm that combines the dummy‐record addition technique with a grouping method while circumventing the modification of QIDs. This fusion reduces the number of dummy records required for effective anonymization. The principal contribution of this study is the algorithm's ability to reduce the number of added dummy records. The proposed algorithm not only retains a high degree of data usefulness but also successfully adheres to the ‐diversity standard, which is a critical metric in privacy security. The experimental findings demonstrate that the proposed method offers a more equitable balance between safety and utility than existing technological solutions.

show abstract