Candidate obfuscation via oblivious LWE sampling
type: Item
instance of: scholarly article
title: Candidate obfuscation via oblivious LWE sampling
zbMATH Open document ID: 1479.94270
DOI: 10.1007/978-3-030-77883-5_5
author: Hoeteck Wee
author: Daniel Wichs
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440636
zbMATH Keywords: indistinguishability obfuscation
zbMATH Keywords: learning-with-errors
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 5
OpenAlex ID: W3089736144
cites work: Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
cites work: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
cites work: Indistinguishability Obfuscation from Compact Functional Encryption
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
cites work: Q4228459
cites work: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
cites work: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
cites work: Candidate iO from homomorphic encryption schemes
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Q4783716
cites work: Return of GGH15: provable security against zeroizing attacks
cites work: Q5875789
cites work: Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
cites work: Private constrained PRFs (and more) from LWE
cites work: Indistinguishability Obfuscation from Functional Encryption
cites work: Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
cites work: Cryptanalyses of Candidate Branching Program Obfuscators
cites work: Cryptanalysis of the Multilinear Map over the Integers
cites work: Matrix PRFs: constructions, attacks, and applications to obfuscation
cites work: Cryptanalysis of GGH15 Multilinear Maps
cites work: Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
cites work: GGH15 beyond permutation branching programs: proofs, attacks, and candidates
cites work: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
cites work: Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
cites work: Preventing CLT attacks on obfuscation with linear overhead
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Graph-Induced Multilinear Maps from Lattices
cites work: Compressible FHE with applications to PIR
cites work: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
cites work: Reusable garbled circuits and succinct functional encryption
cites work: Witness Encryption from Instance Independent Assumptions
cites work: On Best-Possible Obfuscation
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Attribute-based encryption for circuits
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: On Invertible Sampling and Adaptive Security
cites work: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
cites work: Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
cites work: Indistinguishability Obfuscation with Non-trivial Efficiency
cites work: Output-Compressing Randomized Encodings and Applications
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
cites work: Two Round Multiparty Computation via Multi-key FHE
cites work: Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 7440636