Daniel E. Escudero

From MaRDI portal
Person:1644781

Available identifiers

zbMath Open escudero.daniel-eMaRDI QIDQ1644781

List of research outcomes





PublicationDate of PublicationType
Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions2024-12-13Paper
Phoenix: secure computation in an unstable network with dropouts and comebacks2024-11-22Paper
On information-theoretic secure multiparty computation with local repairability2024-11-12Paper
On fully-secure honest majority MPC without \(n^2\) round overhead2024-10-16Paper
Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications2024-08-30Paper
On linear communication complexity for (maximally) fluid MPC2024-02-02Paper
\textsc{SuperPack}: dishonest majority MPC with constant online communication2023-12-08Paper
Vector commitments over rings and compressed \(\varSigma \)-protocols2023-08-14Paper
More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings2023-06-12Paper
Improved single-round secure multiplication using regenerating codes2023-05-12Paper
Information-theoretically secure MPC against mixed dynamic adversaries2023-03-31Paper
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)2023-03-29Paper
Efficient protocols for oblivious linear function evaluation from ring-LWE2022-12-16Paper
Improved primitives for MPC over mixed arithmetic-binary circuits2022-11-09Paper
Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms2022-06-15Paper
Honest majority MPC with abort with minimal online communication2022-06-15Paper
Efficient information-theoretic multi-party computation over non-commutative rings2022-04-22Paper
An efficient passive-to-active compiler for honest-majority MPC over rings2022-03-21Paper
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings2020-04-30Paper
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority2018-09-26Paper
Rank analysis of cubic multivariate cryptosystems2018-06-22Paper
Efficient ZHFE Key Generation2016-04-26Paper

Research outcomes over time

This page was built for person: Daniel E. Escudero