TY - GEN
T1 - All-but-one dual projective hashing and its applications
AU - Zhang, Zongyang
AU - Chen, Yu
AU - Chow, Sherman S.M.
AU - Hanaoka, Goichiro
AU - Cao, Zhenfu
AU - Zhao, Yunlei
PY - 2014
Y1 - 2014
N2 - Recently, Wee (EUROCRYPT'12) introduced the notion of dual projective hashing as an extension of the Cramer-Shoup projective hashing, with a simple construction of lossy trapdoor functions, and a simple construction of deterministic encryption schemes which is chosen-plaintext-attack secure with respect to hard-to-invert auxiliary input. In this work, we further extend it to the all-but-one setting by introducing the notion of all-but-one dual projective hashing. We provide a simple construction of all-but-one lossy trapdoor functions. Our construction encompasses many known constructions of all-but-one lossy trapdoor functions, as presented by Peikert and Waters (STOC'08), and Freeman et al. (JoC'13). Particularly, we present a new construction of all-but-one lossy trapdoor functions based on the DLIN assumption, which can be viewed as an extension of Freeman et al.'s DDH-based construction to the DLIN setting, and therefore solves an open problem left by Freeman et al. We also provide a general construction of chosen-ciphertext- attack (CCA) secure deterministic encryption schemes in the standard model, under an additional assumption about the projective map. This extends the general approach of designing CCA secure deterministic encryption schemes by Boldyreva, Fehr and O'Neill (CRYPTO'08). In addition, we present a new construction of CCA secure deterministic encryption schemes based on the DLIN assumption.
AB - Recently, Wee (EUROCRYPT'12) introduced the notion of dual projective hashing as an extension of the Cramer-Shoup projective hashing, with a simple construction of lossy trapdoor functions, and a simple construction of deterministic encryption schemes which is chosen-plaintext-attack secure with respect to hard-to-invert auxiliary input. In this work, we further extend it to the all-but-one setting by introducing the notion of all-but-one dual projective hashing. We provide a simple construction of all-but-one lossy trapdoor functions. Our construction encompasses many known constructions of all-but-one lossy trapdoor functions, as presented by Peikert and Waters (STOC'08), and Freeman et al. (JoC'13). Particularly, we present a new construction of all-but-one lossy trapdoor functions based on the DLIN assumption, which can be viewed as an extension of Freeman et al.'s DDH-based construction to the DLIN setting, and therefore solves an open problem left by Freeman et al. We also provide a general construction of chosen-ciphertext- attack (CCA) secure deterministic encryption schemes in the standard model, under an additional assumption about the projective map. This extends the general approach of designing CCA secure deterministic encryption schemes by Boldyreva, Fehr and O'Neill (CRYPTO'08). In addition, we present a new construction of CCA secure deterministic encryption schemes based on the DLIN assumption.
KW - ABO lossy trapdoor function
KW - CCA security
KW - Smooth projective hashing
KW - deterministic encryption
UR - https://www.scopus.com/pages/publications/84903612191
U2 - 10.1007/978-3-319-07536-5_12
DO - 10.1007/978-3-319-07536-5_12
M3 - 会议稿件
AN - SCOPUS:84903612191
SN - 9783319075358
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 181
EP - 198
BT - Applied Cryptography and Network Security - 12th International Conference, ACNS 2014, Proceedings
PB - Springer Verlag
T2 - 12th International Conference on Applied Cryptography and Network Security, ACNS 2014
Y2 - 10 June 2014 through 13 June 2014
ER -