An Efficient Framework for Unconditionally Secure Multiparty Computation
From MaRDI portal
Publication:2979115
DOI10.1109/TIT.2016.2614685zbMATH Open1359.94580MaRDI QIDQ2979115FDOQ2979115
Authors: Ashish Choudhury, Arpita Patra 
Publication date: 2 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (25)
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Efficient perfectly secure computation with optimal resilience
- TinyKeys: a new approach to efficient multi-party computation
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Characterization of secure multiparty computation without broadcast
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- Network-agnostic multi-party computation revisited (extended abstract)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
- Perfect asynchronous MPC with linear communication overhead
- An equational approach to secure multi-party computation
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Function-Dependent Commitments for Verifiable Multi-party Computation
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
This page was built for publication: An Efficient Framework for Unconditionally Secure Multiparty Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979115)
