To Label, or Not To Label (in Generic Groups)

被引:27
作者
Zhandry, Mark [1 ,2 ]
机构
[1] NTT Res, Sunnyvale, CA 94085 USA
[2] Princeton Univ, Princeton, NJ 08544 USA
来源
ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT III | 2022年 / 13509卷
关键词
RANDOM-ORACLE-MODEL; COMPLEXITY; PROOFS;
D O I
10.1007/978-3-031-15982-4_3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Generic groups are an important tool for analyzing the feasibility and in-feasibility of group-based cryptosystems. There are two distinct wide-spread versions of generic groups, Shoup's and Maurer's, the main difference being whether or not group elements are given explicit labels. The two models are often treated as equivalent. In this work, however, we demonstrate that the models are in fact quite different, and care is needed when stating generic group results: - We show that numerous textbook constructions are not captured by Maurer, but are captured by Shoup. In the other direction, any construction captured by Maurer is captured by Shoup. - For constructions that exist in both models, we show that security is equivalent for "single stage" games, but Shoup security is strictly stronger than Maurer security for some "multi-stage" games. - The existing generic group un-instantiability results do not apply to Maurer. We fill this gap with a new un-instantiability result. - We explain how the known black box separations between generic groups and identity-based encryption do not fully apply to Shoup, and resolve this by providing such a separation. - We give a new un-instantiability result for the algebraic group model.
引用
收藏
页码:66 / 96
页数:31
相关论文
共 44 条
[1]   Optimal Broadcast Encryption from Pairings and LWE [J].
Agrawal, Shweta ;
Yamada, Shota .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT I, 2020, 12105 :13-43
[2]  
[Anonymous], 2021, Information Theoretic Cryptography
[3]   Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption [J].
Baltico, Carmen Elisabetta Zaira ;
Catalano, Dario ;
Fiore, Dario ;
Gay, Romain .
ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I, 2017, 10401 :67-98
[4]  
Barthe G, 2014, LECT NOTES COMPUT SC, V8616, P95, DOI 10.1007/978-3-662-44371-2_6
[5]   A Classification of Computational Assumptions in the Algebraic Group Model [J].
Bauer, Balthazar ;
Fuchsbauer, Georg ;
Loss, Julian .
ADVANCES IN CRYPTOLOGY - CRYPTO 2020, PT II, 2020, 12171 :121-151
[6]  
Bellare M, 2004, LECT NOTES COMPUT SC, V3027, P171
[7]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[8]   On the Existence of Extractable One-Way Functions [J].
Bitansky, Nir ;
Canetti, Ran ;
Paneth, Omer ;
Rosen, Alon .
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, :505-514
[9]   On the Multi-user Security of Short Schnorr Signatures with Preprocessing [J].
Blocki, Jeremiah ;
Lee, Seunghoon .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 :614-643
[10]  
Blum M., 1982, 23rd Annual Symposium on Foundations of Computer Science, P112, DOI 10.1109/SFCS.1982.72