Pages that link to "Item:Q2790105"
From MaRDI portal
The following pages link to Simplified VSS and fast-track multiparty computations with applications to threshold cryptography (Q2790105):
Displaying 28 items.
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls (Q1633460) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Constructing ideal secret sharing schemes based on Chinese remainder theorem (Q1710679) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo (Q2146102) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Realistic versus Rational Secret Sharing (Q3297660) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Reducing the Complexity in the Distributed Computation of Private RSA Keys (Q3634497) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Threshold secret sharing with geometric algebras (Q6496087) (← links)
