Round-efficient black-box construction of composable multi-party computation
From MaRDI portal
Recommendations
- Round-efficient black-box construction of composable multi-party computation
- Constant-round black-box construction of composable multi-party computation protocol
- Round-optimal black-box two-party computation
- On Secure Multi-party Computation in Black-Box Groups
- Round-optimal secure multi-party computation
- Round-optimal secure multi-party computation
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Cites work
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A black-box construction of non-malleable encryption from semantically secure encryption
- A unified framework for UC from only OT
- Adaptive hardness and composable security in the plain model from standard assumptions
- Bit commitment using pseudorandomness
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions for secure computation
- Black-box constructions of composable protocols without set-up
- Black-box constructions of protocols for secure computation
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent zero knowledge, revisited
- Concurrently secure computation in constant rounds
- Constant round non-malleable protocols using one way functions
- Constant-round black-box construction of composable multi-party computation protocol
- Founding Cryptography on Oblivious Transfer – Efficiently
- Magic functions
- New notions of security: achieving universal composability without trusted setup
- Nonmalleable Cryptography
- On the limitations of universally composable two-party computation without set-up assumptions
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Theory of Cryptography
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
Cited in
(7)- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Round-efficient black-box construction of composable multi-party computation
- On Secure Multi-party Computation in Black-Box Groups
- Constant-round black-box construction of composable multi-party computation protocol
- CDS composition of multi-round protocols
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
This page was built for publication: Round-efficient black-box construction of composable multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715857)
