Adaptively secure MPC with sublinear communication complexity
From MaRDI portal
Publication:5925696
DOI10.1007/s00145-023-09446-6OpenAlexW2908156179MaRDI QIDQ5925696
Abhi Shelat, Ran Cohen, Daniel Wichs
Publication date: 13 April 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09446-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient one-sided adaptively secure computation
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Must the communication graph of MPC protocols be an expander?
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Two-round adaptively secure multiparty computation from standard assumptions
- Threshold cryptosystems from threshold fully homomorphic encryption
- The price of low communication in secure multi-party computation
- Laconic oblivious transfer and its applications
- Fairness versus guaranteed output delivery in secure multiparty computation
- Efficient adaptively secure zero-knowledge from garbled circuits
- Round-optimal secure multiparty computation with honest majority
- Adaptive versus non-adaptive security of multi-party protocols
- Security and composition of multiparty cryptographic protocols
- From FE combiners to secure MPC and back
- Secure MPC: laziness leads to GOD
- Adaptive Security with Quasi-Optimal Rate
- Adaptively Secure Computation with Partial Erasures
- Asynchronous Secure Multiparty Computation in Constant Time
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
- On Adaptively Secure Multiparty Computation with a Short CRS
- On the Power of Secure Two-Party Computation
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- On Adaptively Secure Protocols
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Semi-homomorphic Encryption and Multiparty Computation
- How to share a secret
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Trapdoors for hard lattices and new cryptographic constructions
- Adaptively Secure Broadcast
- Universally composable two-party and multi-party secure computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Adaptively Secure Two-Party Computation with Erasures
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Universally Composable Synchronous Computation
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
- Equivocating Yao
- Fully homomorphic encryption using ideal lattices
- Bi-Deniable Public-Key Encryption
- How to use indistinguishability obfuscation
- Non-committing Encryption from Φ-hiding
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Generating Shorter Bases for Hard Random Lattices
- New Techniques for Noninteractive Zero-Knowledge
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Better Two-Round Adaptive Multi-party Computation
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
- On the exact round complexity of secure three-party computation
This page was built for publication: Adaptively secure MPC with sublinear communication complexity
