| Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field I Cascudo, H Chen, R Cramer, C Xing Annual International Cryptology Conference, 466-486, 2009 | 59 | 2009 |
| SCRAPE: Scalable randomness attested by public entities I Cascudo, B David International Conference on Applied Cryptography and Network Security, 537-556, 2017 | 46 | 2017 |
| 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 | 36 | 2011 |
| Rate-1, linear time and additively homomorphic UC commitments I Cascudo, I Damgård, B David, N Döttling, JB Nielsen Annual International Cryptology Conference, 179-207, 2016 | 34 | 2016 |
| Squares of random linear codes I Cascudo, R Cramer, D Mirandola, G Zémor IEEE Transactions on Information Theory 61 (3), 1159-1173, 2015 | 32 | 2015 |
| 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 | 31 | 2008 |
| 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 | 29 | 2013 |
| 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 | 28 | 2015 |
| 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 | 27 | 2014 |
| 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 | 18 | 2011 |
| The arithmetic codex I Cascudo, R Cramer, C Xing 2012 IEEE Information Theory Workshop, 75-79, 2012 | 14 | 2012 |
| On asymptotically good strongly multiplicative linear secret sharing I Cascudo Pueyo | 13* | 2010 |
| Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan Annual International Cryptology Conference, 395-426, 2018 | 12 | 2018 |
| On squares of cyclic codes I Cascudo IEEE Transactions on Information Theory 65 (2), 1034-1047, 2018 | 9 | 2018 |
| Efficient UC commitment extension with homomorphism for free (and applications) I Cascudo, I Damgård, B David, N Döttling, R Dowsley, I Giacomelli International Conference on the Theory and Application of Cryptology and …, 2019 | 6 | 2019 |
| Improved bounds on the threshold gap in ramp secret sharing I Cascudo, JS Gundersen, D Ruano IEEE Transactions on Information Theory 65 (7), 4620-4633, 2019 | 5 | 2019 |
| Squares of matrix-product codes I Cascudo, JS Gundersen, D Ruano Finite Fields and Their Applications 62, 101606, 2020 | 3 | 2020 |
| 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 | 3 | 2019 |
| Privacy Preserving Recursive Least Squares Solutions K Tjell, I Cascudo, R Wisniewski 2019 18th European Control Conference (ECC), 3490-3495, 2019 | 2 | 2019 |
| Resource-efficient OT combiners with active security I Cascudo, I Damgård, O Farràs, S Ranellucci Theory of Cryptography Conference, 461-486, 2017 | 2 | 2017 |
Chaoping XINGNangyang Technological UniversityVerified email at ntu.edu.sg
