The Exact Round Complexity of Secure Computation

DOI10.1007/978-3-662-49896-5_16zbMATH Open1371.94637OpenAlexW2495293033MaRDI QIDQ5739211FDOQ5739211

Authors: Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou 

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_16

Recommendations

• The round complexity of secure computation against covert adversaries
• The round complexity of perfectly secure general VSS
• On the round complexity of covert computation
• On the round complexity of secure quantum computation
• The Round Complexity of Verifiable Secret Sharing Revisited
• On the exact round complexity of secure three-party computation
• On the exact round complexity of secure three-party computation
• Advances in Cryptology – CRYPTO 2004
• On the communication complexity of secure computation
• Perfect secure computation in two rounds

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (40)

• Succinct non-interactive secure computation
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Post-quantum multi-party computation
• Round-optimal black-box secure computation from two-round malicious OT
• On the round complexity of secure quantum computation
• Randomized functions with high round complexity
• Broadcast-optimal four-round MPC in the plain model
• On the exact round complexity of secure three-party computation
• What security can we achieve within 4 rounds?
• Round-optimal secure multi-party computation
• Perfect secure computation in two rounds
• Round optimal black-box ``commit-and-prove
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Two-round concurrent 2PC from sub-exponential LWE
• The round complexity of quantum zero-knowledge
• Concurrent non-malleable commitments (and more) in 3 rounds
• On the round complexity of black-box secure MPC
• Maliciously-secure MrNISC in the plain model
• Complexity of secure sets
• What Security Can We Achieve Within 4 Rounds?
• Best of both worlds. Revisiting the spymasters double agent problem
• List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
• Reusable secure computation in the plain model
• Round-optimal black-box MPC in the plain model
• Round-optimal and communication-efficient multiparty computation
• More efficient constant-round multi-party computation from BMR and SHE
• Round-optimal multi-party computation with identifiable abort
• The feasibility of outsourced database search in the plain model
• From FE combiners to secure MPC and back
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Oblivious transfer from trapdoor permutations in minimal rounds
• Title not available (Why is that?)
• A new approach to efficient non-malleable zero-knowledge
• On the exact round complexity of best-of-both-worlds multi-party computation
• Blockchains enable non-interactive MPC
• Statistical security in two-party computation revisited
• Title not available (Why is that?)
• On the exact round complexity of self-composable two-party computation
• On the enumeration of minimal non-pairwise compatibility graphs
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

This page was built for publication: The Exact Round Complexity of Secure Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739211)