Pages that link to "Item:Q3612571"
From MaRDI portal
The following pages link to Scalable and Unconditionally Secure Multiparty Computation (Q3612571):
Displaying 50 items.
- Quantum private comparison against decoherence noise (Q352936) (← links)
- Fault-tolerate quantum private comparison based on GHZ states and ECC (Q379327) (← links)
- Quantum private comparison based on phase encoding of single photons (Q458570) (← links)
- Decentralized polling with respectable participants (Q663428) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm (Q2238607) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Secure \(k\)-skyband computation framework in distributed multi-party databases (Q2660865) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups (Q2794492) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations (Q3404401) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Efficient and Decentralized Polling Protocol for General Social Networks (Q5207912) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
