On the complexity of cryptographic groups and generic group models

DOI10.1007/978-981-96-0941-3_1MaRDI QIDQ6965186zbMATH OpenFDO

Authors Keyu Ji, Cong Zhang, Taiyu Wang, Bingsheng Zhang, Hong-Sheng Zhou, Xin Wang, Kui Ren

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0941-3_1

zbMATH Keywords

group-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A domain extender for the ideal cipher
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
• Advances in Cryptology – CRYPTO 2004
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Careful with composition: limitations of the indifferentiability framework
• Complexity of a determinate algorithm for the discrete logarithm
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Cryptography and Coding
• Generic-group delay functions require hidden-order groups
• Generic-Group Identity-Based Encryption: A Tight Impossibility Result
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
• Impossibility of order-revealing encryption in idealized models
• Indifferentiability for public key cryptosystems
• Indifferentiability of confusion-diffusion networks
• Indifferentiable authenticated encryption
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• Lower bounds on assumptions behind registration-based encryption
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Monte Carlo Methods for Index Computation (mod p)
• New directions in cryptography
• On black-box separations among injective one-way functions
• On the complexity of cryptographic groups and generic group models
• On the impossibility of purely algebraic signatures
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• On the indifferentiability of key-alternating ciphers
• Salvaging Merkle-Damgård for Practical Applications
• The equivalence of the random oracle model and the ideal cipher model, revisited
• The relationship between idealized models under computationally bounded adversaries
• Theory of Cryptography
• Theory of Cryptography
• To label, or not to label (in generic groups)
• When does functional encryption imply obfuscation?

Cited in

(2)

• On the complexity of cryptographic groups and generic group models
• Attention is still what you need: another round of exploring Shoup's GGM

This page was built for publication: On the complexity of cryptographic groups and generic group models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965186)