Multiparty reusable non-interactive secure computation from LWE (Q2056764)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multiparty reusable non-interactive secure computation from LWE	scientific article

Statements

scholarly article

0 references

Multiparty reusable non-interactive secure computation from LWE (English)

0 references

Fabrice Benhamouda

0 references

0 references

Ilan Komargodski

0 references

0 references

publication date

8 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-77886-6_25

0 references

Non-Interactive Secure Computation Based on Cut-and-Choose

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

0 references

0 references

Generating Shorter Bases for Hard Random Lattices

0 references

From FE combiners to secure MPC and back

0 references

Round-optimal secure multiparty computation with honest majority

0 references

Multi-key fully-homomorphic encryption in the plain model

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Two-message witness indistinguishability and secure computation in the plain model from new assumptions

0 references

Secure MPC: laziness leads to GOD

0 references

Non-interactive secure computation from one-way functions

0 references

New and Improved Key-Homomorphic Pseudorandom Functions

0 references

Pseudorandom Functions and Lattices

0 references

Reusable two-round MPC from DDH

0 references

Non-Interactive Secure Multiparty Computation

0 references

Multiparty reusable non-interactive secure computation from LWE

0 references

\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

0 references

Mr NISC: multiparty reusable non-interactive secure computation

0 references

Key Homomorphic PRFs and Their Applications

0 references

Two-message statistically sender-private OT from LWE

0 references

Four round secure computation without setup

0 references

Classical hardness of learning with errors

0 references

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

0 references

Lattice-based FHE as secure as PKE

0 references

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

0 references

Bonsai Trees, or How to Delegate a Lattice Basis

0 references

Reusable non-interactive secure computation

0 references

Multi-identity and Multi-key Leveled FHE from Learning with Errors

0 references

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

A minimal model for secure computation (extended abstract)

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Two-round MPC: information-theoretic and black-box

0 references

Two-round multiparty secure computation minimizing public key operations

0 references

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

0 references

Two-round multiparty secure computation from minimal assumptions

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

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

0 references

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Constant-Round MPC with Fairness and Guarantee of Output Delivery

0 references

Efficient Non-interactive Secure Computation

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

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

0 references

Multi-key FHE from LWE, Revisited

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

10.1007/978-3-030-77886-6_25

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2056764

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