| Constant round maliciously secure 2PC with function-independent preprocessing using LEGO JB Nielsen, T Schneider, R Trifiletti Cryptology ePrint Archive, 2016 | 60 | 2016 |
| TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation N Döttling, S Ghosh, JB Nielsen, T Nilges, R Trifiletti Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 53 | 2017 |
| DUPLO: unifying cut-and-choose for garbled circuits V Kolesnikov, JB Nielsen, M Rosulek, N Trieu, R Trifiletti Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 39 | 2017 |
| On the complexity of additively homomorphic UC commitments TK Frederiksen, TP Jakobsen, JB Nielsen, R Trifiletti Theory of Cryptography Conference, 542-565, 2015 | 39 | 2015 |
| TinyLEGO: An interactive garbling scheme for maliciously secure two-party computation TK Frederiksen, TP Jakobsen, JB Nielsen, R Trifiletti Cryptology ePrint Archive, 2015 | 36 | 2015 |
| Additively homomorphic UC commitments with optimal amortized overhead I Cascudo, I Damgård, B David, I Giacomelli, JB Nielsen, R Trifiletti IACR International Workshop on Public Key Cryptography, 495-515, 2015 | 34 | 2015 |
| SplitCommit: implementing and analyzing homomorphic UC commitments P Rindal, R Trifiletti Cryptology ePrint Archive, 2017 | 5 | 2017 |
| Amortizing Maliciously Secure Two-party Computation R Trifiletti Department of Computer Science, Aarhus University, 2017 | | 2017 |
| On the complexity of additively homomorphic UC commitments TK Frederiksen, TP Jakobsen, JB Nielsen, R Trifiletti Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015 | | 2015 |
| TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation R Trifiletti, JB Nielsen, TP Jakobsen, TK Frederiksen | | 2015 |
