scientific article; zbMATH DE number 176564
From MaRDI portal
Publication:4035736
Recommendations
Cited in
(only showing first 100 items - show all)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- 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
- Secure computation with low communication from cross-checking
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Reducing communication channels in MPC
- Randomness versus fault-tolerance
- Efficient asynchronous verifiable secret sharing and multiparty computation
- 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
- Masked triples. Amortizing multiplication triples across conditionals
- Actively secure setup for SPDZ
- 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
- 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
- \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
- Improving the efficiency of AES protocols in multi-party computation
- Efficient noise generation to achieve differential privacy with applications to secure multiparty 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
- Highly efficient OT-based multiplication protocols
- Secure multiparty computation with sublinear preprocessing
- Secure non-interactive simulation: feasibility and rate
- Secure computation with preprocessing via function secret sharing
- Distributing any elliptic curve based protocol
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Efficient, actively secure MPC with a dishonest majority: a survey
- Secure multi-party computation in large networks
- More efficient oblivious transfer extensions
- Joint encryption and message-efficient secure computation
- On the exact round complexity of best-of-both-worlds multi-party computation
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Efficient fully secure computation via distributed zero-knowledge proofs
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On communication-efficient asynchronous MPC with adaptive security
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- Distribution design
- Better preprocessing for secure multiparty computation
- Linear overhead optimally-resilient robust MPC using preprocessing
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Secure outsourced computation
- Efficient secure multiparty computation with identifiable abort
- scientific article; zbMATH DE number 4191076 (Why is no real title available?)
- Client-aided two-party secure interval test protocol
- Improved multiplication triple generation over rings via RLWE-based AHE
- Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
- Asynchronous Multi-Party Computation with Quadratic Communication
- Efficient implementation of the Orlandi protocol
- Improved primitives for secure multiparty integer computation
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 1024062 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- scientific article; zbMATH DE number 1418292 (Why is no real title available?)
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Atomic Secure Multi-party Multiplication with Low Communication
- Efficient Simultaneous Broadcast
- A Latency-Free Election Scheme
- A Single Initialization Server for Multi-party Cryptography
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Scalable Secure Multiparty Computation
- Public Key Cryptography - PKC 2006
- Information Security and Cryptology - ICISC 2005
- On the exact round complexity of secure three-party computation
- On the local leakage resilience of linear secret sharing schemes
- Efficient perfectly secure computation with optimal resilience
- TinyKeys: a new approach to efficient multi-party computation
- Multi-theorem preprocessing NIZKs from lattices
- Low cost constant round MPC combining BMR and oblivious transfer
- Efficient perfectly secure computation with optimal resilience
- \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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035736)
