Skip to main content

Scalable Oblivious Data Analytics

Deliverables

User studies analysis

User studies analysis

Use-case-specific legal aspects

Use-case-specific legal aspects

WP1 State of the art

State of the art

General legal aspects

General legal aspects

Special Purpose MPC Protocols

Special Purpose MPC Protocols

Differential Privacy

Differential Privacy

Use-case-specific algorithms

Use-case-specific algorithms

WP2 State of the art

State of the art

General MPC Framework

General MPC Framework

User studies plan

User studies plan

Distributed/streaming algorithms

Distributed/streaming algorithms

Proof-of-concept for results of tasks 1.2/2.2

Proof-of-concept for results of tasks 1.2/2.2

Proof-of-concept for results of tasks 1.3/2.3

Proof-of-concept for results of tasks 1.3/2.3

Searching for OpenAIRE data...

Publications

Philips, Big Data & healthcare

Author(s): Meilof Veeningen
Published in: 2017

SODA - Scalable Oblivious Data Analytics

Author(s): Meilof Veeningen
Published in: 2017

Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation

Author(s): Meilof Veeningen
Published in: 2017, Page(s) 21-39
DOI: 10.1007/978-3-319-57339-7_2

Pinocchio-Based Adaptive zk-SNARKs, Secure Adaptive Function Evaluation and Privacy-Preserving Medical Research

Author(s): Meilof Veeningen
Published in: 2017

On the Computational Overhead of MPC with Dishonest Majority

Author(s): Jesper Buus Nielsen, Samuel Ranellucci
Published in: 2017, Page(s) 369-395
DOI: 10.1007/978-3-662-54388-7_13

PySNARK

Author(s): Meilof Veeningen
Published in: 2017

Distributed Privacy-Preserving Data Mining in the Medical Domain

Author(s): Meilof Veeningen
Published in: 2017

Sharing Secrets (Without Giving Them Away)

Author(s): Arnout Jaspers
Published in: 2017

SODA - Scalable Oblivious Data Analytics

Author(s): Milan Petkovic
Published in: 2016

Geheimen delen met partners die je niet vertrouwt

Author(s): Arnout Jaspers
Published in: 2017

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Author(s): Satrajit Ghosh (Aarhus University), Jesper Buus Nielsen (Aarhus University), Tobias Nilges (Aarhus University)
Published in: 2017

DUPLO - Unifying Cut-and-Choose for Garbled Circuits

Author(s): Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti
Published in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17, 2017, Page(s) 3-20
DOI: 10.1145/3133956.3133991

An Efficient Pairing-Based Shuffle Argument

Author(s): Prastudy Fauzi (Aarhus University), Helger Lipmaa (University of Tartu), Janno Siim (University of Tartu and STACC), Michał Zając (University of Tartu)
Published in: 2017

Revealing Encryption for Partial Ordering

Author(s): Helene Haagh, Yue Ji, Chenxing Li, Claudio Orlandi, and Yifan Song
Published in: 2017

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Author(s): Carmit Hazay (Bar-Ilan University), Peter Scholl (Aarhus University), Eduardo Soria-Vazquez (University of Bristol)
Published in: 2017

When It’s All Just Too Much: Outsourcing MPC-Preprocessing

Author(s): Peter Scholl (Aarhus University), Nigel Smart (University of Bristol), Tim Wood (University of Bristol)
Published in: 2017

Enabling Analytics on Sensitive Medical Data with Secure Multi-Party Computation

Author(s): Meilof VEENINGEN, Supriyo CHATTERJEA, Anna Zsófia HORVÁTH, Gerald SPINDLERb, Eric BOERSMA, Peter van der SPEK, Onno van der GALIËN, Job GUTTELING, Wessel KRAAIJ, Thijs VEUGEN
Published in: 2018

Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO

Author(s): Jesper Buus Nielsen (Aarhus University) Thomas Schneider (Technische Universität Darmstadt) Roberto Trifiletti (Aarhus University)
Published in: 2017

Compact Zero-Knowledge Proofs of Small Hamming Weight

Author(s): Ivan Damgård, Ji Lao, Sabine Oechsner, Mark Simkin, Peter Scholl
Published in: 2018

Introduction to Secure Multiparty Computation

Author(s): Niek Bouman, Berry Schoenmakers
Published in: 2017

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments

Author(s): Tore Frederiksen, Benny Pinkas, Avishay Yanai
Published in: 2018

PySNARK announcement (flash presentation)

Author(s): Meilof Veeningen
Published in: 2018

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Author(s): Peter Scholl
Published in: 2018

Data Mining with Secure Computation

Author(s): Niek Bouman, Mykola Pechenizkiy
Published in: 2017

TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation

Author(s): Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti
Published in: 2017

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

Author(s): Ivan Damgård, Claudio Orlandi, Mark Simkin
Published in: 2018

SPDZ_2^k: Efficient MPC mod 2^k for Dishonest Majority

Author(s): Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
Published in: 2018

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries

Author(s): Tore Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Published in: 2018

Efficient MPC From Syndrome Decoding

Author(s): Peter Scholl
Published in: 2018

Secure Linear Algebra over F_p and Q

Author(s): Frank Blom, Niek Bouman, Berry Schoenmakers, Niels de Vreede
Published in: 2018

TinyKeys: A New Approach to Efficient Multi-Party Computation

Author(s): Carmit Hazay, Emmanuela Orsini, Peter Scholl , Eduardo Soria-Vazquez
Published in: 2018

Conclave - secure multi-party computation on big data

Author(s): Nikolaj Volgushev, Malte Schwarzkopf, Ben Getchell, Mayank Varia, Andrei Lapets, Azer Bestavros
Published in: Proceedings of the Fourteenth EuroSys Conference 2019 CD-ROM on ZZZ - EuroSys '19, 2019, Page(s) 1-18
DOI: 10.1145/3302424.3303982

Sharing Information with Competitors

Author(s): Brânzei, Simina; Orlandi, Claudio; Yang, Guang
Published in: Issue 1, 2018

Lower Bounds for Oblivious Data Structures

Author(s): Jacob, Riko; Larsen, Kasper Green; Nielsen, Jesper Buus
Published in: Issue 1, 2018

Enabling analytics on sensitive medical data with secure multi-party computation

Author(s): Veeningen, M.; Chatterjea, S.; Horváth, A.Z.; Spindler, G.; Boersma, E.; Spek, van der, P.; Galiën, van der, O.; Gutteling, J.; Kraaij, W.; Veugen, T.
Published in: STARTPAGE=76;ENDPAGE=80;TITLE=Building Continents of Knowledge in Oceans of Data: The Future of Co-Created eHealth, Issue 1, 2018

Computer-Aided Proofs for Multiparty Computation with Active Security

Author(s): Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
Published in: 2018 IEEE 31st Computer Security Foundations Symposium (CSF), 2018, Page(s) 119-131
DOI: 10.1109/CSF.2018.00016

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning

Author(s): Ivan Damgard, Daniel Escudero, Tore Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev
Published in: 2019 IEEE Symposium on Security and Privacy (SP), 2019, Page(s) 1102-1120
DOI: 10.1109/sp.2019.00078

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation

Author(s): Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl
Published in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019, Page(s) 291-308
DOI: 10.1145/3319535.3354255

Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries

Author(s): Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Issue 10992, 2018, Page(s) 331-361
DOI: 10.1007/978-3-319-96881-0_12

Revealing Encryption for Partial Ordering

Author(s): Helene Haagh, Yue Ji, Chenxing Li, Claudio Orlandi, Yifan Song
Published in: Cryptography and Coding, Issue 10655, 2017, Page(s) 3-22
DOI: 10.1007/978-3-319-71045-7_1

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Author(s): Peter Scholl
Published in: Public-Key Cryptography – PKC 2018, Issue 10769, 2018, Page(s) 554-583
DOI: 10.1007/978-3-319-76578-5_19

An Efficient Pairing-Based Shuffle Argument

Author(s): Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michał Zając
Published in: Advances in Cryptology – ASIACRYPT 2017, Issue 10625, 2017, Page(s) 97-127
DOI: 10.1007/978-3-319-70697-9_4

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Author(s): Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges
Published in: Advances in Cryptology – ASIACRYPT 2017, Issue 10624, 2017, Page(s) 629-659
DOI: 10.1007/978-3-319-70694-8_22

Compact Zero-Knowledge Proofs of Small Hamming Weight

Author(s): Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
Published in: Public-Key Cryptography – PKC 2018, Issue 10770, 2018, Page(s) 530-560
DOI: 10.1007/978-3-319-76581-5_18

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

Author(s): Ivan Damgård, Claudio Orlandi, Mark Simkin
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Issue 10992, 2018, Page(s) 799-829
DOI: 10.1007/978-3-319-96881-0_27

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Author(s): Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Published in: Advances in Cryptology – ASIACRYPT 2017, Issue 10624, 2017, Page(s) 598-628
DOI: 10.1007/978-3-319-70694-8_21

TinyKeys: A New Approach to Efficient Multi-Party Computation

Author(s): Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III, Issue 10993, 2018, Page(s) 3-33
DOI: 10.1007/978-3-319-96878-0_1

Yes, There is an Oblivious RAM Lower Bound!

Author(s): Kasper Green Larsen, Jesper Buus Nielsen
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Issue 10992, 2018, Page(s) 523-542
DOI: 10.1007/978-3-319-96881-0_18

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Author(s): Peter Sebastian Nordholt, Meilof Veeningen
Published in: Applied Cryptography and Network Security, Issue 10892, 2018, Page(s) 321-339
DOI: 10.1007/978-3-319-93387-0_17

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Author(s): Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Published in: Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018, Proceedings, Part III, Issue 11274, 2018, Page(s) 86-117
DOI: 10.1007/978-3-030-03332-3_4