| SCRAPE: Scalable randomness attested by public entities I Cascudo, B David International Conference on Applied Cryptography and Network Security, 537-556, 2017 | 99 | 2017 |
| 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 | 75 | 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 | 63 | 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 | 53 | 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 | 47 | 2013 |
| 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 | 41 | 2014 |
| 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 | 39 | 2016 |
| Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan Annual International Cryptology Conference, 395-426, 2018 | 38 | 2018 |
| 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 | 33 | 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 | 31 | 2015 |
| Albatross: publicly attestable batched randomness based on secret sharing I Cascudo, B David International Conference on the Theory and Application of Cryptology and …, 2020 | 24 | 2020 |
| The arithmetic codex I Cascudo, R Cramer, C Xing 2012 IEEE Information Theory Workshop, 75-79, 2012 | 24 | 2012 |
| 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 | 20 | 2011 |
| 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 | 18 | 2019 |
| On squares of cyclic codes I Cascudo IEEE Transactions on Information Theory 65 (2), 1034-1047, 2018 | 14 | 2018 |
| On asymptotically good strongly multiplicative linear secret sharing I Cascudo Pueyo | 12* | 2010 |
| A secret-sharing based MPC protocol for boolean circuits with good amortized complexity I Cascudo, JS Gundersen Theory of Cryptography Conference, 652-682, 2020 | 11 | 2020 |
| Flexible and efficient verifiable computation on encrypted data A Bois, I Cascudo, D Fiore, D Kim IACR International Conference on Public-Key Cryptography, 528-558, 2021 | 10 | 2021 |
| Privacy preserving recursive least squares solutions K Tjell, I Cascudo, R Wisniewski 2019 18th European Control Conference (ECC), 3490-3495, 2019 | 9 | 2019 |
| 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 Conference, 204-234, 2016 | 9 | 2016 |
Chaoping XINGShanghai Jiaotong UniversityVerified email at sjtu.edu.cn
