Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
From MaRDI portal
Publication:2061985
DOI10.1007/978-3-030-75248-4_26zbMath1479.94144OpenAlexW3165509415MaRDI QIDQ2061985
Jung Hee Cheon, Jiseung Kim, Jeong Han Kim, Wonhee Cho
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_26
Related Items (3)
MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- New proofs for NMAC and HMAC: security without collision resistance
- Exploring crypto dark matter: new simple PRF candidates and their applications
- On the bit security of cryptographic primitives
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Message Authentication, Revisited
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- Message Authentication Codes from Unpredictable Block Ciphers
- Keying Hash Functions for Message Authentication
- From Selective to Adaptive Security in Functional Encryption
- A Leakage-Resilient Mode of Operation
- Pseudorandom Functions: Three Decades Later
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
