scientific article
From MaRDI portal
Publication:4035736
zbMath0789.68061MaRDI QIDQ4035736
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
distributed systemszero-knowledge proofssecret reconstructionsecret multiplicationsecure multiparty protocol
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed algorithms (68W15)
Related Items (91)
Compilation of function representations for secure computing paradigms ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Honest majority MPC with abort with minimal online communication ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Constant-round client-aided secure comparison protocol ⋮ Secure multi-party computation in large networks ⋮ Highly efficient OT-based multiplication protocols ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ Secure computation with preprocessing via function secret sharing ⋮ More efficient oblivious transfer extensions ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ A theoretical and empirical evaluation of an algorithm for self-healing computation ⋮ How to simulate it in Isabelle: towards formal proof for secure multi-party computation ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ The return of the SDitH ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ High-throughput secure three-party computation with an honest majority ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Authenticated garbling from simple correlations ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Amortizing division and exponentiation ⋮ Random sources in private computation ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Secure message transmission in asynchronous networks ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Secure computation with low communication from cross-checking ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ Multi-party computation with conversion of secret sharing ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Secure Outsourced Computation ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ On the exact round complexity of secure three-party computation ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Actively secure setup for SPDZ ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Efficient two-party exponentiation from quotient transfer ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC ⋮ The price of active security in cryptographic protocols
This page was built for publication:
