GGH15 beyond permutation branching programs: proofs, attacks, and candidates

DOI10.1007/978-3-319-96881-0_20zbMath1436.94046OpenAlexW2807695933MaRDI QIDQ1784107

Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee

Publication date: 26 September 2018

Full work available at URL: https://hdl.handle.net/1721.1/137867

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (30)

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Obfuscating finite automata ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Multi-authority ABE from lattices without random oracles ⋮ Witness encryption and null-iO from evasive LWE ⋮ Candidate witness encryption from lattice techniques ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Adaptively secure inner product encryption from LWE ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Obfustopia built on secret-key functional encryption ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ On succinct arguments and witness encryption from groups ⋮ (Commit-and-prove) predictable arguments with privacy ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: GGH15 beyond permutation branching programs: proofs, attacks, and candidates