Publications

This page provides a list of publications (including presentations) by the SODA project

2017

Meilof Veeningen (Philips), “SODA – Scalable Oblivious Data Analytics
Presentation at  Information and Networking Days on Horizon 2020 Big Data Public-Private Partnership topics (January 17) (slides)

Jesper Buus Nielsen, Samuel Ranellucci (Aarhus University), “On the Computational Overhead of MPC with Dishonest Majority”
Presentation at Public Key Cryptography Workshop (February 26)
Publication in PKC proceedings: DOI 10.1007/978-3-662-54388-7_13, preprint here

Meilof Veeningen (Philips), “Philips, Big Data & healthcare”
Presentation at Workshop “Big data og følsomme data”

Meilof Veeningen (Philips), “Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation”
Presentation at Workshop on Theory and Practice of Multiparty Computation (slides)
Presentation at AFRICACRYPT conference (May 25)
Publication in AFRICACRYPT proceedings: DOI 10.1007/978-3-319-31517-1_14, preprint here

Roberto Trifiletti (Aarhus University), “DUPLO: Unifying Cut-and-Choose for Garbled Circuits”
Presentation at Workshop on Theory and Practice of Multiparty Computation (slides)
Preprint here

Rafael Dowsley (Aarhus University), “Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation”
Paper in IEEE Transactions on Dependable and Secure Computing (Volume: PP, Issue: 99), preprint here

Peter Scholl (Aarhus University) et al., “Low Cost Constant Round MPC Combining BMR and Oblivious Transfer”
Paper at ASIACRYPT 2017

Jesper Buus Nielsen and Tobias Nilges (Aarhus University) et al., “Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead”
Paper at ASIACRYPT 2017

Prastudy Fauzi (Aarhus University) et al., “An Efficient Pairing-Based Shuffle Argument”
Paper at ASIACRYPT 2017

Helene Haagh, Claudio Orlandi (Aarhus University) et al., “Revealing Encryption for Partial Ordering”
IMA Cryptography and Coding 2017, preprint here

Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti (Aarhus University) et al.,“TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation”
Paper at ACM CCS 2017, preprint here

Jesper Buus Nielsen, Roberto Trifiletti (Aarhus University) et al., “DUPLO: Unifying Cut-and-Choose for Garbled Circuits”
Paper at ACM CCS 2017, preprint here

Jesper Buus Nielsen, Roberto Trifiletti (Aarhus University) et al., “Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO”
Paper at NDSS 2017, preprint here

Meilof Veeningen (Philips), “Distributed Privacy-Preserving Data Mining in the Medical Domain”
Presentation at Workshop on Decentralized Machine Learning, Optimization and Privacy