The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
초기하학 확률 분포를 사용한 순서 보존 암호화는 일반 텍스트의 절반 비트와 임의의 두 일반 텍스트 사이의 거리를 누출합니다. 이러한 문제를 해결하기 위해 Popa는 et al. 변경 가능한 순서 보존 인코딩을 제안했습니다. 이는 트리 기반 데이터 구조를 통해 해당 암호문을 찾는 순서 보존 인덱스를 채택하는 키 없는 인코딩 방식입니다. 불행하게도 다음과 같은 단점이 있습니다. 첫째, 암호문의 빈도는 평문의 빈도를 나타낸다. 둘째, 인덱스는 해당 평문과 높은 상관관계가 있습니다. 이러한 이유로 통계적 암호 분석은 공개 정보를 사용하여 암호화된 필드를 식별할 수 있습니다. 이러한 한계를 극복하기 위해 우리는 가변 순서 보존 인코딩에 대한 다중 트리 접근 방식을 제안합니다. 트리 수의 증가에 따라 상호 작용 비용이 증가하지만 제안하는 방식은 평문의 분포 누출을 완화하고 평문과의 문제적인 상관 관계도 줄입니다.
Seungkwang LEE
Dankook University
Nam-su JHO
ETRI
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Seungkwang LEE, Nam-su JHO, "A Multi-Tree Approach to Mutable Order-Preserving Encoding" in IEICE TRANSACTIONS on Information,
vol. E105-D, no. 11, pp. 1930-1933, November 2022, doi: 10.1587/transinf.2022NGL0008.
Abstract: Order-preserving encryption using the hypergeomatric probability distribution leaks about the half bits of a plaintext and the distance between two arbitrary plaintexts. To solve these problems, Popa et al. proposed a mutable order-preserving encoding. This is a keyless encoding scheme that adopts an order-preserving index locating the corresponding ciphertext via tree-based data structures. Unfortunately, it has the following shortcomings. First, the frequency of the ciphertexts reveals that of the plaintexts. Second, the indices are highly correlated to the corresponding plaintexts. For these reasons, statistical cryptanalysis may identify the encrypted fields using public information. To overcome these limitations, we propose a multi-tree approach to the mutable order-preserving encoding. The cost of interactions increases by the increased number of trees, but the proposed scheme mitigates the distribution leakage of plaintexts and also reduces the problematic correlation to plaintexts.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2022NGL0008/_p
부
@ARTICLE{e105-d_11_1930,
author={Seungkwang LEE, Nam-su JHO, },
journal={IEICE TRANSACTIONS on Information},
title={A Multi-Tree Approach to Mutable Order-Preserving Encoding},
year={2022},
volume={E105-D},
number={11},
pages={1930-1933},
abstract={Order-preserving encryption using the hypergeomatric probability distribution leaks about the half bits of a plaintext and the distance between two arbitrary plaintexts. To solve these problems, Popa et al. proposed a mutable order-preserving encoding. This is a keyless encoding scheme that adopts an order-preserving index locating the corresponding ciphertext via tree-based data structures. Unfortunately, it has the following shortcomings. First, the frequency of the ciphertexts reveals that of the plaintexts. Second, the indices are highly correlated to the corresponding plaintexts. For these reasons, statistical cryptanalysis may identify the encrypted fields using public information. To overcome these limitations, we propose a multi-tree approach to the mutable order-preserving encoding. The cost of interactions increases by the increased number of trees, but the proposed scheme mitigates the distribution leakage of plaintexts and also reduces the problematic correlation to plaintexts.},
keywords={},
doi={10.1587/transinf.2022NGL0008},
ISSN={1745-1361},
month={November},}
부
TY - JOUR
TI - A Multi-Tree Approach to Mutable Order-Preserving Encoding
T2 - IEICE TRANSACTIONS on Information
SP - 1930
EP - 1933
AU - Seungkwang LEE
AU - Nam-su JHO
PY - 2022
DO - 10.1587/transinf.2022NGL0008
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E105-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2022
AB - Order-preserving encryption using the hypergeomatric probability distribution leaks about the half bits of a plaintext and the distance between two arbitrary plaintexts. To solve these problems, Popa et al. proposed a mutable order-preserving encoding. This is a keyless encoding scheme that adopts an order-preserving index locating the corresponding ciphertext via tree-based data structures. Unfortunately, it has the following shortcomings. First, the frequency of the ciphertexts reveals that of the plaintexts. Second, the indices are highly correlated to the corresponding plaintexts. For these reasons, statistical cryptanalysis may identify the encrypted fields using public information. To overcome these limitations, we propose a multi-tree approach to the mutable order-preserving encoding. The cost of interactions increases by the increased number of trees, but the proposed scheme mitigates the distribution leakage of plaintexts and also reduces the problematic correlation to plaintexts.
ER -