Ignacio Cascudo

Orcid: 0000-0001-5520-5386

Affiliations:
  • CWI Amsterdam


According to our database1, Ignacio Cascudo authored at least 41 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Verifiable Secret Sharing from Symmetric Key Cryptography with Improved Optimistic Complexity.
IACR Cryptol. ePrint Arch., 2024

2023
Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO.
IACR Cryptol. ePrint Arch., 2023

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

2022
YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model.
IACR Cryptol. ePrint Arch., 2022

Vector Commitments over Rings and Compressed Σ-Protocols.
IACR Cryptol. ePrint Arch., 2022

Vector Commitments over Rings and Compressed $\varSigma $-Protocols.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021
A note on secure multiparty computation via higher residue symbols.
J. Math. Cryptol., 2021

On Interactive Oracle Proofs for Boolean R1CS Statements.
IACR Cryptol. ePrint Arch., 2021

Mt. Random: Multi-Tiered Randomness Beacons.
IACR Cryptol. ePrint Arch., 2021

2020
A Note on Secure Multiparty Computation via Higher Residue Symbol Techniques.
IACR Cryptol. ePrint Arch., 2020

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity.
IACR Cryptol. ePrint Arch., 2020

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing.
IACR Cryptol. ePrint Arch., 2020

Flexible and Efficient Verifiable Computation on Encrypted Data.
IACR Cryptol. ePrint Arch., 2020

Squares of matrix-product codes.
Finite Fields Their Appl., 2020

2019
Improved Bounds on the Threshold Gap in Ramp Secret Sharing.
IEEE Trans. Inf. Theory, 2019

On Squares of Cyclic Codes.
IEEE Trans. Inf. Theory, 2019

Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing.
Proceedings of the 27th European Signal Processing Conference, 2019

Privacy Preserving Recursive Least Squares Solutions.
Proceedings of the 17th European Control Conference, 2019

2018
Efficient UC Commitment Extension with Homomorphism for Free (and Applications).
IACR Cryptol. ePrint Arch., 2018

Amortized Complexity of Information-Theoretically Secure MPC Revisited.
IACR Cryptol. ePrint Arch., 2018

Actively Secure OT-Extension from q-ary Linear Codes.
IACR Cryptol. ePrint Arch., 2018

2017
Resource-efficient OT combiners with active security.
IACR Cryptol. ePrint Arch., 2017

SCRAPE: Scalable Randomness Attested by Public Entities.
IACR Cryptol. ePrint Arch., 2017

2016
Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.
IACR Cryptol. ePrint Arch., 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Secret Sharing Schemes with Algebraic Properties and Applications.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Squares of Random Linear Codes.
IEEE Trans. Inf. Theory, 2015

On Secret Sharing with Nonlinear Product Reconstruction.
SIAM J. Discret. Math., 2015

Powers of codes and applications to cryptography.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications.
IEEE Trans. Inf. Theory, 2014

Server-Aided Two-Party Computation with Simultaneous Corruption.
IACR Cryptol. ePrint Arch., 2014

Additively Homomorphic UC commitments with Optimal Amortized Overhead.
IACR Cryptol. ePrint Arch., 2014

On powers of codes.
IACR Cryptol. ePrint Arch., 2014

2013
Bounds on the Threshold Gap in Secret Sharing and its Applications.
IEEE Trans. Inf. Theory, 2013

2012
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.
IEEE Trans. Inf. Theory, 2012

The Arithmetic Codex.
IACR Cryptol. ePrint Arch., 2012

Bounds on the Threshold Gap in Secret Sharing over Small Fields.
IACR Cryptol. ePrint Arch., 2012

2011
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2009
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over <i>Any</i> Fixed Finite Field.
Proceedings of the Advances in Cryptology, 2009

2008
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.
Proceedings of the Advances in Cryptology, 2008


  Loading...