Ignacio Cascudo
Ignacio Cascudo
Assistant Research Professor, IMDEA Software Institute
Verified email at
Cited by
Cited by
SCRAPE: Scalable randomness attested by public entities
I Cascudo, B David
Applied Cryptography and Network Security: 15th International Conference …, 2017
Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field
I Cascudo, H Chen, R Cramer, C Xing
Advances in Cryptology-CRYPTO 5677, 466-486, 2009
Squares of random linear codes
I Cascudo, R Cramer, D Mirandola, G Zémor
IEEE Transactions on Information Theory 61 (3), 1159-1173, 2015
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
I Cascudo, R Cramer, C Xing
Advances in Cryptology-CRYPTO 2011, 685-705, 2011
Bounds on the threshold gap in secret sharing and its applications
I Cascudo, R Cramer, C Xing
IEEE Transactions on Information Theory 59 (9), 5600-5612, 2013
Amortized complexity of information-theoretically secure MPC revisited
I Cascudo, R Cramer, C Xing, C Yuan
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Rate-1, linear time and additively homomorphic UC commitments
I Cascudo, I Damgård, B David, N Döttling, JB Nielsen
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
Torsion limits and Riemann-Roch systems for function fields and applications
I Cascudo, R Cramer, C Xing
IEEE Transactions on Information Theory 60 (7), 3871-3888, 2014
ALBATROSS: publicly attestable batched randomness based on secret sharing
I Cascudo, B David
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
Strongly multiplicative ramp schemes from high degree rational points on curves
H Chen, R Cramer, R De Haan, I Cascudo Pueyo
Advances in Cryptology – EUROCRYPT 2008, 451-470, 2008
Additively homomorphic UC commitments with optimal amortized overhead
I Cascudo, I Damgård, B David, I Giacomelli, JB Nielsen, R Trifiletti
Public-Key Cryptography -- PKC 2015, 495-515, 2015
The arithmetic codex
I Cascudo, R Cramer, C Xing
2012 IEEE Information Theory Workshop, 75-79, 2012
Privacy-preserving distributed average consensus based on additive secret sharing
Q Li, I Cascudo, MG Christensen
2019 27th European Signal Processing Conference (EUSIPCO), 1-5, 2019
Flexible and efficient verifiable computation on encrypted data
A Bois, I Cascudo, D Fiore, D Kim
Public-Key Cryptography–PKC 2021: 24th IACR International Conference on …, 2021
Asymptotic bound for multiplication complexity in the extensions of small finite fields
I Cascudo, R Cramer, C Xing, A Yang
IEEE Transactions on Information Theory 58 (7), 4930-4935, 2011
On squares of cyclic codes
I Cascudo
IEEE Transactions on Information Theory 65 (2), 1034-1047, 2018
On asymptotically good strongly multiplicative linear secret sharing
I Cascudo Pueyo
A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
I Cascudo, JS Gundersen
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
I Cascudo, I Damgård, F Lacerda, S Ranellucci
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
Squares of matrix-product codes
I Cascudo, JS Gundersen, D Ruano
Finite Fields and Their Applications 62, 101606, 2020
The system can't perform the operation now. Try again later.
Articles 1–20