Adaptively secure MPC with sublinear communication complexity
From MaRDI portal
Recommendations
- Adaptively secure MPC with sublinear communication complexity
- The price of low communication in secure multi-party computation
- Adaptively secure multi-party computation from LWE (via equivocal FHE)
- Two-round adaptively secure multiparty computation from standard assumptions
- Adaptive security of multi-party protocols, revisited
Cites work
- A new approach to practical active-secure two-party computation
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- Adaptive security with quasi-optimal rate
- Adaptive versus non-adaptive security of multi-party protocols
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Adaptively secure broadcast
- Adaptively secure computation with partial erasures
- 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
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Asynchronous secure multiparty computation in constant time
- Better two-round adaptive multi-party computation
- Bi-deniable public-key encryption
- Breaking the circuit size barrier for secure computation under DDH
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient one-sided adaptively secure computation
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Fairness versus guaranteed output delivery in secure multiparty computation
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Founding Cryptography on Oblivious Transfer – Efficiently
- From FE combiners to secure MPC and back
- Fully homomorphic encryption using ideal lattices
- Generating shorter bases for hard random lattices
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to share a secret
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- scientific article; zbMATH DE number 1088227 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1942420 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- Improved non-committing encryption with applications to adaptively secure protocols
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Laconic oblivious transfer and its applications
- Leveled fully homomorphic signatures from standard lattices
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Must the communication graph of MPC protocols be an expander?
- New techniques for noninteractive zero-knowledge
- Non-committing encryption from -hiding
- On Adaptively Secure Multiparty Computation with a Short CRS
- On adaptively secure protocols
- On lattices, learning with errors, random linear codes, and cryptography
- On the exact round complexity of secure three-party computation
- On the Power of Secure Two-Party Computation
- Public-coin differing-inputs obfuscation and its applications
- Round-optimal secure multiparty computation with honest majority
- Secure Arithmetic Computation with No Honest Majority
- Secure MPC: laziness leads to GOD
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
- The price of low communication in secure multi-party computation
- Threshold cryptosystems from threshold fully homomorphic encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-round adaptively secure multiparty computation from standard assumptions
- Universally composable synchronous computation
- Universally composable two-party and multi-party secure computation
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Cited in
(8)- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Insured MPC: efficient secure computation with financial penalties
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Adaptively secure MPC with sublinear communication complexity
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Weakly super-invertible matrices and constant communication dishonest majority MPC
This page was built for publication: Adaptively secure MPC with sublinear communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925696)
