The following pages link to Daniel E. Escudero (Q1644781):
Displayed 18 items.
- Rank analysis of cubic multivariate cryptosystems (Q1644784) (← links)
- (Q1784114) (redirect page) (← links)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority (Q1784115) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Efficient protocols for oblivious linear function evaluation from ring-LWE (Q2106636) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← 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)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- Efficient ZHFE Key Generation (Q2802620) (← links)
- \textsc{SuperPack}: dishonest majority MPC with constant online communication (Q6061359) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Improved single-round secure multiplication using regenerating codes (Q6157517) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- On linear communication complexity for (maximally) fluid MPC (Q6186594) (← links)