Scalable Multiparty Computation with Nearly Optimal Work and Resilience

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Annual International Cryptology Conference

• Publication date

  2008-08-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-85174-5_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Perfectly-Secure MPC with Linear Communication Complexity

  2008influential reference
• Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings

  2007cited by this paper
• Towards Optimal and Efficient Perfectly Secure Message Transmission

  2007cited by this paper
• Scalable and Unconditionally Secure Multiparty Computation

  2007cited by this paper
• How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

  2007cited by this paper
• Efficient Multi-party Computation with Dispute Control

  2006cited by this paper
• Optimally efficient multi-valued byzantine agreement

  2006cited by this paper
• Robust Multiparty Computation with Linear Communication Complexity

  2006cited by this paper
• Scalable Secure Multiparty Computation

  2006influential reference
• Information-theoretically secure protocols and security under composition

  2006cited by this paper
• Fast Computation of Large Distributions and Its Cryptographic Applications

  2005cited by this paper
• Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings

  2005cited by this paper
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

  2005influential reference
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

  2005cited by this paper
• COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS

  2005cited by this paper
• Advances in Cryptology – CRYPTO 2004

  2004cited by this paper
• Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption

  2003cited by this paper
• Advances in Cryptology - CRYPTO 2003

  2003cited by this paper
• Composition of Secure Multi-Party Protocols: A Comprehensive Study

  2003cited by this paper
• Universally composable two-party and multi-party secure computation

  2002cited by this paper
• Universally composable security: a new paradigm for cryptographic protocols

  2001influential reference
• Robustness for Free in Unconditional Multi-party Computation

  2001cited by this paper
• Self Protecting Pirates and Black-Box Traitor Tracing

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT 2001

  2001cited by this paper
• Multiparty Computation from Threshold Homomorphic Encryption

  2000cited by this paper
• Player Simulation and General Adversary Structures in Perfect Multiparty Computation

  2000cited by this paper
• Efficient Secure Multi-party Computation

  2000cited by this paper
• Mix and Match: Secure Function Evaluation via Ciphertexts

  2000cited by this paper
• Advances in Cryptology — ASIACRYPT 2000

  2000cited by this paper
• Efficient Multiparty Computations Secure Against an Adaptive Adversary

  1999cited by this paper
• Advances in Cryptology — EUROCRYPT ’99

  1999cited by this paper
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

  1998cited by this paper
• Fair exchange with a semi-trusted third party (extended abstract)

  1997influential reference
• Adaptively secure multi-party computation

  1996cited by this paper
• Joint encryption and message-efficient secure computation

  1993cited by this paper
• Communication complexity of secure computation (extended abstract)

  1992cited by this paper
• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  1988cited by this paper
• Multiparty unconditionally secure protocols

  1988cited by this paper
• Multiparty Unconditionally Secure Protocols (Extended Abstract)

  1988influential reference
• An O(log n) expected rounds randomized byzantine generals protocol

  1987influential reference
• How to play ANY mental game

  1987cited by this paper
• Theory and Applications of Trapdoor Functions (Extended Abstract)

  1982cited by this paper
• Theory and application of trapdoor functions

  1982cited by this paper
• How to share a secret

  1979cited by this paper
• Ramanujan Graphs

  1965cited by this paper

• Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions

  2025cites this paper
• Load-Balanced Server-Aided MPC in Heterogeneous Computing

  2025cites this paper
• Safeguarding Privacy for Cloud Computing's Encrypted Data Using Association Rule Mining Algorithm and FP Growth Algorithm

  2024cites this paper
• Optimal Load-Balanced Scalable Distributed Agreement

  2024cites this paper
• On Information-Theoretic Secure Multiparty Computation with Local Repairability

  2024cites this paper
• MPC-in-the-Head Framework without Repetition and its Applications to the Lattice-based Cryptography

  2024cites this paper
• Scalable Multiparty Computation from Non-linear Secret Sharing

  2024cites this paper
• Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience

  2024cites this paper
• Time Is Money, Friend! Timing Side-channel Attack against Garbled Circuit Frameworks

  2023cites this paper
• Time is money, friend! Timing Side-channel Attack against Garbled Circuit Constructions

  2023cites this paper
• Scalable Multiparty Garbling

  2023cites this paper
• MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More

  2023cites this paper
• Scalable Agreement Protocols with Optimal Optimistic Efficiency

  2023cites this paper
• How to Recover a Secret with O ( n ) Additions ∗

  2023cites this paper
• zkSaaS: Zero-Knowledge SNARKs as a Service

  2023cites this paper
• Cryptography with Weights: MPC, Encryption and Signatures

  2022cites this paper
• Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority

  2022cites this paper
• Verifiable privacy-preserving association rule mining using distributed decryption mechanism on the cloud

  2022cites this paper
• Publicly Accountable Robust Multi-Party Computation

  2022cites this paper
• Powers of Tau in Asynchrony

  2022cites this paper
• Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications

  2022cites this paper
• Threshold Cryptography as a Service (in the Multiserver and YOSO Models)

  2022cites this paper
• On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications

  2021cites this paper
• Order-C Secure Multiparty Computation for Highly Repetitive Circuits

  2021cites this paper
• Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation

  2021cites this paper
• A Permissioned Blockchain System for Secure Multiparty Computation

  2021cites this paper
• Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

  2021cites this paper
• Interaction-Preserving Compilers for Secure Computation

  2021cites this paper
• On the Bottleneck Complexity of MPC with Correlated Randomness

  2021cites this paper
• hbACSS: How to Robustly Share Many Secrets

  2021cites this paper
• Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities

  2020influential citation
• Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement

  2020influential citation
• Secure multiparty quantum computation based on Lagrange unitary operator

  2020cites this paper
• Crowd Verifiable Zero-Knowledge and End-to-end Verifiable Multiparty Computation

  2020cites this paper
• Paid and Anonymous Usage of Cloud Software

  2020cites this paper
• Information Security Applications: 21st International Conference, WISA 2020, Jeju Island, South Korea, August 26–28, 2020, Revised Selected Papers

  2020cites this paper
• Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups

  2020cites this paper
• Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?

  2020cites this paper
• Breaking the $O(\sqrt n)$-Bits Barrier: Balanced Byzantine Agreement with Polylog Bits Per-Party.

  2020cites this paper
• Multi-Party Threshold Private Set Intersection with Sublinear Communication

  2020cites this paper
• Pseudorandom Constructions: Computing in Parallel and Applications to Edit Distance Codes

  2019cites this paper
• CHURP: Dynamic-Committee Proactive Secret Sharing

  2019cites this paper
• Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing

  2019cites this paper
• VSS Made Simpler

  2019cites this paper
• HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication

  2019cites this paper
• Resource-Competitive Sybil Defenses

  2019cites this paper
• Network Oblivious Transfer by Srinivasan Raghuraman

  2018cites this paper
• Proactive Secure Multiparty Computation with a Dishonest Majority

  2018cites this paper
• Best of Both Worlds in Secure Computation, with Low Communication Overhead

  2018cites this paper
• The Bottleneck Complexity of Secure Multiparty Computation

  2018cites this paper
• From Fairness to Full Security in Multiparty Computation

  2018cites this paper
• Secure Computation with Low Communication from Cross-checking

  2018cites this paper
• Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation

  2018cites this paper
• Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II

  2017cites this paper
• Implementation of a Secure Multiparty Computation Protocol

  2017cites this paper
• μchain: How to Forget without Hard Forks

  2017influential citation
• Proactively Secure Cloud-Enabled Storage

  2017cites this paper
• Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0

  2017cites this paper
• Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network

  2017cites this paper
• Root Previous Hash Block Header i Smart Contract Root Account RootNonce Timestamp Transaction Root Previous Hash Block Header i-1 Smart Contract Root Account RootNonce Timestamp Transaction Root Previous Hash Block Header i + 1 Smart Contract Root

  2017influential citation
• Project-Team CASSIS On the Polling Problem for Social Networks

  2017cites this paper
• Private Data Aggregation on a Budget

  2017cites this paper
• Efficient robust secret sharing from expander graphs

  2017cites this paper
• Near-Optimal Secret Sharing and Error Correcting Codes in AC0

  2017cites this paper
• Proof of Work Without All the Work

  2017cites this paper
• On the Computational Overhead of MPC with Dishonest Majority

  2017cites this paper
• Private Computation with Genomic Data for Genome-Wide Association and Linkage Studies

  2016cites this paper
• Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

  2016cites this paper
• Network Oblivious Transfer

  2016cites this paper
• Efficient Server-Aided 2PC for Mobile Phones

  2016cites this paper
• Advances in Cryptology – CRYPTO 2016

  2016cites this paper
• On the Communication Required for Unconditionally Secure Multiplication

  2016cites this paper
• Proactive Secret Sharing with a Dishonest Majority

  2016cites this paper
• Resource-Efficient and Robust Distributed Computing

  2016cites this paper
• Partage de Données dans les Systèmes Collaboratifs : De la Synchronisation à la Protection des Données. (Data Sharing in Collaborative Systems: From Synchronization to Protection of Data)

  2016cites this paper
• Scalable and Robust Distributed Algorithms for Privacy-Preserving Applications

  2016cites this paper
• Bounded Indistinguishability and the Complexity of Recovering Secrets

  2016cites this paper
• Efficient and Decentralized Polling Protocol for General Social Networks

  2015cites this paper
• On the polling problem for decentralized social networks

  2015cites this paper
• Secure Multiparty Computation and Secret Sharing

  2015cites this paper
• On the Polling Problem for Decentralized Social Networks. (Problème de Sondage dans les Réseaux Sociaux Décentralisés )

  2015cites this paper
• Asymmetric Social Proximity Based Private Matching Protocols for Online Social Networks

  2015cites this paper
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

  2015cites this paper
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups

  2015influential citation
• Polynomial Evaluation and Side Channel Analysis

  2015cites this paper
• Recent Results in Scalable Multi-Party Computation

  2015cites this paper
• Optimally Resilient Asynchronous MPC with Linear Communication Complexity

  2015cites this paper
• Financial Cryptography and Data Security

  2014cites this paper
• Large-Scale Secure Computation

  2014cites this paper
• How to withstand mobile virus attacks, revisited

  2014influential citation
• Millions of Millionaires: Multiparty Computation in Large Networks

  2014cites this paper
• FleXOR: Flexible garbling for XOR gates that beats free-XOR

  2014cites this paper
• Adaptively Secure UC Constant Round Multi-Party Computation Protocols

  2014cites this paper
• The Crypto-democracy and the Trustworthy

  2014cites this paper
• Practical Distributed Privacy-Preserving Data Analysis at Large Scale

  2014cites this paper
• Secure Anonymous Broadcast

  2014cites this paper
• Scaling Private Set Intersection to Billion-Element Sets

  2014cites this paper
• Reducing the Overhead of MPC over a Large Population

  2014influential citation
• Efficient Polling Protocol for Decentralized Social Networks

  2014cites this paper
• Compact VSS and Efficient Homomorphic UC Commitments

  2014cites this paper