The GGM Function Family Is a Weakly One-Way Family of Functions

DOI10.1007/978-3-662-53641-4_4zbMath1369.94527OpenAlexW2532018475MaRDI QIDQ3179353

Aloni Cohen, Saleet Klein

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_4

zbMATH Keywords

demonstration of the cryptographic hardnessGoldreich-Goldwasser-Micali (GGM) function family

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Unnamed Item ⋮ Pseudorandom Functions: Three Decades Later

Cites Work

• Unnamed Item
• Unnamed Item
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• Constrained Pseudorandom Functions and Their Applications
• Function Secret Sharing
• The random oracle methodology, revisited
• The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles
• A theory of the learnable
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Foundations of Cryptography
• How to use indistinguishability obfuscation
• Functional Signatures and Pseudorandom Functions
• Natural proofs

This page was built for publication: The GGM Function Family Is a Weakly One-Way Family of Functions