Round-optimal secure multi-party computation (Q5918346)

scientific article; zbMATH DE number 7376826

Language	Label	Description	Also known as
English	Round-optimal secure multi-party computation	scientific article; zbMATH DE number 7376826

Statements

instance of

scholarly article

0 references

title

Round-optimal secure multi-party computation (English)

0 references

author

Shai Halevi

0 references

Carmit Hazay

0 references

Antigoni Polychroniadou

0 references

Muthuramakrishnan Venkitasubramaniam

0 references

published in

Journal of Cryptology

0 references

publication date

30 July 2021

0 references

zbMATH Keywords

secure multi-party computation

0 references

garbled circuits

0 references

round complexity

0 references

additive errors

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-021-09382-3

0 references

cites work

Round-optimal secure multiparty computation with honest majority

0 references

A new approach to round-optimal secure multiparty computation

0 references

Computationally private randomizing polynomials and their applications

0 references

Cryptography in $NC^0$

0 references

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

0 references

Round optimal concurrent MPC via strong simulation

0 references

Promise zero knowledge and its applications to round optimal MPC

0 references

Four round secure computation without setup

0 references

$k$-round multiparty computation from $k$-round oblivious transfer via garbled interactive circuits

0 references

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors

0 references

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

0 references

Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds

0 references

Round-optimal secure two-party computation from trapdoor permutations

0 references

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

0 references

Scalable Secure Multiparty Computation

0 references

Q2724587

0 references

Zaps and Their Applications

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Circuits resilient to additive attacks with applications to secure computation

0 references

Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits

0 references

Binary AMD Circuits from Secure Multiparty Computation

0 references

On the Exact Round Complexity of Self-composable Two-Party Computation

0 references

Probabilistic encryption

0 references

The Exact Round Complexity of Secure Computation

0 references

Foundations of Cryptography

0 references

Foundations of Cryptography

0 references

Constant round non-malleable protocols using one way functions

0 references

Two-round multiparty secure computation from minimal assumptions

0 references

Black-Box Constructions of Protocols for Secure Computation

0 references

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

0 references

Low cost constant round MPC combining BMR and oblivious transfer

0 references

Round optimal concurrent non-malleability from polynomial hardness

0 references

Q4434900

0 references

Constant-round non-malleable commitments from any one-way function

0 references

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Bit commitment using pseudorandomness

0 references

Maliciously Circuit-Private FHE

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Bounded-concurrent secure multi-party computation with a dishonest majority

0 references

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

0 references

Identifiers

zbMATH Open document ID

1469.94101

0 references

DOI

10.1007/s00145-021-09382-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5918346