Factoring and pairings are not necessary for iO: circular-secure LWE suffices

DOI10.4230/LIPICS.ICALP.2022.28MaRDI QIDQ6560814

Zvika Brakerski, Sanjam Garg, Giulio Malavolta, Nico Döttling

Publication date: 24 June 2024

zbMATH Keywords

cryptographyobfuscation

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (5)

Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors ⋮ Registered (inner-product) functional encryption ⋮ Distributed broadcast encryption from bilinear groups ⋮ Time-lock puzzles with efficient batch solving ⋮ Software with certified deletion

This page was built for publication: Factoring and pairings are not necessary for iO: circular-secure LWE suffices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560814)