Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
From MaRDI portal
Publication:2061985
Recommendations
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Weak Pseudorandom Functions in Minicrypt
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Exploring crypto dark matter: new simple PRF candidates and their applications
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- scientific article; zbMATH DE number 1942437 (Why is no real title available?)
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
- A Leakage-Resilient Mode of Operation
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Exploring crypto dark matter: new simple PRF candidates and their applications
- From selective to adaptive security in functional encryption
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Keying hash functions for message authentication
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Message Authentication Codes from Unpredictable Block Ciphers
- Message authentication, revisited
- New proofs for NMAC and HMAC: security without collision resistance
- Noise-tolerant learning, the parity problem, and the statistical query model
- On solving LPN using BKW and variants, Implementation and analysis
- On the bit security of cryptographic primitives
- Pseudorandom functions: three decades later
Cited in
(14)- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Ubiquitous weak-key classes of BRW-polynomial function
- Weak Pseudorandom Functions in Minicrypt
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Fast public-key silent OT and more from constrained Naor-Reingold
- Improved alternating-moduli PRFs and post-quantum signatures
- Malware, encryption, and rerandomization -- everything Is under attack
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
This page was built for publication: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061985)
