Scalable Oblivious Data Analytics

Informazioni relative al progetto

SODA

ID dell’accordo di sovvenzione: 731583

DOI

10.3030/731583

Progetto chiuso

Data della firma CE 13 Ottobre 2016

Data di avvio 1 Gennaio 2017

Data di completamento 31 Dicembre 2019

Finanziato da

• INDUSTRIAL LEADERSHIP - Leadership in enabling and industrial technologies - Information and Communication Technologies (ICT)

Costo totale

€ 2 980 610,00

Contributo UE

€ 2 980 609,75

Coordinato da

PHILIPS ELECTRONICS NEDERLAND BV
Netherlands

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Risultati finali

Documents, reports (11)

User studies analysis
Use-case-specific legal aspects
WP1 State of the art

State of the art

General legal aspects
Special Purpose MPC Protocols
Differential Privacy
Use-case-specific algorithms
WP2 State of the art

State of the art

General MPC Framework
User studies plan
Distributed/streaming algorithms

Websites, patent fillings, videos etc. (2)

Publication of hacking challenge
Public website

Other (2)

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

Pubblicazioni

Other (10)

Philips, Big Data & healthcare

Autori: Meilof Veeningen
Pubblicato in: 2017
Editore: "Workshop ""Big data og følsomme data"""

SODA - Scalable Oblivious Data Analytics

Autori: Meilof Veeningen
Pubblicato in: 2017
Editore: Information and Networking Days on Horizon 2020 Big Data Public-Private Partnership topics 2017

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

Autori: Meilof Veeningen
Pubblicato in: 2017, Pagina/e 21-39
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-57339-7_2

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

Autori: Meilof Veeningen
Pubblicato in: 2017
Editore: TPMPC 2017

On the Computational Overhead of MPC with Dishonest Majority

Autori: Jesper Buus Nielsen, Samuel Ranellucci
Pubblicato in: 2017, Pagina/e 369-395
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54388-7_13

PySNARK

Autori: Meilof Veeningen
Pubblicato in: 2017
Editore: GitHub

Distributed Privacy-Preserving Data Mining in the Medical Domain

Autori: Meilof Veeningen
Pubblicato in: 2017
Editore: Workshop on Decentralized Machine Learning, Optimization and Privacy

Sharing Secrets (Without Giving Them Away)

Autori: Arnout Jaspers
Pubblicato in: 2017
Editore: ACM News

SODA - Scalable Oblivious Data Analytics

Autori: Milan Petkovic
Pubblicato in: 2016
Editore: """Big Data Value Valencia Summit 2016: session on Data Protection - privacy-preserving big data technologies"""

Geheimen delen met partners die je niet vertrouwt

Autori: Arnout Jaspers
Pubblicato in: 2017
Editore: NEMO Kennislink

Conference proceedings (28)

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Autori: Satrajit Ghosh (Aarhus University), Jesper Buus Nielsen (Aarhus University), Tobias Nilges (Aarhus University)
Pubblicato in: 2017
Editore: ASIACRYPT 2017

DUPLO - Unifying Cut-and-Choose for Garbled Circuits

Autori: Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti
Pubblicato in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17, 2017, Pagina/e 3-20, ISBN 9781-450349468
Editore: ACM Press
DOI: 10.1145/3133956.3133991

An Efficient Pairing-Based Shuffle Argument

Autori: Prastudy Fauzi (Aarhus University), Helger Lipmaa (University of Tartu), Janno Siim (University of Tartu and STACC), Michał Zając (University of Tartu)
Pubblicato in: 2017
Editore: ASIACRYPT 2017

Revealing Encryption for Partial Ordering

Autori: Helene Haagh, Yue Ji, Chenxing Li, Claudio Orlandi, and Yifan Song
Pubblicato in: 2017
Editore: IMA Cryptography and Coding 2017

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Autori: Carmit Hazay (Bar-Ilan University), Peter Scholl (Aarhus University), Eduardo Soria-Vazquez (University of Bristol)
Pubblicato in: 2017
Editore: ASIACRYPT 2017

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

Autori: Peter Scholl (Aarhus University), Nigel Smart (University of Bristol), Tim Wood (University of Bristol)
Pubblicato in: 2017
Editore: IMA Cryptography and Coding 2017

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

Autori: 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
Pubblicato in: 2018
Editore: MIE 2018

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

Autori: Jesper Buus Nielsen (Aarhus University) Thomas Schneider (Technische Universität Darmstadt) Roberto Trifiletti (Aarhus University)
Pubblicato in: 2017
Editore: NDSS 2017

Compact Zero-Knowledge Proofs of Small Hamming Weight

Autori: Ivan Damgård, Ji Lao, Sabine Oechsner, Mark Simkin, Peter Scholl
Pubblicato in: 2018
Editore: PKC 2018

Introduction to Secure Multiparty Computation

Autori: Niek Bouman, Berry Schoenmakers
Pubblicato in: 2017
Editore: Workshop Data Mining with Secure Computation,

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments

Autori: Tore Frederiksen, Benny Pinkas, Avishay Yanai
Pubblicato in: 2018
Editore: PKC 2018

PySNARK announcement (flash presentation)

Autori: Meilof Veeningen
Pubblicato in: 2018
Editore: Real World Crypto 2018

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Autori: Peter Scholl
Pubblicato in: 2018
Editore: PKC 2018

Data Mining with Secure Computation

Autori: Niek Bouman, Mykola Pechenizkiy
Pubblicato in: 2017
Editore: ECML PKDD 2017

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

Autori: Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti
Pubblicato in: 2017
Editore: ACM CCS 2017

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

Autori: Ivan Damgård, Claudio Orlandi, Mark Simkin
Pubblicato in: 2018
Editore: CRYPTO 2018

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

Autori: Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
Pubblicato in: 2018
Editore: CRYPTO 2018

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

Autori: Tore Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Pubblicato in: 2018
Editore: TPMPC 2018

Efficient MPC From Syndrome Decoding

Autori: Peter Scholl
Pubblicato in: 2018
Editore: TPMPC 2018

Secure Linear Algebra over F_p and Q

Autori: Frank Blom, Niek Bouman, Berry Schoenmakers, Niels de Vreede
Pubblicato in: 2018
Editore: TPMPC 2018

TinyKeys: A New Approach to Efficient Multi-Party Computation

Autori: Carmit Hazay, Emmanuela Orsini, Peter Scholl , Eduardo Soria-Vazquez
Pubblicato in: 2018
Editore: CRYPTO 2018

Conclave - secure multi-party computation on big data

Autori: Nikolaj Volgushev, Malte Schwarzkopf, Ben Getchell, Mayank Varia, Andrei Lapets, Azer Bestavros
Pubblicato in: Proceedings of the Fourteenth EuroSys Conference 2019 CD-ROM on ZZZ - EuroSys '19, 2019, Pagina/e 1-18, ISBN 9781-450362818
Editore: ACM Press
DOI: 10.1145/3302424.3303982

Sharing Information with Competitors

Autori: Brânzei, Simina; Orlandi, Claudio; Yang, Guang
Pubblicato in: Numero 1, 2018
Editore: Cornell University

Lower Bounds for Oblivious Data Structures

Autori: Jacob, Riko; Larsen, Kasper Green; Nielsen, Jesper Buus
Pubblicato in: Numero 1, 2018
Editore: Cornell University

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

Autori: 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.
Pubblicato in: STARTPAGE=76;ENDPAGE=80;TITLE=Building Continents of Knowledge in Oceans of Data: The Future of Co-Created eHealth, Numero 1, 2018
Editore: Medical Information Europe

Computer-Aided Proofs for Multiparty Computation with Active Security

Autori: Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
Pubblicato in: 2018 IEEE 31st Computer Security Foundations Symposium (CSF), 2018, Pagina/e 119-131, ISBN 978-1-5386-6680-7
Editore: IEEE
DOI: 10.1109/CSF.2018.00016

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

Autori: Ivan Damgard, Daniel Escudero, Tore Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev
Pubblicato in: 2019 IEEE Symposium on Security and Privacy (SP), 2019, Pagina/e 1102-1120, ISBN 978-1-5386-6660-9
Editore: IEEE
DOI: 10.1109/sp.2019.00078

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

Autori: Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl
Pubblicato in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019, Pagina/e 291-308, ISBN 9781-450367479
Editore: ACM
DOI: 10.1145/3319535.3354255

Book chapters (12)

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

Autori: Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Numero 10992, 2018, Pagina/e 331-361, ISBN 978-3-319-96880-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_12

Revealing Encryption for Partial Ordering

Autori: Helene Haagh, Yue Ji, Chenxing Li, Claudio Orlandi, Yifan Song
Pubblicato in: Cryptography and Coding, Numero 10655, 2017, Pagina/e 3-22, ISBN 978-3-319-71044-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-71045-7_1

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Autori: Peter Scholl
Pubblicato in: Public-Key Cryptography – PKC 2018, Numero 10769, 2018, Pagina/e 554-583, ISBN 978-3-319-76577-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-76578-5_19

An Efficient Pairing-Based Shuffle Argument

Autori: Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michał Zając
Pubblicato in: Advances in Cryptology – ASIACRYPT 2017, Numero 10625, 2017, Pagina/e 97-127, ISBN 978-3-319-70696-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-70697-9_4

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Autori: Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges
Pubblicato in: Advances in Cryptology – ASIACRYPT 2017, Numero 10624, 2017, Pagina/e 629-659, ISBN 978-3-319-70693-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-70694-8_22

Compact Zero-Knowledge Proofs of Small Hamming Weight

Autori: Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
Pubblicato in: Public-Key Cryptography – PKC 2018, Numero 10770, 2018, Pagina/e 530-560, ISBN 978-3-319-76580-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-76581-5_18

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

Autori: Ivan Damgård, Claudio Orlandi, Mark Simkin
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Numero 10992, 2018, Pagina/e 799-829, ISBN 978-3-319-96880-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_27

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Autori: Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Pubblicato in: Advances in Cryptology – ASIACRYPT 2017, Numero 10624, 2017, Pagina/e 598-628, ISBN 978-3-319-70693-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-70694-8_21

TinyKeys: A New Approach to Efficient Multi-Party Computation

Autori: Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III, Numero 10993, 2018, Pagina/e 3-33, ISBN 978-3-319-96877-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96878-0_1

Yes, There is an Oblivious RAM Lower Bound!

Autori: Kasper Green Larsen, Jesper Buus Nielsen
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Numero 10992, 2018, Pagina/e 523-542, ISBN 978-3-319-96880-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_18

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Autori: Peter Sebastian Nordholt, Meilof Veeningen
Pubblicato in: Applied Cryptography and Network Security, Numero 10892, 2018, Pagina/e 321-339, ISBN 978-3-319-93386-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-93387-0_17

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

Autori: Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Pubblicato 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, Numero 11274, 2018, Pagina/e 86-117, ISBN 978-3-030-03331-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-03332-3_4