loading
Papers

Research.Publish.Connect.

Paper

Authors: Masayuki Yoshino 1 ; Takayuki Suzuki 1 ; Ken Naganuma 2 and Hisayoshi Sato 1

Affiliations: 1 Hitachi, Ltd. Research & Development Group, Center for Technology Innovation-Systems Engineering, Kanagawa, Japan ; 2 Hitachi, Ltd. Research & Development Group, Center for Technology Innovation-Systems Engineering, Kanagawa, Japan, The University of Tokyo, Chiba, Japan

ISBN: 978-989-758-359-9

Keyword(s): Encrypted Database, k–anonymization, Searchable Symmetric Encryption, Domain Generalization Hierarchy.

Abstract: In this paper, we propose an encrypted k–anonymization scheme (EAS) to k–anonymize an encrypted database using a domain generalized hierarchy while maintaining the encryption state. Preparation of the domain generalized hierarchy is optional; the proposed EAS can generate domain generalized hierarchies using a Huffman code tree from a database encrypted with searchable encryption. As a result, the user can delegate k–anonymization processing to a third party organization such as the cloud while retaining the confidentiality of the database without preparing a generalized hierarchy. In addition, third-party organizations that are entrusted also have the advantage to eliminate possible of misconduct such as information leakage. In a standard computer experiment, we performed a generalization process, which is the major procedure for our EAS. The generalization process takes around 168 seconds only to achieve k–anonymity with k = 3 on 1,000,000 records consisting of 4 attributes. As a co nsequence, this high-speed performance means our EAS is applicable to not only batch processing but also real-time processing. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.228.21.186

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Yoshino, M.; Suzuki, T.; Naganuma, K. and Sato, H. (2019). Definition and Efficient Construction of Encrypted k–anonymization Scheme.In Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-359-9, pages 293-300. DOI: 10.5220/0007354702930300

@conference{icissp19,
author={Masayuki Yoshino. and Takayuki Suzuki. and Ken Naganuma. and Hisayoshi Sato.},
title={Definition and Efficient Construction of Encrypted k–anonymization Scheme},
booktitle={Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2019},
pages={293-300},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007354702930300},
isbn={978-989-758-359-9},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Definition and Efficient Construction of Encrypted k–anonymization Scheme
SN - 978-989-758-359-9
AU - Yoshino, M.
AU - Suzuki, T.
AU - Naganuma, K.
AU - Sato, H.
PY - 2019
SP - 293
EP - 300
DO - 10.5220/0007354702930300

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.