Matrix PRFs: constructions, attacks, and applications to obfuscation
From MaRDI portal
Publication:2175904
DOI10.1007/978-3-030-36030-6_3zbMath1455.94138OpenAlexW2989616477MaRDI QIDQ2175904
Hoeteck Wee, Vinod Vaikuntanathan, Minki Hhan, Yilei Chen
Publication date: 30 April 2020
Full work available at URL: https://hdl.handle.net/1721.1/137165
Related Items (9)
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Witness encryption and null-iO from evasive LWE ⋮ Candidate witness encryption from lattice techniques ⋮ Tracing quantum state distinguishers via backtracking ⋮ Secure software leasing from standard assumptions ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Return of GGH15: provable security against zeroizing attacks
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Key Homomorphic PRFs and Their Applications
- Practical Multilinear Maps over the Integers
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Secure Obfuscation in a Weak Multilinear Map Model
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Candidate Multilinear Maps from Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Public-key cryptosystems from the worst-case shortest vector problem
- Cryptanalyses of Candidate Branching Program Obfuscators
- Protecting Obfuscation against Algebraic Attacks
- Advances in Cryptology - CRYPTO 2003
- Classical hardness of learning with errors
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Matrix PRFs: constructions, attacks, and applications to obfuscation
