Succinct LWE sampling, random polynomials, and obfuscation (Q2697860)

From MaRDI portal

Revision as of 21:37, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Succinct LWE sampling, random polynomials, and obfuscation	scientific article

Statements

scholarly article

0 references

Succinct LWE sampling, random polynomials, and obfuscation (English)

0 references

0 references

0 references

Vinod Vaikuntanathan

0 references

0 references

0 references

publication date

13 April 2023

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-90453-1_9

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

Faster Bootstrapping with Polynomial Error

0 references

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

0 references

Functional encryption for bounded collusions, revisited

0 references

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

0 references

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

0 references

Candidate iO from homomorphic encryption schemes

0 references

Succinct Randomized Encodings and their Applications

0 references

Sum-of-squares meets program obfuscation, revisited

0 references

Private constrained PRFs (and more) from LWE

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Matrix PRFs: constructions, attacks, and applications to obfuscation

0 references

Compressible FHE with applications to PIR

0 references

Indistinguishability obfuscation from circular security

0 references

On Best-Possible Obfuscation

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Counterexamples to new circular security assumptions underlying iO

0 references

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

0 references

Indistinguishability obfuscation from well-founded assumptions

0 references

Indistinguishability Obfuscation with Non-trivial Efficiency

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

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

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

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

0 references

Candidate obfuscation via oblivious LWE sampling

0 references

Identifiers

10.1007/978-3-030-90453-1_9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2697860

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2697860&oldid=37506284"