"Muu" projekt FP7-284731
FP7-284731 "Usable and Efficient Secure Multiparty Computation (UaESMC) (1.02.2012−30.01.2015)", Peeter Laud, Cybernetica AS.
FP7-ICT-284731
FP7-284731
Kasutajasõbralikud ja kiired turvalised ühisarvutused
Usable and Efficient Secure Multiparty Computation (UaESMC)
Usable and Efficient Secure Multiparty Computation (UaESMC)
1.02.2012
30.01.2015
Muu
ValdkondAlamvaldkondCERCS erialaFrascati Manual’i erialaProtsent
4. Loodusteadused ja tehnika4.6. ArvutiteadusedP170 Arvutiteadus, arvutusmeetodid, süsteemid, juhtimine (automaatjuhtimisteooria)1.1. Matemaatika ja arvutiteadus (matemaatika ja teised sellega seotud teadused: arvutiteadus ja sellega seotud teadused (ainult tarkvaraarendus, riistvara arendus kuulub tehnikavaldkonda)100,0
AsutusRollPeriood
Cybernetica ASkoordinaator01.02.2012−30.01.2015
AsutusRiikTüüp
Euroopa Komisjon
PerioodSumma
01.02.2012−30.01.2015392 600,00 EUR
392 600,00 EUR
392600,00
FP7-ICT (FET Open)

Projektis uuritakse viise turvaliste ühisarvutuste kiirendamiseks nende rakendamisega seotud praktiliste asjaolude abil.
In this project, we will bring the techniques and tools for Secure Multiparty Computation (SMC) to a level where they can be applied to decisional and computational problems of practical size in several different social and economic sectors. To achieve this, we will apply a multi-pronged research effort to build the theoretical foundations for the practical aspects of SMC application. Our project will combine the identification of a representative set of computational problems, the development of appropriate cryptographic and other tools for solving those problems in a privacy-preserving manner, the study of incentives of various parties to participate in privacy-preserving computations, and the exploration of practical limits and trade-offs in the deployment of SMC solutions. All these research areas will be explored in tight cooperation, as advances in any of them will shift priorities in all other areas. Through the integrated effort we hope to build a framework that allows us to place any multiparty computation problem in the appropriate context and to see whether and how the privacy issues in this problem can be mitigated.
TegevusProtsent
Alusuuring100,0

Vastutav täitja (1)

IsikKraadTöökoht ja ametCVOsalemise periood
Peeter LauddoktorikraadEST / ENG01.02.2012−30.01.2015

Põhitäitjad (2)

IsikKraadTöökoht ja ametCVOsalemise periood
Dan BogdanovdoktorikraadEST / ENG01.02.2012−30.01.2015
Jan VillemsondoktorikraadEST / ENG01.02.2012−30.01.2015

Täitjad (2)

IsikKraadTöökoht ja ametCVOsalemise periood
Liina KammdoktorikraadEST / ENG01.02.2012−30.01.2015
Riivo TalvistedoktorikraadEST / ENG01.02.2012−30.01.2015
Publikatsioonid
Publikatsioonid
Bogdanov, Dan; Kalu, Aivo (2013). Pushing Back the Rain—How to Create Trustworthy Services in the Cloud. ISACA Journal, 3, 49−51.
Laud, Peeter; Pankova, Alisa (2013). New Attacks against Transformation-Based Privacy-Preserving Linear Programming. Security and Trust Management - 9th International Workshop, STM 2013, Egham, UK, September 12-13, 2013. Proceedings: Security and Trust Management - 9th International Workshop (STM 2013), Royal Holloway University of London, September 12-13. Ed. Accorsi, Rafael; Ranise, Silvio. Springer, 17−32. (Lecture Notes in Computer Science; 8203).
Laud, Peeter; Pankova, Alisa (2013). On the (Im)possibility of Privately Outsourcing Linear Programming. CCSW 2013: The ACM Cloud Computing Security Workshop, Berlin, Germany, November 8th, 2013. Ed. Juels, Ari; Parno, Bryan. Association for Computing Machinery (ACM) , 55−64.
Bogdanov, Dan; Laur, Sven; Talviste, Riivo (2013). Oblivious Sorting of Secret-Shared Data. Cybernetica Research Reports.
Pullonen, Pille; Bogdanov, Dan; Schneider, Thomas. (2012). The design and implementation of a two-party protocol suite for Sharemind 3. Cybernetica Research Reports.
Bogdanov, Dan; Kamm, Liina; Laur, Sven; Pruulmann-Vengerfeldt, Pille; Talviste, Riivo; Willemson, Jan (2014). Privacy-preserving statistical data analysis on federated databases. Privacy Technologies and Policy: Annual Privacy Forum 2014, 20.-21. mai 2014, Ateena, Kreeka. Ed. Preneel, Bart; Ikonomou, Demosthenes. Springer, 30−55. (Lecture Notes in Computer Science; 8450).10.1007/978-3-319-06749-0_3.
Bogdanov, Dan; Laud, Peeter; Laur, Sven; Pullonen, Pille (2014). From Input Private to Universally Composable Secure Multi-party Computation Primitives. 2014 IEEE 27th Computer Security Foundations Symposium, CSF 2014, Vienna, Austria, July 19-22, 2014. Ed. Datta, Anupam; Fournet, Cedric. IEEE Computer Society, 184−198.
Laud, Peeter; Pankova, Alisa (2014). Verifiable Computation in Multiparty Protocols with Honest Majority. Provable Security, 8th International Conference: ProvSec 2014, Hong Kong, 09.10-10.10.2014. Toim. Lucas C.K. Hui, S.M. Yiu, Sherman S. M. Chow, Joseph K. Liu. Springer, 146−161. (Lecture Notes in Computer Science; 8782).
Guanciale, Roberto; Gurov, Dilian; Laud, Peeter (2014). Private intersection of regular languages. Privacy, Security and Trust (PST), 2014 Twelfth Annual International Conference on: Twlefth Annual International Conference on Privacy, Security and Trust (PST), Toronto, Canada, 23.-24.07.2014. IEEE, 112−120.
Bogdanov, Dan; Laur, Sven; Talviste, Riivo (2014). A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. Secure IT Systems: Nordic Conference on Secure IT Systems, 15. - 17. oktoober 2014, Tromsø, Norra. Ed. Bernsmed, Karin; Fischer-Hübner, Simone. Springer, 59−74. (Lecture Notes in Computer Science; 8788).10.1007/978-3-319-11599-3_4.
Laud, Peeter; Willemson, Jan (2014). Composable Oblivious Extended Permutations. Foundations and Practice of Security - 7th International Symposium, FPS 2014: The 7th International Symposium on Foundations and Practice of Security, Montreal, Canada, 3.-5.11.2014. Ed. Cuppens, Frdédéric; Garcia-Alfaro, Joaquin; Heywood, A. Nur Zincir; Wong, Philip W. L. Springer, 294−310. (Lecture Notes in Computer Science; 8930).
Laud, Peeter (2014). A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. Proceedings of the 2014 International Conference on Information and Communications Security: International Conference on Information and Communications Security (ICICS 2014), Hong Kong, 16.-17.12.2014. Ed. Shi, Elaine; Yiu, S.M. Springer, 143−157. (Lecture Notes in Computer Science; 8958).
Bogdanov, Dan; Kamm, Liina; Laur, Sven; Sokk, Ville (2014). Rmind: a tool for cryptographically secure statistical analysis. Cryptology ePrint Archive.
Laud, Peeter (2014). A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. Proceedings of the 2014 International Conference on Information and Communications Security: International Conference on Information and Communications Security (ICICS 2014), Hong Kong, 16.-17.12.2014. Ed. Shi, Elaine; Yiu, S.M. Springer,. (Lecture Notes in Computer Science) [ilmumas].
Laud, Peeter; Pankova, Alisa; Kamm, Liina; Veeningen, Meilof (2015). Basic Constructions of Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (1−25). IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-1.
Laud, Peeter (2015). Stateful Abstractions of Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (26−42).. IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-26.
Kamm, Liina; Bogdanov, Dan; Pankova, Alisa; Talviste, Riivo (2015). Statistical Analysis Methods Using Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (58−80). IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-58.
Laud, Peeter (2015). Oblivious Array Access for Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (106−128).. IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-106.
Guanciale, Roberto; Gurov, Dilian; Laud, Peeter (2015). Business Process Engineering and Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (129−149).. IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-129.
Pankova, Alisa; Laud, Peeter (2015). Verifiable Computation in Multiparty Protocols with Honest Majority. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (165−185). IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-165.
Pankova, Alisa; Laud, Peeter (2015). Transformation-based Computation and Impossibility Results. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (216−245). IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-216.
Talviste, Riivo (2015). Practical Applications of Secure Multiparty Computation. In: Laud, Peeter; Kamm, Liina (Ed.). Applications of Secure Multiparty Computation (246−251). IOS Press. (Cryptology and Information Security Series; 13).10.3233/978-1-61499-532-6-246.
Laud, Peeter; Kamm, Liina (eds.) (2015). Applications of Secure Multiparty Computation. IOS Press.
Laud, Peeter (2015). Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees. Proceedings on Privacy Enhancing Technologies, 2015 (2), 188−205.10.1515/popets-2015-0011.
Gurov, Dilian; Laud, Peeter; Guanciale, Roberto (2015). Privacy Preserving Business Process Matching. 13th Annual Conference on Privacy, Security and Trust, Izmir, Turkey, July 21-23, 2015. IEEE Computer Society Press, 36−43.10.1109/PST.2015.7232952.
Kamm, Liina (2015). Privaatsust säilitav andmeanalüüs. (5−6)..