Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. - Hao Chen 095; Ronald Cramer; Robbert de Haan; Ignacio Cascudo Pueyo (EUROCRYPT, 2008)

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. - Ignacio Cascudo Pueyo; Hao Chen 095; Ronald Cramer; Chaoping Xing (CRYPTO, 2009)

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (CRYPTO, 2011)

Bounds on the Threshold Gap in Secret Sharing over Small Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

The Arithmetic Codex. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing; An Yang (IEEE Trans. Inf. Theory, 2012)

Bounds on the Threshold Gap in Secret Sharing and its Applications. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2013)

On powers of codes. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Gilles Zémor (IACR Cryptol. ePrint Arch., 2014)

Additively Homomorphic UC commitments with Optimal Amortized Overhead. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen; Roberto Trifiletti (IACR Cryptol. ePrint Arch., 2014)

Server-Aided Two-Party Computation with Simultaneous Corruption. - Ignacio Cascudo; Ivan Damgård; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2014)

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Powers of codes and applications to cryptography. - Ignacio Cascudo (ITW, 2015)

On Secret Sharing with Nonlinear Product Reconstruction. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Carles Padró; Chaoping Xing (SIAM J. Discret. Math., 2015)

Squares of Random Linear Codes. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Gilles Zémor (IEEE Trans. Inf. Theory, 2015)

Secret Sharing Schemes with Algebraic Properties and Applications. - Ignacio Cascudo (CiE, 2016)

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. - Ignacio Cascudo; Ivan Damgård; Felipe Lacerda; Samuel Ranellucci (TCC (B1), 2016)

Rate-1, Linear Time and Additively Homomorphic UC Commitments. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2016)

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement. - Ignacio Cascudo; Ivan Damgård; Felipe Lacerda; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2016)

SCRAPE: Scalable Randomness Attested by Public Entities. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2017)

Resource-efficient OT combiners with active security. - Ignacio Cascudo; Ivan Damgård; Oriol Farràs; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2017)

Actively Secure OT-Extension from q-ary Linear Codes. - Ignacio Cascudo; René Bødker Christensen; Jaron Skovsted Gundersen (IACR Cryptol. ePrint Arch., 2018)

Amortized Complexity of Information-Theoretically Secure MPC Revisited. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2018)

Efficient UC Commitment Extension with Homomorphism for Free (and Applications). - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Rafael Dowsley; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2018)

Privacy Preserving Recursive Least Squares Solutions. - Katrine Tjell; Ignacio Cascudo; Rafael Wisniewski (ECC, 2019)

Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing. - Qiongxiu Li; Ignacio Cascudo; Mads Græsbøll Christensen (EUSIPCO, 2019)

On Squares of Cyclic Codes. - Ignacio Cascudo (IEEE Trans. Inf. Theory, 2019)

Improved Bounds on the Threshold Gap in Ramp Secret Sharing. - Ignacio Cascudo; Jaron Skovsted Gundersen; Diego Ruano (IEEE Trans. Inf. Theory, 2019)

Squares of matrix-product codes. - Ignacio Cascudo; Jaron Skovsted Gundersen; Diego Ruano (Finite Fields Their Appl., 2020)

Flexible and Efficient Verifiable Computation on Encrypted Data. - Alexandre Bois; Ignacio Cascudo; Dario Fiore 001; Dongwoo Kim 003 (IACR Cryptol. ePrint Arch., 2020)

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2020)

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. - Ignacio Cascudo; Jaron Skovsted Gundersen (IACR Cryptol. ePrint Arch., 2020)

A Note on Secure Multiparty Computation via Higher Residue Symbol Techniques. - Ignacio Cascudo; Reto Schnyder (IACR Cryptol. ePrint Arch., 2020)

Mt. Random: Multi-Tiered Randomness Beacons. - Ignacio Cascudo; Bernardo David; Omer Shlomovits; Denis Varlakov (IACR Cryptol. ePrint Arch., 2021)

On Interactive Oracle Proofs for Boolean R1CS Statements. - Ignacio Cascudo; Emanuele Giunta (IACR Cryptol. ePrint Arch., 2021)

A note on secure multiparty computation via higher residue symbols. - Ignacio Cascudo; Reto Schnyder (J. Math. Cryptol., 2021)

Vector Commitments over Rings and Compressed $ varSigma $-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Damgård; Daniel Escudero 001 (TCC (1), 2022)

Vector Commitments over Rings and Compressed Σ-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Bjerre Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2022)

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. - Ignacio Cascudo; Bernardo David; Lydia Garms; Anders Konring (IACR Cryptol. ePrint Arch., 2022)

On Sigma-Protocols and (packed) Black-Box Secret Sharing Schemes. - Claudia Bartoli; Ignacio Cascudo (IACR Cryptol. ePrint Arch., 2023)

Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2023)

Verifiable Secret Sharing from Symmetric Key Cryptography with Improved Optimistic Complexity. - Ignacio Cascudo; Daniele Cozzo; Emanuele Giunta (IACR Cryptol. ePrint Arch., 2024)

On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More. - Matteo Campanelli; Mario Carrillo; Ignacio Cascudo; Dario Fiore 001; Danilo Francati; Rosario Gennaro (IACR Cryptol. ePrint Arch., 2025)

Verifiable Computation for Approximate Homomorphic Encryption Schemes. - Ignacio Cascudo; Anamaria Costache; Daniele Cozzo; Dario Fiore 001; Antonio Guimarães; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2025)