Candidate obfuscation via oblivious LWE sampling (Q2056783)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Candidate obfuscation via oblivious LWE sampling

scientific article; zbMATH DE number 7440636

Language	Label	Description	Also known as
default for all languages	No label defined
English	Candidate obfuscation via oblivious LWE sampling	scientific article; zbMATH DE number 7440636

Statements

instance of

scholarly article

0 references

title

Candidate obfuscation via oblivious LWE sampling (English)

0 references

0 references

0 references

8 December 2021

0 references

zbMATH Keywords

indistinguishability obfuscation

0 references

learning-with-errors

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-77883-5_5

0 references

cites work

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13

0 references

Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation

0 references

Indistinguishability obfuscation from compact functional encryption

0 references

Multiparty computation with low communication, computation and interaction via threshold FHE

0 references

Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

0 references

Q4228459

0 references

Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE

0 references

Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles

0 references

Candidate iO from homomorphic encryption schemes

0 references

Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits

0 references

Q4783716

0 references

Return of GGH15: provable security against zeroizing attacks

0 references

Q5875789

0 references

Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III

0 references

Private constrained PRFs (and more) from LWE

0 references

Indistinguishability obfuscation from functional encryption

0 references

Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map

0 references

Cryptanalyses of Candidate Branching Program Obfuscators

0 references

Cryptanalysis of the multilinear map over the integers

0 references

Matrix PRFs: constructions, attacks, and applications to obfuscation

0 references

Cryptanalysis of GGH15 multilinear maps

0 references

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

0 references

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

0 references

Adaptively secure, universally composable, multiparty computation in constant rounds

0 references

Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II

0 references

Preventing CLT attacks on obfuscation with linear overhead

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Candidate indistinguishability obfuscation and functional encryption for all circuits

0 references

Graph-induced multilinear maps from lattices

0 references

Compressible FHE with applications to PIR

0 references

Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Witness encryption from instance independent assumptions

0 references

On Best-Possible Obfuscation

0 references

Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based

0 references

Attribute-based encryption for circuits

0 references

Leveled fully homomorphic signatures from standard lattices

0 references

On Invertible Sampling and Adaptive Security

0 references

How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)

0 references

Indistinguishability obfuscation from constant-degree graded encoding schemes

0 references

Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs

0 references

Indistinguishability obfuscation with non-trivial efficiency

0 references

Output-compressing randomized encodings and applications

0 references

Indistinguishability obfuscation from trilinear maps and block-wise local PRGs

0 references

Trapdoors for lattices: simpler, tighter, faster, smaller

0 references

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

0 references

Two round multiparty computation via multi-key FHE

0 references

Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model

0 references

Noninteractive zero knowledge for NP from (Plain) Learning With Errors

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Identifiers

zbMATH Open document ID

1479.94270

0 references

DOI

10.1007/978-3-030-77883-5_5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2056783