On Adaptively Secure Multiparty Computation with a Short CRS
From MaRDI portal
Recommendations
- Efficient multiparty computations secure against an adaptive adversary
- scientific article; zbMATH DE number 1256784
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Adaptively secure multi-party computation with dishonest majority
- Two-round adaptively secure multiparty computation from standard assumptions
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Efficient secure multi-party computation. (Extended Abstract)
- Adaptively Secure Two-Party Computation with Erasures
- Efficient general-adversary multi-party computation
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
Cites work
- Adaptively secure multi-party computation from LWE (via equivocal FHE)
- Adaptively secure multi-party computation with dishonest majority
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure Two-Party Computation with Erasures
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Composition of secure multi-party protocols. A comprehensive study.
- Computational Complexity
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Founding Cryptography on Oblivious Transfer – Efficiently
- Generation of shared RSA keys by two parties
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- Improved non-committing encryption schemes based on a general complexity assumption
- Leakage-Tolerant Interactive Protocols
- On complete primitives for fairness
- On the (im)possibility of obfuscating programs (extended abstract)
- On the limitations of universally composable two-party computation without set-up assumptions
- One-Sided Adaptively Secure Two-Party Computation
- Round-optimal secure two-party computation
- Security and composition of multiparty cryptographic protocols
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-round secure MPC from indistinguishability obfuscation
- Universally composable commitments (extended abstract)
- Universally composable two-party and multi-party secure computation
Cited in
(6)- Two-round adaptively secure multiparty computation from standard assumptions
- Adaptively secure computation for RAM programs
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Adaptively secure MPC with sublinear communication complexity
This page was built for publication: On Adaptively Secure Multiparty Computation with a Short CRS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827714)
