The relationship between idealized models under computationally bounded adversaries

DOI10.1007/978-981-99-8736-8_13MaRDI QIDQ6605332zbMATH OpenFDO

Authors Cong Zhang, Mark Zhandry

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-981-99-8736-8_13

zbMATH Keywords

generic bilinear map modelsgeneric grouprandom oracle

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptography and Coding
• On the Equivalence of Generic Group Models
• Theory of Cryptography
• Theory of Cryptography
• scientific article; zbMATH DE number 5532068

Cites work

• A domain extender for the ideal cipher
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Advances in Cryptology - EUROCRYPT 2004
• Careful with composition: limitations of the indifferentiability framework
• Cryptography and Coding
• Generic-group delay functions require hidden-order groups
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Impossibility of order-revealing encryption in idealized models
• Indifferentiability for public key cryptosystems
• Indifferentiability of confusion-diffusion networks
• Indifferentiable authenticated encryption
• Merkle-Damgård Revisited: How to Construct a Hash Function
• New directions in cryptography
• New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
• On the impossibility of purely algebraic signatures
• On the indifferentiability of key-alternating ciphers
• Optimal broadcast encryption from pairings and LWE
• Reducing elliptic curve logarithms to logarithms in a finite field
• Salvaging Merkle-Damgård for Practical Applications
• Secure integration of asymmetric and symmetric encryption schemes
• Security proofs for signature schemes
• The exact security of digital signatures -- how to sign with RSA and Rabin
• Theory of Cryptography
• To label, or not to label (in generic groups)

Cited in

(4)

• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• On the complexity of cryptographic groups and generic group models
• Attention is still what you need: another round of exploring Shoup's GGM
• The uber-knowledge assumption: a bridge to the AGM

This page was built for publication: The relationship between idealized models under computationally bounded adversaries

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