Improved, black-box, non-malleable encryption from semantic security

被引：3

作者：

Choi, Seung Geol ^{[1
]}

Dachman-Soled, Dana ^{[2
]}

Malkin, Tal ^{[3
]}

Wee, Hoeteck ^{[4
]}

机构：

[1] US Naval Acad, Annapolis, MD 21402 USA

[2] Univ Maryland, College Pk, MD 20742 USA

[3] Columbia Univ, New York, NY USA

[4] Ecole Normale Super, CNRS, DIENS, Paris, France

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2018年 / 86卷 / 03期

基金：

美国国家科学基金会;

关键词：

Public-key encryption; Non-malleable encryption; Black-box construction; PUBLIC-KEY ENCRYPTION; CHOSEN-CIPHERTEXT SECURITY; CONSTRUCTION; SCHEME;

D O I：

10.1007/s10623-017-0348-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We give a new black-box transformation from any semantically secure encryption scheme into a non-malleable one which has a better rate than the best previous work of Coretti et al. (in: Kushilevitz and Malkin (eds) TCC 2016-A, Part I, Springer, Heidelberg, 2016). We achieve a better rate by departing from the "matrix encoding" methodology used by previous constructions, and working directly with a single codeword. We also use a Shamir secret-share packing technique to improve the rate of the underlying error-correcting code.

引用

页码：641 / 663

页数：23

共 50 条

[21] Non-Malleable Extractors - New Tools and Improved Constructions
Cohen, Gil
31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
[22] On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
Katz, Jonathan
Yerukhimovich, Arkady
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2009, 2009, 5912 : 197 - 213
[23] Privacy Amplification from Non-malleable Codes
Chattopadhyay, Eshan
Kanukurthi, Bhavana
Obbattu, Sai Lakshmi Bhavana
Sekar, Sruthi
PROGRESS IN CRYPTOLOGY - INDOCRYPT 2019, 2019, 11898 : 318 - 337
[24] NON-MALLEABLE CODES FROM ADDITIVE COMBINATORICS
Aggarwal, Divesh
Dodis, Yevgeniy
Lovett, Shachar
SIAM JOURNAL ON COMPUTING, 2018, 47 (02) : 524 - 546
[25] Non-malleable Codes from Additive Combinatorics
Aggarwal, Divesh
Dodis, Yevgeniy
Lovett, Shachar
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 774 - 783
[26] Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
Matsuda, Takahiro
Hanaoka, Goichiro
Matsuura, Kanta
Imai, Hideki
INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2008, 2009, 5461 : 1 - +
[27] Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption
Sun, Shi-Feng
Gu, Dawu
Liu, Joseph K.
Parampalli, Udaya
Yuen, Tsz Hon
ASIA CCS'16: PROCEEDINGS OF THE 11TH ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, : 901 - 906
[28] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
Pass, Rafael
COMPUTATIONAL COMPLEXITY, 2016, 25 (03) : 607 - 666
[29] Black-box model adaptation for semantic segmentation
Zhou, Zhiheng
Yue, Wanlin
Cao, Yinglie
Shen, Shifu
IMAGE AND VISION COMPUTING, 2024, 150
[30] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
Rafael Pass
computational complexity, 2016, 25 : 607 - 666

← 1 2 3 4 5 →