[{"data":1,"prerenderedAt":6551},["ShallowReactive",2],{"library":3},{"data":4,"libraryItems":11},{"slug":5,"title":6,"metaData":7},"library","Library",{"metaTitle":8,"metaDescription":9,"shareImage":10,"unlisted":10},"Cybernetica - Research Library","Discover valuable insights and knoweledge about our cybersecurity researches.  Empower your knowledge with the latest information in cybersecurity!",null,[12,27,44,60,77,92,104,117,129,148,161,175,186,197,212,226,244,256,267,279,293,304,317,328,339,350,361,374,387,398,422,435,449,459,474,484,494,507,517,527,536,548,560,577,588,602,613,624,639,651,663,674,688,703,715,725,743,752,762,772,787,805,818,830,840,857,866,874,885,894,904,914,924,932,943,953,964,975,996,1006,1015,1024,1030,1039,1046,1055,1064,1073,1082,1091,1100,1109,1118,1125,1132,1141,1150,1159,1168,1175,1184,1191,1200,1207,1213,1221,1227,1236,1244,1252,1260,1269,1275,1284,1293,1301,1309,1315,1324,1333,1339,1346,1355,1364,1373,1380,1388,1403,1414,1427,1449,1463,1481,1506,1515,1531,1540,1559,1574,1589,1604,1615,1623,1644,1659,1679,1694,1713,1725,1733,1752,1759,1768,1777,1789,1808,1825,1834,1849,1861,1877,1894,1910,1927,1939,1951,1964,1986,1998,2011,2023,2035,2046,2058,2068,2076,2085,2100,2111,2123,2136,2147,2157,2168,2177,2187,2197,2204,2210,2224,2236,2261,2277,2289,2303,2312,2323,2331,2339,2350,2358,2373,2379,2393,2399,2409,2421,2428,2434,2441,2452,2462,2474,2484,2495,2501,2511,2523,2534,2544,2556,2564,2571,2578,2584,2594,2603,2610,2620,2632,2644,2656,2665,2675,2683,2690,2700,2711,2720,2733,2740,2750,2760,2767,2779,2793,2801,2809,2820,2827,2836,2843,2853,2861,2870,2881,2890,2899,2911,2921,2935,2944,2950,2960,2972,2978,2990,3000,3011,3022,3031,3052,3059,3069,3078,3087,3099,3110,3121,3127,3137,3148,3159,3168,3183,3191,3201,3209,3219,3229,3237,3251,3261,3270,3278,3287,3293,3304,3312,3322,3332,3340,3350,3357,3367,3377,3395,3405,3416,3422,3432,3443,3453,3465,3476,3488,3499,3505,3515,3526,3533,3543,3555,3565,3571,3579,3588,3601,3607,3616,3629,3636,3642,3652,3662,3670,3678,3684,3698,3706,3716,3723,3734,3743,3753,3762,3770,3776,3784,3792,3802,3808,3815,3826,3838,3850,3860,3872,3881,3887,3893,3902,3909,3916,3925,3934,3940,3946,3952,3958,3967,3973,3979,3992,4011,4040,4055,4071,4083,4094,4107,4123,4142,4156,4168,4180,4189,4198,4207,4216,4225,4232,4246,4260,4277,4290,4300,4311,4336,4346,4355,4364,4383,4394,4409,4422,4446,4466,4482,4499,4511,4522,4533,4546,4559,4568,4577,4588,4598,4605,4614,4625,4639,4652,4677,4687,4703,4713,4723,4731,4742,4752,4760,4774,4791,4801,4810,4820,4830,4843,4851,4865,4875,4886,4896,4905,4915,4926,4936,4956,4971,4995,5015,5031,5041,5052,5061,5076,5093,5112,5132,5145,5164,5181,5190,5199,5212,5240,5259,5276,5291,5317,5334,5346,5366,5374,5399,5414,5423,5433,5444,5453,5461,5470,5483,5497,5507,5516,5529,5539,5550,5575,5588,5601,5610,5621,5633,5645,5655,5664,5675,5682,5697,5704,5710,5716,5723,5741,5759,5768,5781,5795,5810,5820,5832,5847,5859,5870,5881,5893,5910,5919,5932,5943,5955,5973,5987,6001,6026,6037,6047,6056,6068,6078,6088,6098,6109,6120,6131,6142,6153,6163,6174,6183,6194,6205,6216,6226,6236,6242,6254,6259,6266,6277,6288,6300,6310,6317,6324,6337,6355,6367,6379,6396,6406,6418,6429,6439,6450,6462,6473,6484,6495,6506,6518,6529,6539],{"title":13,"type":14,"excerpt":15,"year":16,"authors":17,"tags":20,"pdfFile":10,"pdfUrl":21,"extendedUrl":10,"bibTeX":22},"Improving performance of secure real-number operations","thesis","PhD thesis. University of Tartu. 2019.",2019,[18],{"author":19},"Krips, T.",[],"https:\u002F\u002Fdspace.ut.ee\u002Fhandle\u002F10062\u002F63763",{"tag":23,"width":24,"height":25,"text":26},"K19",750,250,"@phdthesis{UT:Krips19,\n  author = {Toomas Krips},\n  title = {Improving performance of secure real-number operations},\n  school = {University of Tartu},\n  year = {2019},\n  url = {https:\u002F\u002Fdspace.ut.ee\u002Fhandle\u002F10062\u002F63763}\n}\n",{"title":28,"type":14,"excerpt":29,"year":30,"authors":31,"tags":38,"pdfFile":10,"pdfUrl":39,"extendedUrl":10,"bibTeX":40},"Preprocessing Based Verification of Multiparty Protocols with Honest Majority"," In Proceedings on Privacy Enhancing Technologies, Volume 2017, Issue 4, 23-76, 2017.",2017,[32,34,36],{"author":33},"Peeter Laud",{"author":35},"Alisa Pankova",{"author":37},"Roman Jagomägis",[],"https:\u002F\u002Fdoi.org\u002F10.1515\u002Fpopets-2017-0038",{"tag":41,"width":24,"height":42,"text":43},"LPJ18",300,"@article{LaPaJa17,\nauthor = {Laud, Peeter and Pankova, Alisa and Jagomägis, Roman},\ndoi = {10.1515\u002Fpopets-2017-0038},\nissn = {2299-0984},\njournal = {Proceedings on Privacy Enhancing Technologies},\nnumber = {4},\npages = {23–76},\ntitle = {Preprocessing Based Verification of Multiparty Protocols with Honest Majority},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1515\u002Fpopets-2017-0038},\nvolume = {2017},\nyear = {2017}\n}\n",{"title":45,"type":46,"excerpt":47,"year":48,"authors":49,"tags":52,"pdfFile":53,"pdfUrl":55,"extendedUrl":10,"bibTeX":56},"An Overview of Vulnerabilities and Mitigations of Intel SGX Applications.","report","Cybernetica research report D-2-116 v1.3. 2024.",2024,[50],{"author":51},"Kisand, A.",[],{"url":54},"\u002Fuploads\u002FD_2_116_An_Overview_of_Vulnerabilities_and_Mitigations_of_Intel_SGX_Applications_c1282b1505.pdf","",{"tag":57,"width":58,"height":25,"text":59},"R21",800,"@TECHREPORT{CYBER:R21,\n  author = {A. Kisand},\n  title = {An Overview of Vulnerabilities and Mitigations of Intel SGX Applications},\n  institution = {Cybernetica AS},\n  year = {2024},\n  number = {D-2-116},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":61,"type":46,"excerpt":62,"year":63,"authors":64,"tags":71,"pdfFile":72,"pdfUrl":55,"extendedUrl":10,"bibTeX":74},"The design and implementation of a two-party protocol suite for Sharemind 3.","Cybernetica research report T-4-17. 2012.",2012,[65,67,69],{"author":66},"Pille Pullonen",{"author":68},"Dan Bogdanov",{"author":70},"Thomas Schneider",[],{"url":73},"\u002Fuploads\u002FT_4_17_The_design_and_implementation_of_a_two_party_protocol_suite_for_Sharemind_3_cf65585784.pdf",{"tag":75,"width":24,"height":10,"text":76},"PBS10","@TECHREPORT{CYBER:PBS12,\n  author = {Pille Pullonen and Dan Bogdanov and Thomas Schneider.},\n  title = {{The design and implementation of a two-party protocol suite for Sharemind 3}},\n  institution = {Cybernetica},\n  year = {2012},\n  number = {T-4-17},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":78,"type":14,"excerpt":79,"year":80,"authors":81,"tags":86,"pdfFile":10,"pdfUrl":87,"extendedUrl":10,"bibTeX":88},"Secure Floating-Point Arithmetic and Private Satellite Collision Analysis.","Cryptology ePrint Archive, Report 2013\u002F850. 2013.",2013,[82,84],{"author":83},"Liina Kamm",{"author":85},"Jan Willemson",[],"http:\u002F\u002Feprint.iacr.org\u002F2013\u002F850.pdf",{"tag":89,"width":58,"height":90,"text":91},"KW13",200,"@misc{eprint:Kamm13,\n    author = {Liina Kamm and Jan Willemson},\n    title = {{Secure Floating-Point Arithmetic and Private Satellite Collision Analysis}},\n    howpublished = {Cryptology ePrint Archive, Report 2013\u002F850},\n    year = {2013},\n    note = {\\url{http:\u002F\u002Feprint.iacr.org\u002F}},\n}\n",{"title":93,"type":14,"excerpt":94,"year":95,"authors":96,"tags":99,"pdfFile":10,"pdfUrl":100,"extendedUrl":10,"bibTeX":101},"A new database layer for the Sharemind privacy preserving computer","Bachelor's thesis. University of Tartu. 2011.",2011,[97],{"author":98},"Saar, R.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsharemind_database_saar_2011.pdf",{"tag":102,"width":10,"height":90,"text":103},"Saar11","@MISC{BSc:Saar11,\n  author = {Risto Saar},\n  title = {{A new database layer for the Sharemind privacy preserving computer}},\n  howpublished = {Bachelor's thesis. University of Tartu},\n  year = {2011}\n}\n",{"title":105,"type":14,"excerpt":106,"year":107,"authors":108,"tags":111,"pdfFile":10,"pdfUrl":112,"extendedUrl":10,"bibTeX":113},"Privacy-preserving record linkage in large databases using secure multiparty computation.","BMC Medical Genomics, Volume 11, Supplement 4, 35–55, 2018.",2018,[109,110],{"author":33},{"author":35},[],"https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs12920-018-0400-8",{"tag":114,"width":115,"height":42,"text":116},"LP18b",850,"@article{Laud2018,\nauthor = {Laud, Peeter and Pankova, Alisa},\ndoi = {10.1186\u002Fs12920-018-0400-8},\nissn = {1755-8794},\njournal = {BMC Medical Genomics},\nnumber = {4},\npages = {35–55},\ntitle = {Privacy-preserving record linkage in large databases using secure multiparty computation},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs12920-018-0400-8},\nvolume = {11},\nyear = {2018}\n}\n",{"title":118,"type":14,"excerpt":119,"year":120,"authors":121,"tags":124,"pdfFile":10,"pdfUrl":125,"extendedUrl":10,"bibTeX":126},"Secure floating point arithmetic and private satellite collision analysis.","International Journal of Information Security. 2015.",2015,[122,123],{"author":83},{"author":85},[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002Fs10207-014-0271-8",{"tag":127,"width":24,"height":25,"text":128},"KW15","@article{IJIS:KW15,\n  author = {Liina Kamm and Jan Willemson},\n  title = {{Secure Floating-Point Arithmetic and Private Satellite Collision Analysis}},\n  journal={International Journal of Information Security},\n  year = {2015},\n  month=\"Nov\",\n  day=\"01\",\n  volume=\"14\",\n  number=\"6\",\n  pages=\"531--548\",\n  publisher={Springer Berlin Heidelberg},\n  url={http:\u002F\u002Fdx.doi.org\u002F10.1007\u002Fs10207-014-0271-8}\n}\n",{"title":130,"type":46,"excerpt":131,"year":132,"authors":133,"tags":142,"pdfFile":143,"pdfUrl":55,"extendedUrl":10,"bibTeX":145},"Improved protocols for the Sharemind virtual machine","Cybernetica research report T-4-10. 2010.",2010,[134,136,138,140],{"author":135},"Bogdanov, D.",{"author":137},"Niitsoo, M.",{"author":139},"Toft, T.",{"author":141},"Willemson, J.",[],{"url":144},"\u002Fuploads\u002FT_4_10_Improved_protocols_for_the_Sharemind_virtual_machine_f883fe4c05.pdf",{"tag":146,"width":24,"height":90,"text":147},"BNTW10","@TECHREPORT{CYBER:BNTW10,\n  author = {Dan Bogdanov and Margus Niitsoo and Tomas Toft and Jan Willemson},\n  title = {{Improved protocols for the Sharemind virtual machine}},\n  institution = {Cybernetica},\n  year = {2010},\n  number = {T-4-10},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":149,"type":14,"excerpt":150,"year":151,"authors":152,"tags":155,"pdfFile":10,"pdfUrl":156,"extendedUrl":10,"bibTeX":157},"Share Computing Protocols over Fields and Rings.","Master's thesis. University of Tartu. 2009.",2009,[153],{"author":154},"Katharina Kahrs",[],"\u002Fuploads\u002Fpapers\u002Fshare_computing_protocols_kahrs_2009.pdf",{"tag":158,"width":159,"height":90,"text":160},"Kahrs09",600,"@MASTERSTHESIS{UT:Kahrs09,\n  author = {Katharina Kahrs},\n  title = {{Share Computing Protocols over Fields and Rings}},\n  school = {University of Tartu},\n  year = {2009},\n}\n",{"title":162,"type":46,"excerpt":163,"year":164,"authors":165,"tags":169,"pdfFile":170,"pdfUrl":55,"extendedUrl":10,"bibTeX":172},"Privacy preserving collaborative filtering with Sharemind.","Cybernetica research report T-4-2. 2008.",2008,[166,167],{"author":68},{"author":168},"Richard Sassoon",[],{"url":171},"\u002Fuploads\u002FT_4_2_Privacy_preserving_collaborative_filtering_with_Sharemind_f0b8ac0a9d.pdf",{"tag":173,"width":159,"height":90,"text":174},"BS08","@TECHREPORT{CYBER:BS08,\n  author = {Dan Bogdanov and Richard Sassoon},\n  title = {{Privacy preserving collaborative filtering with Sharemind}},\n  institution = {Cybernetica},\n  year = {2008},\n  number = {T-4-2},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":176,"type":14,"excerpt":177,"year":178,"authors":179,"tags":181,"pdfFile":10,"pdfUrl":182,"extendedUrl":10,"bibTeX":183},"How to securely perform computations on secret-shared data.","Master's thesis. University of Tartu. 2007.",2007,[180],{"author":135},[],"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F2540",{"tag":184,"width":159,"height":90,"text":185},"Bogdanov07","@MASTERSTHESIS{UT:Bogdanov07,\n  author = {Dan Bogdanov},\n  title = {How to securely perform computations on secret-shared data},\n  school = {University of Tartu},\n  year = {2007},\n}\n",{"title":187,"type":14,"excerpt":188,"year":95,"authors":189,"tags":192,"pdfFile":10,"pdfUrl":193,"extendedUrl":10,"bibTeX":194},"Deploying secure multiparty computation for joint data analysis — a case study.","Master's thesis. University of Tartu. 2011.",[190],{"author":191},"Talviste, R.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fitl_app_talviste_2011.pdf",{"tag":195,"width":24,"height":90,"text":196},"Talviste11","@MASTERSTHESIS{MSc:Talviste11,\n  author = {Riivo Talviste},\n  title = {{Deploying secure multiparty computation for joint data analysis---a case study}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2011}\n}\n",{"title":198,"type":14,"excerpt":199,"year":80,"authors":200,"tags":207,"pdfFile":10,"pdfUrl":208,"extendedUrl":10,"bibTeX":209},"Secure multi-party data analysis: end user validation and practical experiments.","Cryptology ePrint Archive, Report 2013\u002F826. 2013.",[201,202,203,205],{"author":68},{"author":83},{"author":204},"Sven Laur",{"author":206},"Pille Pruulmann-Vengerfeldt",[],"http:\u002F\u002Feprint.iacr.org\u002F2013\u002F826.pdf",{"tag":210,"width":58,"height":90,"text":211},"BKLP13","@misc{eprint:Bogdanov13b,\n    author = {Dan Bogdanov and Liina Kamm and Sven Laur and Pille Pruulmann-Vengerfeldt},\n    title = {{Secure multi-party data analysis: end user validation and practical experiments}},\n    howpublished = {Cryptology ePrint Archive, Report 2013\u002F826},\n    year = {2013},\n    note = {\\url{http:\u002F\u002Feprint.iacr.org\u002F}},\n}\n",{"title":213,"type":14,"excerpt":214,"year":120,"authors":215,"tags":220,"pdfFile":10,"pdfUrl":221,"extendedUrl":222,"bibTeX":223},"Combining Differential Privacy and Secure Multiparty Computation.","In Proceedings of the 31st Annual Computer Security Applications Conference. 2015.",[216,218],{"author":217},"Pettai, M.",{"author":219},"Laud, P.",[],"http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2818000.2818027","http:\u002F\u002Feprint.iacr.org\u002F2015\u002F598.pdf",{"tag":224,"width":24,"height":42,"text":225},"PettaiL15b","@inproceedings{DBLP:conf\u002Facsac\u002FPettaiL15,\n  author    = {Martin Pettai and\n               Peeter Laud},\n  title     = {Combining Differential Privacy and Secure Multiparty Computation},\n  booktitle = {Proceedings of the 31st Annual Computer Security Applications Conference,\n               Los Angeles, CA, USA, December 7-11, 2015},\n  pages     = {421--430},\n  publisher = {{ACM}},\n  year      = {2015},\n  url       = {http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2818000.2818027},\n  doi       = {10.1145\u002F2818000.2818027},\n}\n",{"title":227,"type":228,"excerpt":229,"year":230,"authors":231,"tags":239,"pdfFile":10,"pdfUrl":55,"extendedUrl":10,"bibTeX":240},"Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data.","publication","Proceedings of the 3rd International Workshop on Genome Privacy and Security.",2016,[232,233,235,237],{"author":135},{"author":234},"Kamm, L.",{"author":236},"Laur, S.",{"author":238},"Sokk, V.",[],{"tag":241,"width":242,"height":25,"text":243},"BKLS16b",1050,"@inproceedings{BKLS16b,\n author = {Bogdanov, Dan and Kamm, Liina and Laur, Sven and Sokk, Ville},\n title = {Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data},\n booktitle = {Proceedings of the 3rd International Workshop on Genome Privacy and Security (GenoPri'16)},\n series = {GenoPri '16},\n year = {2016},\n location = {Chicago, USA},\n pages = {1--8},\n numpages = {8},\n url = {http:\u002F\u002F2016.genopri.org\u002Fuploads\u002F3\u002F9\u002F9\u002F9\u002F39999711\u002Fgenopri16_paper_10.pdf}\n}\n",{"title":245,"type":46,"excerpt":246,"year":151,"authors":247,"tags":250,"pdfFile":251,"pdfUrl":55,"extendedUrl":10,"bibTeX":253},"An improved method for privacy-preserving web-based data collection.","Cybernetica research report T-4-5. 2009.",[248,249],{"author":135},{"author":191},[],{"url":252},"\u002Fuploads\u002FT_4_5_An_improved_method_for_privacy_preserving_web_based_data_collection_1548bd1dd2.pdf",{"tag":254,"width":10,"height":90,"text":255},"BT09","@TECHREPORT{CYBER:BT09,\n  author = {Dan Bogdanov and Riivo Talviste},\n  title = {An improved method for privacy-preserving web-based data collection},\n  institution = {Cybernetica},\n  year = {2009},\n  number = {T-4-5},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":257,"type":14,"excerpt":258,"year":164,"authors":259,"tags":262,"pdfFile":10,"pdfUrl":263,"extendedUrl":10,"bibTeX":264},"A programming language for creating privacy-preserving applications","Bachelor's thesis. University of Tartu. 2008.",[260],{"author":261},"Jagomägis, R.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsecrec_language_jagomagis_2010.pdf",{"tag":265,"width":10,"height":90,"text":266},"Jagomagis08","@MISC{BSc:Jagomagis08,\n  author = {Roman Jagom\\\"agis},\n  title = {A programming language for creating privacy-preserving applications},\n  howpublished = {Bachelor's thesis. University of Tartu},\n  year = {2008}\n}\n",{"title":268,"type":46,"excerpt":269,"year":95,"authors":270,"tags":273,"pdfFile":274,"pdfUrl":55,"extendedUrl":10,"bibTeX":276},"Constructing Privacy-Preserving Information Systems Using Secure Multiparty Computation.","Cybernetica research report T-4-13. 2011.",[271,272],{"author":135},{"author":234},[],{"url":275},"\u002Fuploads\u002FT_4_13_Constructing_Privacy_Preserving_Information_Systems_Using_Secure_Multiparty_Computation_f4669f56e1.pdf",{"tag":277,"width":58,"height":90,"text":278},"BK11","@TECHREPORT{CYBER:BK11,\n  author = {Dan Bogdanov and Liina Kamm},\n  title = {{Constructing Privacy-Preserving Information Systems Using Secure Multiparty Computation}},\n  institution = {Cybernetica},\n  year = {2011},\n  number = {T-4-13},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":280,"type":14,"excerpt":281,"year":282,"authors":283,"tags":286,"pdfFile":10,"pdfUrl":287,"extendedUrl":288,"bibTeX":289},"Verifiable Computation in Multiparty Protocols with Honest Majority.","In Proceedings of the 8th International Conference on Provable Security. 2014.",2014,[284,285],{"author":33},{"author":35},[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-319-12475-9_11","https:\u002F\u002Feprint.iacr.org\u002F2014\u002F060.pdf",{"tag":290,"width":115,"height":291,"text":292},"LaudP14",350,"@inproceedings{DBLP:conf\u002Fprovsec\u002FLaudP14,\n  author    = {Peeter Laud and\n               Alisa Pankova},\n  editor    = {Sherman S. M. Chow and\n               Joseph K. Liu and\n               Lucas Chi Kwong Hui and\n               Siu{-}Ming Yiu},\n  title     = {Verifiable Computation in Multiparty Protocols with Honest Majority},\n  booktitle = {Provable Security - 8th International Conference, ProvSec 2014, Hong\n               Kong, China, October 9-10, 2014. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8782},\n  pages     = {146--161},\n  publisher = {Springer},\n  year      = {2014},\n  url       = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-319-12475-9_11},\n  doi       = {10.1007\u002F978-3-319-12475-9_11},\n}\n",{"title":294,"type":14,"excerpt":295,"year":132,"authors":296,"tags":299,"pdfFile":10,"pdfUrl":300,"extendedUrl":10,"bibTeX":301},"Privacy Preserving Collaborative Anomaly Detection Using Secure Multi-party Computation.","Master's thesis. School of Computer Science and Communication, KTH Royal Institute of Technology. 2010.",[297],{"author":298},"Abu Hamed Mohammad Misbah Uddin",[],"\u002Fuploads\u002Fpapers\u002Fanomaly_detection_with_secrec_uddin_2010.pdf",{"tag":302,"width":58,"height":90,"text":303},"Uddin10","@MASTERSTHESIS{MSc:Uddin10,\n  author = {Misbah Uddin},\n  title = {{Privacy Preserving Collaborative Anomaly Detection Using Secure Multi-party Computation}},\n  school = {School of Computer Science and Communication, KTH Royal Institute of Technology},\n  year = {2010}\n}\n",{"title":305,"type":46,"excerpt":306,"year":80,"authors":307,"tags":311,"pdfFile":312,"pdfUrl":55,"extendedUrl":10,"bibTeX":314},"Oblivious Sorting of Secret-Shared Data","Cybernetica research report T-4-19. 2013.",[308,309,310],{"author":135},{"author":236},{"author":191},[],{"url":313},"\u002Fuploads\u002F2013_oblivious_sorting_of_secret_shared_data_D_2_135_v1_0_47f4c88f25.pdf",{"tag":315,"width":159,"height":90,"text":316},"BLT13","@TECHREPORT{CYBER:BLT13,\n  author = {Dan Bogdanov and Sven Laur and Riivo Talviste},\n  title = {{Oblivious Sorting of Secret-Shared Data}},\n  institution = {Cybernetica},\n  year = {2013},\n  number = {T-4-19},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":318,"type":14,"excerpt":319,"year":151,"authors":320,"tags":323,"pdfFile":10,"pdfUrl":324,"extendedUrl":10,"bibTeX":325},"Web-based data entry in privacy-preserving applications.","Bachelor's thesis. University of Tartu. 2009.",[321],{"author":322},"Riivo Talviste",[],"\u002Fuploads\u002Fpapers\u002Fweb-based_controller_talviste_2009.pdf",{"tag":326,"width":159,"height":90,"text":327},"Talviste09","@MISC{BSc:Talviste09,\n  author = {Riivo Talviste},\n  title = {Web-based data entry in privacy-preserving applications},\n  howpublished = {Bachelor's thesis. University of Tartu},\n  year = {2009}\n}\n",{"title":329,"type":14,"excerpt":330,"year":164,"authors":331,"tags":334,"pdfFile":10,"pdfUrl":335,"extendedUrl":10,"bibTeX":336},"Automated Security Proofs of Secret Shared Protocols.","Master's thesis. University of Tartu. 2008.",[332],{"author":333},"Yanjun Yao",[],"\u002Fuploads\u002Fpapers\u002Fsharemind_protocol_prover_yao_2008.pdf",{"tag":337,"width":159,"height":90,"text":338},"Yanjun08","@MASTERSTHESIS{UT:Yao08,\n  author = {Yanjun Yao},\n  title = {{Automated Security Proofs of Secret Shared Protocols}},\n  school = {University of Tartu},\n  year = {2008},\n}\n",{"title":340,"type":14,"excerpt":341,"year":63,"authors":342,"tags":345,"pdfFile":10,"pdfUrl":346,"extendedUrl":10,"bibTeX":347},"A Feasibility Analysis of Secure Multiparty Computation Deployments","Master's thesis. University of Tartu. 2012.",[343],{"author":344},"Rebane, R.",[],"https:\u002F\u002Fcyber.ee\u002Fuploads\u002Fpapers\u002Fsharemind_performance_rebane_2012.pdf",{"tag":348,"width":10,"height":10,"text":349},"Rebane12","@MASTERSTHESIS{MSc:Rebane12,\n  author = {Reimo Rebane},\n  title = {{A Feasibility Analysis of Secure Multiparty Computation Deployments}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2012}\n}\n",{"title":351,"type":14,"excerpt":352,"year":30,"authors":353,"tags":356,"pdfFile":10,"pdfUrl":357,"extendedUrl":10,"bibTeX":358},"Efficient multiparty computation secure against covert and active adversaries","PhD thesis. University of Tartu. 2017.",[354],{"author":355},"Pankova, A.",[],"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F56359",{"tag":359,"width":24,"height":25,"text":360},"P17","@phdthesis{UT:Pankova17,\n  author = {Alisa Pankova},\n  title = {Efficient multiparty computation secure against covert and active adversaries},\n  school = {University of Tartu},\n  year = {2017},\n  url = {http:\u002F\u002Fhdl.handle.net\u002F10062\u002F56359}\n}\n",{"title":362,"type":14,"excerpt":363,"year":95,"authors":364,"tags":369,"pdfFile":10,"pdfUrl":10,"extendedUrl":370,"bibTeX":371},"Round-efficient Oblivious Database Manipulation.","In Proceedings of the 14th International Conference on Information Security, ISC 2011, LNCS, vol. 7001, pp. 262-277. Springer, Heidelberg. 2011. ",[365,366,368],{"author":204},{"author":367},"Bingsheng Zhang",{"author":85},[],"http:\u002F\u002Feprint.iacr.org\u002F2011\u002F429.pdf",{"tag":372,"width":58,"height":10,"text":373},"LZW11","@inproceedings{ISC11:LWZ11,\n  author    = {Sven Laur and\n               Jan Willemson and\n               Bingsheng Zhang},\n  title     = {{Round-Efficient Oblivious Database Manipulation}},\n  booktitle = {Proceedings of the 14th International Conference on Information Security. ISC'11},\n  year      = {2011},\n  pages     = {262-277},\n  ee        = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-642-24861-0_18},\n}\n",{"title":375,"type":228,"excerpt":376,"year":282,"authors":377,"tags":382,"pdfFile":10,"pdfUrl":383,"extendedUrl":10,"bibTeX":384},"Domain-Polymorphic Programming of Privacy-Preserving Applications","In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS'14, ACM Digital Library. 2014.",[378,379,380],{"author":135},{"author":219},{"author":381},"Randmets, J.",[],"http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2637113.2637119",{"tag":385,"width":115,"height":25,"text":386},"BLR14","@inproceedings{PLAS14:BLR14,\n  author = {Dan Bogdanov and Peeter Laud and Jaak Randmets},\n  title = {Domain-Polymorphic Programming of Privacy-Preserving Applications},\n  booktitle = {Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security},\n  series = {PLAS'14},\n  year = {2014},\n  location = {Uppsala, Sweden},\n  pages = {53--65},\n  articleno = {53},\n  url = {http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2637113.2637119},\n  publisher = {ACM}\n}\n",{"title":388,"type":14,"excerpt":389,"year":132,"authors":390,"tags":393,"pdfFile":10,"pdfUrl":394,"extendedUrl":10,"bibTeX":395},"An analysis framework for an imperative privacy-preserving programming language.","Master's thesis. University of Tartu. 2010.",[391],{"author":392},"Ristioja, J.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsecrec_semantics_and_analysis_ristioja_2010.pdf",{"tag":396,"width":24,"height":90,"text":397},"Ristioja10","@MASTERSTHESIS{MSc:Ristioja10,\n  author = {Jaak Ristioja},\n  title = {{An analysis framework for an imperative privacy-preserving programming language}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2010}\n}\n",{"title":399,"type":228,"excerpt":400,"year":107,"authors":401,"tags":416,"pdfFile":10,"pdfUrl":417,"extendedUrl":10,"bibTeX":418},"From Keys to Databases –  Real-World Applications of Secure Multi-Party Computation.","The Computer Journal, Volume 61, Issue 12, 1 December 2018, Pages 1749–1771.",[402,404,405,407,408,410,412,414],{"author":403},"Archer, D. W.",{"author":135},{"author":406},"Lindell, Y.",{"author":234},{"author":409},"Nielsen, K.",{"author":411},"Pagter, J. I.",{"author":413},"Smart, N. P.",{"author":415},"Wright, R. N.",[],"https:\u002F\u002Fdoi.org\u002F10.1093\u002Fcomjnl\u002Fbxy090",{"tag":419,"width":420,"height":42,"text":421},"ABLKNPSW18",1300,"@misc{CJ:ABLKNPSW18,\n  author=\"David W. Archer and Dan Bogdanov and Y. Lindell and Liina Kamm and Kurt Nielsen and Jakob Illeborg Pagter and Nigel P. Smart and Rebecca N. Wright.\",\n  title=\"{{From Keys to Databases --  Real-World Applications of Secure Multi-Party Computation}}\",\n  journal = {The Computer Journal},\n  volume = {61},\n  number = {12},\n  pages = {1749-1771},\n  year = {2018},\n  doi = {10.1093\u002Fcomjnl\u002Fbxy090},\n  URL = {http:\u002F\u002Fdx.doi.org\u002F10.1093\u002Fcomjnl\u002Fbxy090},\n  eprint = {\u002Foup\u002Fbackfile\u002Fcontent_public\u002Fjournal\u002Fcomjnl\u002F61\u002F12\u002F10.1093_comjnl_bxy090\u002F1\u002Fbxy090.pdf}\n}\n",{"title":423,"type":46,"excerpt":424,"year":151,"authors":425,"tags":429,"pdfFile":430,"pdfUrl":55,"extendedUrl":10,"bibTeX":432},"Privacy-preserving Histogram Computation and Frequent Itemset Mining with Sharemind.","Cybernetica research report T-4-8. 2009.",[426,427,428],{"author":68},{"author":37},{"author":204},[],{"url":431},"\u002Fuploads\u002FT_4_8_Privacy_preserving_Histogram_and_Frequent_Itemset_Mining_with_Sharemind_02cb5afcb6.pdf",{"tag":433,"width":58,"height":90,"text":434},"BJL09","@TECHREPORT{CYBER:BJL09,\n  author = {Dan Bogdanov and Roman Jagom\\\"agis and Sven Laur},\n  title = {{Privacy-preserving Histogram Computation and Frequent Itemset Mining with Sharemind}},\n  institution = {Cybernetica},\n  year = {2009},\n  number = {T-4-8},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":436,"type":14,"excerpt":437,"year":63,"authors":438,"tags":442,"pdfFile":10,"pdfUrl":443,"extendedUrl":444,"bibTeX":445},"Deploying secure multi-party computation for financial data analysis (Short Paper).","In Proceedings of the Sixteenth International Conference on Financial Cryptography and Data Security 2012, FC 2012, LNCS, vol 7397, pp 57-64. Springer. 2012.",[439,440,441],{"author":135},{"author":191},{"author":141},[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-642-32946-3_5","http:\u002F\u002Feprint.iacr.org\u002F2011\u002F662.pdf",{"tag":446,"width":447,"height":90,"text":448},"BTW12",900,"@inproceedings{FC12:BTW12,\n  author    = {Dan Bogdanov and Riivo Talviste and Jan Willemson},\n  title     = {Deploying secure multi-party computation for financial data analysis (short paper)},\n  booktitle = {Proceedings of the 16th International Conference on Financial Cryptography and Data Security. FC'12},\n  year      = {2012},\n  pages     = {57-64},\n  ee        = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F11745853_30},\n}\n",{"title":450,"type":14,"excerpt":352,"year":30,"authors":451,"tags":454,"pdfFile":10,"pdfUrl":455,"extendedUrl":10,"bibTeX":456},"Programming Languages for Secure Multi-party Computation Application Development.",[452],{"author":453},"Jaak Randmets",[],"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F56298",{"tag":457,"width":24,"height":90,"text":458},"R17","@phdthesis{UT:Randmets17,\n  author = {Jaak Randmets},\n  title = {Programming Languages for Secure Multi-party Computation Application Development},\n  school = {University of Tartu},\n  year = {2017},\n  url = {http:\u002F\u002Fhdl.handle.net\u002F10062\u002F56298}\n}\n",{"title":460,"type":14,"excerpt":461,"year":80,"authors":462,"tags":468,"pdfFile":10,"pdfUrl":469,"extendedUrl":10,"bibTeX":470},"Specifying Sharemind's Arithmetic Black Box.","In Proceedings of the First ACM Workshop on Language Support for Privacy-enhancing Technologies, PETShop 2013, ACM Digital Library. 2013.",[463,464,465,467],{"author":33},{"author":35},{"author":466},"Martin Pettai",{"author":453},[],"http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2517872.2517874",{"tag":471,"width":472,"height":10,"text":473},"LPPR13",1000,"@inproceedings{PETSHOP13:LPPR13,\n  author    = {Peeter Laud and Alisa Pankova and Martin Pettai and Jaak Randmets},\n  booktitle = {{Proceedings of the First ACM Workshop on Language Support for Privacy-enhancing Technologies, PETShop '13}},\n  title     = {{Specifying Sharemind's Arithmetic Black Box}},\n  series    = {ACM Digital Library},\n  publisher = {ACM},\n  year      = {2013},\n  pages     = {19-22},\n  doi       = {10.1145\u002F2517872.2517874},\n  url = {http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2517872.2517874}\n}\n",{"title":475,"type":14,"excerpt":476,"year":132,"authors":477,"tags":479,"pdfFile":10,"pdfUrl":480,"extendedUrl":10,"bibTeX":481},"An integrated development environment for the SecreC programming language.","Bachelor's thesis. University of Tartu. 2010.",[478],{"author":344},[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsecrecide_rebane_2010.pdf",{"tag":482,"width":10,"height":90,"text":483},"Rebane10","@MISC{BSc:Rebane10,\n  author = {Reimo Rebane},\n  title = {{An integrated development environment for the SecreC programming language}},\n  howpublished = {Bachelor's thesis. University of Tartu},\n  year = {2010}\n}\n",{"title":485,"type":14,"excerpt":188,"year":95,"authors":486,"tags":489,"pdfFile":10,"pdfUrl":490,"extendedUrl":10,"bibTeX":491},"The Use of Circuit Evaluation Techniques for Secure Computation.",[487],{"author":488},"Oleg Šelajev",[],"\u002Fuploads\u002Fpapers\u002Fsharemind_circuits_shelajev_2011.pdf",{"tag":492,"width":10,"height":90,"text":493},"Shelajev11","@MASTERSTHESIS{MSc:Shelajev11,\n  author = {Oleg \\v{S}elajev},\n  title = {{The Use of Circuit Evaluation Techniques for Secure Computation}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2011}\n}\n",{"title":495,"type":14,"excerpt":496,"year":282,"authors":497,"tags":502,"pdfFile":10,"pdfUrl":503,"extendedUrl":10,"bibTeX":504},"From Input Private to Universally Composable Secure Multi-party Computation Primitives.","In Proceedings of the 27th IEEE Computer Security Foundations Symposium, CSF 2014, pp. 184-198. 2014.",[498,499,500,501],{"author":68},{"author":33},{"author":204},{"author":66},[],"http:\u002F\u002Fieeexplore.ieee.org\u002Fxpl\u002FarticleDetails.jsp?arnumber=6957111",{"tag":505,"width":115,"height":42,"text":506},"BLLP14","@inproceedings{CSF14:BLLP14,\n  author    = {Dan Bogdanov and\n               Peeter Laud and\n               Sven Laur and\n               Pille Pullonen},\n  title     = {From Input Private to Universally Composable Secure Multi-party Computation\n               Primitives},\n  booktitle = {{IEEE} 27th Computer Security Foundations Symposium, {CSF} 2014},\n  pages     = {184--198},\n  year      = {2014},\n  month = {July},\n  publisher = {{IEEE}}\n}\n",{"title":508,"type":14,"excerpt":509,"year":120,"authors":510,"tags":512,"pdfFile":10,"pdfUrl":513,"extendedUrl":10,"bibTeX":514},"Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees.","In Proceedings of Privacy Enhancing Technologies. 2015.",[511],{"author":33},[],"http:\u002F\u002Fwww.degruyter.com\u002Fview\u002Fj\u002Fpopets.2015.2015.issue-2\u002Fpopets-2015-0011\u002Fpopets-2015-0011.xml",{"tag":515,"width":447,"height":90,"text":516},"Laud15","@article{DBLP:journals\u002Fpopets\u002FLaud15,\n  author    = {Peeter Laud},\n  title     = {Parallel Oblivious Array Access for Secure Multiparty Computation\n               and Privacy-Preserving Minimum Spanning Trees},\n  journal   = {PoPETs},\n  volume    = {2015},\n  number    = {2},\n  pages     = {188--205},\n  year      = {2015},\n  url       = {http:\u002F\u002Fwww.degruyter.com\u002Fview\u002Fj\u002Fpopets.2015.2015.issue-2\u002Fpopets-2015-0011\u002Fpopets-2015-0011.xml},\n}\n",{"title":518,"type":14,"excerpt":519,"year":151,"authors":520,"tags":523,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":524},"A Comparison of Software Pseudorandom Number Generators","In Proceedings of Third Baltic Conference on Advanced Topics in Telecommunication, Tartu, Estonia 2009 (61 - 71). Rostock: Universität Rostock, Wissenschaftsverbund Iu. 2009.",[521,522],{"author":135},{"author":191},[],{"tag":525,"width":10,"height":10,"text":526},"BT09b","@inproceedings {BASOTI09:BT09,\n   author = {Dan Bogdanov and Riivo Talviste},\n   title = {{A Comparison of Software Pseudorandom Number Generators}},\n   booktitle = {Proceedings of Third Baltic Conference on Advanced Topics in Telecommunication - BaSoTi 2009},\n   editor = {Clemens Cap},\n   publisher = {Rostock: Universit{\\\"a}t Rostock, Wissenschaftsverbund IuK},\n   pages = {61--71},\n   year = {2009}\n}\n",{"title":528,"type":14,"excerpt":389,"year":132,"authors":529,"tags":531,"pdfFile":10,"pdfUrl":532,"extendedUrl":10,"bibTeX":533},"SecreC: a Privacy-Aware Programming Language with Applications in Data Mining.",[530],{"author":37},[],"\u002Fuploads\u002Fpapers\u002Fsecrec_language_jagomagis_2010.pdf",{"tag":534,"width":24,"height":90,"text":535},"Jagomagis10","@MASTERSTHESIS{MSc:Jagomagis10,\n  author = {Roman Jagom\\\"agis},\n  title = {{SecreC: a Privacy-Aware Programming Language with Applications in Data Mining}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2010}\n}\n",{"title":537,"type":46,"excerpt":538,"year":95,"authors":539,"tags":542,"pdfFile":543,"pdfUrl":55,"extendedUrl":10,"bibTeX":545},"Yao Garbled Circuits in Secret Sharing-based Secure Multi-party Computation.","Cybernetica research report T-4-15. 2011. ",[540,541],{"author":488},{"author":204},[],{"url":544},"\u002Fuploads\u002FT_4_15_Yao_Garbled_Circuits_in_Secret_Sharing_based_Secure_Multi_party_Computation_71f6061363.pdf",{"tag":546,"width":24,"height":90,"text":547},"SL11","@TECHREPORT{CYBER:SL11,\n  author = {Oleg \\v{S}elajev and Sven Laur},\n  title = {{Yao Garbled Circuits in Secret Sharing-based Secure Multi-party Computation}},\n  institution = {Cybernetica},\n  year = {2011},\n  number = {T-4-15},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":549,"type":14,"excerpt":461,"year":80,"authors":550,"tags":554,"pdfFile":10,"pdfUrl":555,"extendedUrl":556,"bibTeX":557},"Domain-Polymorphic Programming of Privacy-Preserving Applications.",[551,552,553],{"author":135},{"author":219},{"author":381},[],"http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2517872.2517875","http:\u002F\u002Feprint.iacr.org\u002F2013\u002F371.pdf",{"tag":558,"width":472,"height":10,"text":559},"BLR13","@inproceedings{PETSHOP13:BLR13,\n  author    = {Dan Bogdanov and Peeter Laud and Jaak Randmets},\n  booktitle = {{Proceedings of the First ACM Workshop on Language Support for Privacy-enhancing Technologies, PETShop '13}},\n  title     = {{Domain-Polymorphic Programming of Privacy-Preserving Applications}},\n  series    = {ACM Digital Library},\n  publisher = {ACM},\n  year      = {2013},\n  pages     = {23-26},\n  doi       = {10.1145\u002F2517872.2517875},\n  url = {http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F2517872.2517875}\n}\n",{"title":561,"type":46,"excerpt":562,"year":230,"authors":563,"tags":571,"pdfFile":572,"pdfUrl":55,"extendedUrl":10,"bibTeX":574},"Privacy-preserving tax fraud detection in the cloud with realistic data volumes.","Cybernetica research report T-4-24. 2016.",[564,565,567,569],{"author":68},{"author":566},"Marko Jõemets",{"author":568},"Sander Siim",{"author":570},"Meril Vaht",[],{"url":573},"\u002Fuploads\u002FT_4_24_Privacy_preserving_tax_fraud_detection_in_the_cloud_with_realistic_data_volumes_a79d1ba556.pdf",{"tag":575,"width":58,"height":25,"text":576},"BJSV16","@TECHREPORT{CYBER:BJSV16,\n  author = {Dan Bogdanov and Marko J\\~oemets and Sander Siim and Meril Vaht},\n  title = {Privacy-preserving tax fraud detection in the cloud with realistic data volumes},\n  institution = {Cybernetica AS},\n  year = {2016},\n  number = {T-4-24},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":578,"type":14,"excerpt":579,"year":132,"authors":580,"tags":583,"pdfFile":10,"pdfUrl":584,"extendedUrl":10,"bibTeX":585},"The design of a privacy-preserving distributed virtual machine.","In the Collection of AEOLUS theoretical findings. Deliverable D1.0.6. AEOLUS project IP-FP6-015964. 2010.",[581,582],{"author":68},{"author":204},[],"http:\u002F\u002Faeolus.ceid.upatras.gr\u002Ffiles\u002FD106.pdf",{"tag":586,"width":447,"height":10,"text":587},"BL10","@INCOLLECTION{AEOLUS:BL10,\n  author = {Dan Bogdanov and Sven Laur},\n  title = {The design of a privacy-preserving distributed virtual machine},\n  booktitle = {Collection of AEOLUS theoretical findings. Deliverable 1.0.6},\n  year = {2010},\n  editor = {Christos Kaklamanis},\n  publisher = {Published online at \\url{http:\u002F\u002Faeolus.ceid.upatras.gr\u002Fdeliverables}},\n  pages = {269-280}\n}\n",{"title":589,"type":14,"excerpt":590,"year":95,"authors":591,"tags":597,"pdfFile":10,"pdfUrl":598,"extendedUrl":10,"bibTeX":599},"Secure Multi-Party Sorting and Applications.","Cryptology ePrint Archive, Report 2011\u002F122. 2011.",[592,594,596],{"author":593},"Kristján Valur Jónsson",{"author":595},"Gunnar Kreitz",{"author":298},[],"http:\u002F\u002Feprint.iacr.org\u002F2011\u002F122.pdf",{"tag":600,"width":10,"height":90,"text":601},"JKU11","@misc{eprint:Valur11,\n  author = {Kristj{\\'a}n Valur J{\\'o}nsson and Gunnar Kreitz and Misbah Uddin},\n  title = {{Secure Multi-Party Sorting and Applications}},\n  howpublished = {Cryptology ePrint Archive, Report 2011\u002F122},\n  year = {2011},\n  note = {\\url{http:\u002F\u002Feprint.iacr.org\u002F}},\n}\n",{"title":603,"type":14,"excerpt":604,"year":80,"authors":605,"tags":608,"pdfFile":10,"pdfUrl":609,"extendedUrl":10,"bibTeX":610},"Actively Secure Two-Party Computation: Efficient Beaver Triple Generation","Master's thesis. University of Tartu. 2013.",[606],{"author":607},"Pullonen, P.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsharemind_active_security_pullonen_2013.pdf",{"tag":611,"width":10,"height":90,"text":612},"Pullonen13","@MASTERSTHESIS{MSc:Pullonen13,\n  author = {Pille Pullonen},\n  title = {{Actively Secure Two-Party Computation: Efficient Beaver Triple Generation}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2013}\n}\n",{"title":614,"type":14,"excerpt":615,"year":282,"authors":616,"tags":619,"pdfFile":10,"pdfUrl":620,"extendedUrl":10,"bibTeX":621},"Auditing of Secure Multiparty Computations","Master's thesis. University of Tartu. 2014.",[617],{"author":618},"Pikma, T.",[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fauditing_secure_computations_pikma_2014.pdf",{"tag":622,"width":159,"height":90,"text":623},"Pikma14","@MASTERSTHESIS{MSc:Pikma14,\n  author = {Tiit Pikma},\n  title = {{Auditing of Secure Multiparty Computations}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2014}\n}\n",{"title":625,"type":228,"excerpt":626,"year":230,"authors":627,"tags":633,"pdfFile":10,"pdfUrl":634,"extendedUrl":635,"bibTeX":636},"Rmind: a tool for cryptographically secure statistical analysis.","IEEE Transactions on Dependable and Secure Computing. 2016.",[628,629,630,631],{"author":68},{"author":83},{"author":204},{"author":632},"Ville Sokk",[],"http:\u002F\u002Fdx.doi.org\u002F10.1109\u002FTDSC.2016.2587623","http:\u002F\u002Feprint.iacr.org\u002F2014\u002F512.pdf",{"tag":637,"width":10,"height":90,"text":638},"BKLS16","@article{tdsc:BKLS16,\n  author = {Dan Bogdanov and Liina Kamm and Sven Laur and Ville Sokk},\n  title = {{Rmind: a tool for cryptographically secure statistical analysis}},\n  journal={IEEE Transactions on Dependable and Secure Computing},\n  year={2016},\n  volume={PP},\n  number={99},\n  pages={1-14},\n  doi={10.1109\u002FTDSC.2016.2587623},\n}\n",{"title":640,"type":14,"excerpt":641,"year":120,"authors":642,"tags":645,"pdfFile":10,"pdfUrl":646,"extendedUrl":647,"bibTeX":648},"Privacy Risks and Data Protection Controls in Passenger Name Record Processing.","Diploma Thesis. Estonian Aviation Academy. 2015.",[643],{"author":644},"Annett Saarik",[],"\u002Fuploads\u002Fpapers\u002Fprivacy_risks_and_data_protection_controls_in_passenger_name_record_processing_saarik_2015.pdf","http:\u002F\u002Feprint.iacr.org\u002F2014\u002F990.pdf",{"tag":649,"width":24,"height":90,"text":650},"Saarik15","@MISC{Dipl:Saarik15,\n  author = {Annett Saarik},\n  title = {{Privacy Risks and Data Protection Controls in Passenger Name Record Processing}},\n  howpublished = {Diploma thesis (In Estonian, English summary). Estonian Aviation Academy},\n  year = {2015}\n}\n",{"title":652,"type":14,"excerpt":653,"year":80,"authors":654,"tags":658,"pdfFile":10,"pdfUrl":10,"extendedUrl":659,"bibTeX":660},"Pushing Back the Rain—How to Create Trustworthy Services in the Cloud.","ISACA Journal, Issue 3 - Big Data, 49 - 51, 2013.",[655,656],{"author":68},{"author":657},"Aivo Kalu",[],"http:\u002F\u002Fwww.isaca.org\u002FJournal\u002FPast-Issues\u002F2013\u002FVolume-3\u002FPages\u002FPushing-Back-the-Rain-How-to-Create-Trust-worthy-Services-in-the-Cloud.aspx",{"tag":661,"width":24,"height":10,"text":662},"BK13","@article{ISACA:Bogdanov13,\n  author = {Dan Bogdanov and Aivo Kalu},\n  title = {Pushing Back the Rain---How to Create Trustworthy Services in the Cloud},\n  number = {3},\n  pages = {49-51},\n  year = {2013},\n  URL = {http:\u002F\u002Fwww.isaca.org\u002FJournal\u002FPast-Issues\u002F2013\u002FVolume-3\u002FPages\u002FPushing-Back-the-Rain-How-to-Create-Trust-worthy-Services-in-the-Cloud.aspx},\n  journal = {ISACA Journal}\n}\n",{"title":625,"type":14,"excerpt":664,"year":282,"authors":665,"tags":670,"pdfFile":10,"pdfUrl":635,"extendedUrl":10,"bibTeX":671},"Cryptology ePrint Archive, Report 2014\u002F512. 2014.",[666,667,668,669],{"author":68},{"author":83},{"author":204},{"author":632},[],{"tag":672,"width":10,"height":90,"text":673},"BKLS14","@misc{eprint:BKLS14,\n  author = {Dan Bogdanov and Liina Kamm and Sven Laur and Ville Sokk},\n  title = {{Rmind: a tool for cryptographically secure statistical analysis}},\n  howpublished = {Cryptology ePrint Archive, Report 2014\u002F512},\n  year = {2014},\n  note = {\\url{http:\u002F\u002Feprint.iacr.org\u002F}},\n}\n",{"title":675,"type":14,"excerpt":676,"year":230,"authors":677,"tags":683,"pdfFile":10,"pdfUrl":684,"extendedUrl":10,"bibTeX":685},"Optimizing for Robust and Scalable Integer and Floating-Point Arithmetic.","Financial Cryptography and Data Security - Workshops, BITCOIN, VOTING, and WAHC. 2016.",[678,680,682],{"author":679},"Kerik, L.",{"author":681},"Laud, L.",{"author":381},[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Foptimizing_mpc_for_integer_float_arithmetic_kerik_laud_randmets.pdf",{"tag":686,"width":447,"height":25,"text":687},"SB16","@inproceedings{KerikLR16,\n  author    = {Liisi Kerik and Peeter Laud and Jaak Randmets},\n  title     = {Optimizing {MPC} for Robust and Scalable Integer and Floating-Point Arithmetic},\n  booktitle = {Financial Cryptography and Data Security - {FC} 2016 International Workshops,\n               BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers},\n  pages     = {271--287},\n  year      = {2016},\n  publisher = {Springer},\n  url       = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-662-53357-4_18},\n  doi       = {10.1007\u002F978-3-662-53357-4_18},\n}\n",{"title":689,"type":46,"excerpt":690,"year":282,"authors":691,"tags":696,"pdfFile":697,"pdfUrl":55,"extendedUrl":10,"bibTeX":699},"Turvalist ühisarvutust kasutava käibemaksudeklaratsioonide riskianalüüsi süsteemi prototüüp (Secure multi-party computation system prototype for analyzing risks in value added tax declarations).","Cybernetica research report T-4-22. 2014.",[692,693,694,695],{"author":68},{"author":566},{"author":568},{"author":570},[],{"url":698},"\u002Fuploads\u002F2014_turvalist_uhisarvutust_kasutava_kaibemaksudeklaratsioonide_riskianaluusi_susteemi_prototuup_04255a0d08.pdf",{"tag":700,"width":701,"height":25,"text":702},"BJSV14",1700,"@TECHREPORT{CYBER:BJSV14,\n  author = {Dan Bogdanov and Marko J\\~oemets and Sander Siim and Meril Vaht},\n  title = {{Turvalist \\\"uhisarvutust kasutava k\\\"aibemaksudeklaratsioonide riskianal\\\"u\\\"usi s\\\"usteemi protot\\\"u\\\"up (Secure multi-party computation system prototype for analyzing risks in value added tax declarations)}},\n  institution = {Cybernetica},\n  year = {2014},\n  number = {T-4-22},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":704,"type":14,"excerpt":705,"year":80,"authors":706,"tags":710,"pdfFile":10,"pdfUrl":10,"extendedUrl":711,"bibTeX":712},"From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting.","In Proceedings of the 11th International Conference on Applied Cryptography and Network Security, ACNS 2013, LNCS, vol. 7954, pp. 84-101. Springer. 2013.",[707,708,709],{"author":236},{"author":191},{"author":141},[],"http:\u002F\u002Feprint.iacr.org\u002F2013\u002F203.pdf",{"tag":713,"width":58,"height":10,"text":714},"LTW13","@incollection{ACNS13:Laur13,\n    author={Sven Laur and Riivo Talviste and Jan Willemson},\n    title={{From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting}},\n    year={2013},\n    booktitle={Applied Cryptography and Network Security},\n    volume={7954},\n    series={LNCS},\n    publisher={Springer},\n    pages={84-101}\n}\n",{"title":716,"type":14,"excerpt":717,"year":80,"authors":718,"tags":720,"pdfFile":10,"pdfUrl":721,"extendedUrl":10,"bibTeX":722},"Sharemind: programmable secure computations with practical applications.","PhD thesis. University of Tartu. 2013.",[719],{"author":68},[],"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F29041",{"tag":723,"width":10,"height":90,"text":724},"B13","@phdthesis{UT:Bogdanov13,\n  author = {Dan Bogdanov},\n  title = {Sharemind: programmable secure computations with practical applications},\n  school = {University of Tartu},\n  year = {2013},\n  url = {http:\u002F\u002Fhdl.handle.net\u002F10062\u002F29041}\n}\n",{"title":726,"type":14,"excerpt":727,"year":282,"authors":728,"tags":738,"pdfFile":10,"pdfUrl":739,"extendedUrl":10,"bibTeX":740},"A secure genetic algorithm for the subset cover problem and its application to privacy protection.","In Proceedings of the 8th International Workshop on Information Security Theory and Practice, WISTP 2014, LNCS, vol 8501, pp. 108-123. Springer. 2014.",[729,730,732,733,735,737],{"author":135},{"author":731},"Emura, K.",{"author":261},{"author":734},"Kanaoka, A.",{"author":736},"Matsuo, S.",{"author":141},[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-662-43826-8_8",{"tag":741,"width":24,"height":291,"text":742},"BEJKMW14","@inproceedings{WISTP14:BEJKMW14,\n  author    = {Dan Bogdanov and\n               Keita Emura and\n               Roman Jagom{\\\"{a}}gis and\n               Akira Kanaoka and\n               Shin'ichiro Matsuo and\n               Jan Willemson},\n  title     = {A Secure Genetic Algorithm for the Subset Cover Problem and Its Application\n               to Privacy Protection},\n  booktitle = {Information Security Theory and Practice. Securing the Internet of\n               Things - 8th {IFIP} {WG} 11.2 International Workshop, {WISTP} 2014,\n               Heraklion, Crete, Greece, June 30 - July 2, 2014. Proceedings},\n  pages     = {108--123},\n  year      = {2014},\n  url       = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-662-43826-8_8},\n  doi       = {10.1007\u002F978-3-662-43826-8_8},\n}\n",{"title":744,"type":14,"excerpt":745,"year":230,"authors":746,"tags":748,"pdfFile":10,"pdfUrl":55,"extendedUrl":10,"bibTeX":749},"A Comprehensive Protocol Suite for Secure Two-Party Computation","Master's Thesis. University of Tartu. 2016.",[747],{"author":568},[],{"tag":750,"width":10,"height":10,"text":751},"Siim16","@MASTERSTHESIS{MSc:Siim16,\n  author = {Sander Siim},\n  title = {{A Comprehensive Protocol Suite for Secure Two-Party Computation}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2016}\n}\n",{"title":753,"type":14,"excerpt":754,"year":120,"authors":755,"tags":757,"pdfFile":10,"pdfUrl":758,"extendedUrl":10,"bibTeX":759},"Privacy-preserving statistical analysis using secure multi-party computation.","PhD thesis. University of Tartu. 2015.",[756],{"author":83},[],"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F45343",{"tag":760,"width":24,"height":90,"text":761},"K15","@phdthesis{UT:Kamm15,\n  author = {Liina Kamm},\n  title = {Privacy-preserving statistical analysis using secure multi-party computation},\n  school = {University of Tartu},\n  year = {2015},\n  url = {http:\u002F\u002Fhdl.handle.net\u002F10062\u002F45343}\n}\n",{"title":763,"type":14,"excerpt":745,"year":230,"authors":764,"tags":766,"pdfFile":10,"pdfUrl":767,"extendedUrl":10,"bibTeX":768},"An improved type system for a privacy-aware programming language and its practical applications.",[765],{"author":238},[],"https:\u002F\u002Fsharemind.cyber.ee\u002Ffiles\u002Fpapers\u002Fsecrec_language_improvements_sokk_2016.pdf",{"tag":769,"width":770,"height":90,"text":771},"Sokk16",700,"@MASTERSTHESIS{MSc:Sokk16,\n  author = {Ville Sokk},\n  title = {{An improved type system for a privacy-aware programming language and its practical applications}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2016}\n}\n",{"title":773,"type":14,"excerpt":774,"year":282,"authors":775,"tags":782,"pdfFile":10,"pdfUrl":783,"extendedUrl":10,"bibTeX":784},"Privacy-preserving statistical data analysis on federated databases.","In Proceedings of the 2nd Annual Privacy Forum 2014, APF 2014, LNCS, vol. 8450, pp. 30-55. Springer. 2014.",[776,777,778,779,780,781],{"author":68},{"author":83},{"author":204},{"author":206},{"author":322},{"author":85},[],"http:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-319-06749-0_3",{"tag":785,"width":242,"height":10,"text":786},"BKLPTW14","@inproceedings{APF14:BKL14,\n  author = {Dan Bogdanov and Liina Kamm and Sven Laur and Pille Pruulmann-Vengerfeldt and Riivo Talviste and Jan Willemson},\n  title = {Privacy-preserving statistical data analysis on federated databases},\n  booktitle = {Proceedings of the Annual Privacy Forum. APF'14},\n  series = {LNCS},\n  volume={8450},\n  pages={30-55},\n  year= {2014},\n  location = {Athens, Greece},\n  publisher = {Springer}\n}\n",{"title":788,"type":14,"excerpt":789,"year":230,"authors":790,"tags":799,"pdfFile":10,"pdfUrl":800,"extendedUrl":801,"bibTeX":802},"Students and Taxes: a Privacy-Preserving Social Study Using Secure Computation.","In Proceedings on Privacy Enhancing Technologies, PoPETs, 2016 (3), pp 117–135, 2016.",[791,792,793,795,797,798],{"author":68},{"author":83},{"author":794},"Baldur Kubo",{"author":796},"Reimo Rebane",{"author":632},{"author":322},[],"http:\u002F\u002Fdx.doi.org\u002F10.1515\u002Fpopets-2016-0019","https:\u002F\u002Feprint.iacr.org\u002F2015\u002F1159",{"tag":803,"width":115,"height":25,"text":804},"BKKRST16","@article{PoPETS16:BKKRST16,\n  author = {Dan Bogdanov and Liina Kamm and Baldur Kubo and Reimo Rebane and Ville Sokk and Riivo Talviste},\n  title = {{Students and Taxes: a Privacy-Preserving\n  Study Using Secure Computation}},\n  journal = {PoPETs},\n  volume = {2016},\n  number = {3},\n  pages = {117–135},\n  year = {2016},\n  url = {http:\u002F\u002Fwww.degruyter.com\u002Fview\u002Fj\u002Fpopets.2016.2016.issue-3\u002Fpopets-2015-0019\u002Fpopets-2016-0019.xml},\n}\n",{"title":806,"type":46,"excerpt":807,"year":282,"authors":808,"tags":812,"pdfFile":813,"pdfUrl":55,"extendedUrl":10,"bibTeX":815},"A general mechanism for implementing secure operations on secret shared data.","Cybernetica research report T-4-21. 2014.",[809,811],{"author":810},"Siim, S.",{"author":135},[],{"url":814},"\u002Fuploads\u002FT_4_21_A_general_mechanism_for_implementing_secure_operations_on_secret_shared_data_f35841b317.pdf",{"tag":816,"width":24,"height":10,"text":817},"SB14","@TECHREPORT{CYBER:SB14,\n  author = {Sander Siim and Dan Bogdanov},\n  title = {{A general mechanism for implementing secure operations on secret shared data}},\n  institution = {Cybernetica},\n  year = {2014},\n  number = {T-4-21},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":819,"type":14,"excerpt":820,"year":230,"authors":821,"tags":825,"pdfFile":10,"pdfUrl":826,"extendedUrl":10,"bibTeX":827},"Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation.","In Foundations and Practice of Security: 8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, LNCS, vol. 9482, pp. 66--82, Springer 2016.",[822,824],{"author":823},"Toomas Krips",{"author":85},[],"http:\u002F\u002Fresearch.cyber.ee\u002F~jan\u002Fpubl\u002FPointCounting.pdf",{"tag":828,"width":24,"height":42,"text":829},"KrWi16","@inproceedings{KrWi16,\n  author={Krips, Toomas and Willemson, Jan},\n  editor={Garcia-Alfaro, Joaquin and Kranakis, Evangelos and Bonfante, Guillaume},\n  title={{Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation}},\n  booktitle={Foundations and Practice of Security: 8th International Symposium, FPS 2015,\n             Clermont-Ferrand, France, October 26-28, 2015, Revised Selected Papers},\n  year={2016},\n  series={LNCS},\n  volume={9482},\n  publisher=\"Springer\",\n  pages={66--82},\n  doi=\"10.1007\u002F978-3-319-30303-1_5\",\n  url=\"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-319-30303-1_5\"\n  }\n",{"title":831,"type":14,"excerpt":615,"year":282,"authors":832,"tags":835,"pdfFile":10,"pdfUrl":836,"extendedUrl":10,"bibTeX":837},"Secure Multi-Party Computation Protocol Suite Inspired by Shamir's Secret Sharing Scheme.",[833],{"author":834},"Tiina Turban",[],"\u002Fuploads\u002Fpapers\u002Fsharemind_with_shamir_turban_2014.pdf",{"tag":838,"width":159,"height":90,"text":839},"Turban14","@MASTERSTHESIS{MSc:Turban14,\n  author = {Tiina Turban},\n  title = {{Secure Multi-Party Computation Protocol Suite Inspired by Shamir's Secret Sharing Scheme}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2014}\n}\n",{"title":841,"type":46,"excerpt":842,"year":16,"authors":843,"tags":853,"pdfFile":854,"pdfUrl":55,"extendedUrl":10,"bibTeX":856},"Development and application of cryptography in the Estonian public and private sectors","Cybernetica research report A-116-1. 2019.",[844,846,848,849,850,852],{"author":845},"Buldas, A.",{"author":847},"Kalvet, T.",{"author":219},{"author":355},{"author":851},"Tiits, M.",{"author":141},[],{"url":855},"\u002Fuploads\u002FA_116_1_Development_and_application_of_cryptography_in_the_Estonian_public_and_private_sectors_copy_6f7f3838f5.pdf",{"tag":10,"width":10,"height":10,"text":10},{"title":858,"type":46,"excerpt":859,"year":30,"authors":860,"tags":863,"pdfFile":864,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Profile for High Performance Digital Signatures","Cybernetica research report T-4-24. 2017",[861],{"author":862},"Margus Freudenthal",[],{"url":865},"\u002Fuploads\u002FT_4_23_Profile_for_High_Performance_Digital_Signatures_copy_7bbf4c439a.pdf",{"title":867,"type":46,"excerpt":868,"year":80,"authors":869,"tags":871,"pdfFile":872,"pdfUrl":55,"extendedUrl":55,"bibTeX":10},"Using Batch Hashing for Signing and Time-Stamping","Cybernetica research report T-4-20 \u002F 2013",[870],{"author":862},[],{"url":873},"\u002Fuploads\u002FT_4_20_Using_Batch_Hashing_for_Signing_and_Time_Stamping_3_copy_473794cc10.pdf",{"title":875,"type":46,"excerpt":876,"year":80,"authors":877,"tags":880,"pdfFile":881,"pdfUrl":55,"extendedUrl":10,"bibTeX":883},"Implementing Oberon0 Language with Simpl DSL Tool","Cybernetica research report T-4-18 \u002F 2013.",[878],{"author":879},"Freudenthal, M.",[],{"url":882},"\u002Fuploads\u002FT_4_18_Implementing_Oberon0_Language_with_Simpl_DSL_Tool_a4bf28e481.pdf",{"tag":10,"width":10,"height":10,"text":884},"@TECHREPORT{CYBER:418,\n  author = {Margus Freudenthal,\n  title = {{AImplementing Oberon0 Language with Simpl DSL Tool}},\n  institution = {Cybernetica},\n  year = {2013},\n  number = {T-4-18},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002FT-4-18-Implementing-Oberon0-Language-with-Simpl-DSL-Tool.pdf}}\n}",{"title":886,"type":46,"excerpt":887,"year":63,"authors":888,"tags":891,"pdfFile":892,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings","Cybernetica research report T-4-16 \u002F 2012",[889,890],{"author":35},{"author":33},[],{"url":893},"\u002Fuploads\u002FT_4_16_Symbolic_Analysis_of_Cryptographic_Protocols_Containing_Bilinear_Pairings_4e3c4350fb.pdf",{"title":895,"type":46,"excerpt":896,"year":95,"authors":897,"tags":900,"pdfFile":901,"pdfUrl":903,"extendedUrl":10,"bibTeX":10},"Securing the Future - an Information Flow Analysis of a Distributed OO Language","Cybernetica research report T-4-14 \u002F 2011",[898,899],{"author":466},{"author":33},[],{"url":902},"\u002Fuploads\u002FT_4_14_Securing_the_Future_an_Information_Flow_Analysis_of_a_Distributed_OO_Language_cff07696b4.pdf","https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002FT-4-13-Constructing-Privacy-Preserving-Information-Systems-Using-Secure-Multiparty-Computation.pdf",{"title":905,"type":46,"excerpt":906,"year":95,"authors":907,"tags":911,"pdfFile":912,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"On the (Im)possibility of Perennial Message Recognition Protocols without Public-Key Cryptography","Cybernetica research report T-4-12 \u002F 2011",[908,910],{"author":909},"Madeline Gonzalez Muniz",{"author":33},[],{"url":913},"\u002Fuploads\u002FT_4_12_On_the_Im_possibility_of_Perennial_Message_Recognition_Protocols_without_Public_Key_Cryptography_a3da6c683f.pdf",{"title":915,"type":46,"excerpt":916,"year":132,"authors":917,"tags":921,"pdfFile":922,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"A Model for Automatically Evaluating Trust in X.509 Certificates","Cybernetica research report T-4-11. 2010.",[918,920],{"author":919},"Ahmed, A. S.",{"author":135},[],{"url":923},"\u002Fuploads\u002FT_4_11_A_Model_for_Automatically_Evaluating_Trust_in_X509_Certificates_cb6b99a8b2.pdf",{"title":925,"type":46,"excerpt":926,"year":132,"authors":927,"tags":929,"pdfFile":930,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Simplicitas Software Architecture Document","Cybernetica research report T-4-9 \u002F 2010",[928],{"author":862},[],{"url":931},"\u002Fuploads\u002FT_4_9_Simplicitas_Software_Architecture_Document_7e6f102f48.pdf",{"title":933,"type":46,"excerpt":934,"year":151,"authors":935,"tags":937,"pdfFile":938,"pdfUrl":940,"extendedUrl":10,"bibTeX":941},"Kademlia-based distributed hash tables implementation for VirtualLife","Cybernetica research report T-4-7 \u002F 2009.",[936],{"author":392},[],{"url":939},"\u002Fuploads\u002FT_4_7_Kademlia_based_distributed_hash_tables_implementation_for_Virtual_Life_copy_79056d1e3e.pdf","https:\u002F\u002Fcyber.ee\u002Fuploads\u002FT_4_7_Kademlia_based_distributed_hash_tables_implementation_for_Virtual_Life_copy_79056d1e3e.pdf",{"tag":10,"width":10,"height":10,"text":942},"@techreport{CYBER:R4-7,\n  author      = \"Ristioja, J.\",\n  title       = \"Kademlia-based distributed hash tables implementation for VirtualLife\",\n  institution = \"Cybernetica AS\",\n  year        = \"2009\",\n number = \"T4-7\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":944,"type":46,"excerpt":945,"year":151,"authors":946,"tags":950,"pdfFile":951,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Serial Model for Attack Tree Computations","Cybernetica research report T-4-6 \u002F 2009\n\n",[947,948],{"author":85},{"author":949}," Aivo Jürgenson",[],{"url":952},"\u002Fuploads\u002FT_4_6_Serial_Model_for_Attack_Tree_Computations_copy_b17361797b.pdf",{"title":954,"type":46,"excerpt":955,"year":151,"authors":956,"tags":960,"pdfFile":961,"pdfUrl":963,"extendedUrl":10,"bibTeX":10},"Ründepuud: pooladaptiivne mudel ja ligikaudsed arvutused","Cybernetica research report T-4-4 \u002F 2009",[957,958],{"author":85},{"author":959},"Aivo Jürgenson",[],{"url":962},"\u002Fuploads\u002FT_4_4_Rundepuud_pooladaptiivne_mudel_ja_ligikaudsed_arvutused_69f2007269.pdf","https:\u002F\u002Fcyber.ee\u002Fuploads\u002FT_4_4_Rundepuud_pooladaptiivne_mudel_ja_ligikaudsed_arvutused_69f2007269.pdf",{"title":965,"type":46,"excerpt":966,"year":967,"authors":968,"tags":972,"pdfFile":973,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"X-Road: complete solution for inter-organizational information exchange","Cybernetica research report T-4-1. 2006.",2006,[969,971],{"author":970},"Arne Ansper",{"author":85},[],{"url":974},"\u002Fuploads\u002FT_4_1_X_Road_complete_solution_for_inter_organizational_information_exchange_bf61cb2da1.pdf",{"title":976,"type":46,"excerpt":977,"year":978,"authors":979,"tags":992,"pdfFile":993,"pdfUrl":995,"extendedUrl":10,"bibTeX":10},"Digitaalallkirja juurutamine riigiasutustes","Cybernetica research report nov. 2001.\n",2001,[980,982,983,985,987,989,991],{"author":981},"Ansper, A.",{"author":845},{"author":984},"Heiberg, S.",{"author":986},"Oit, M.",{"author":988},"Oone, K.",{"author":990},"Sepp, O.",{"author":141},[],{"url":994},"\u002Fuploads\u002FDigital_signatures_strat_plan_2001_copy_d95f904edd.pdf","https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002FDigital-signatures-strat-plan-2001.pdf",{"title":997,"type":14,"excerpt":998,"year":999,"authors":1000,"tags":1003,"pdfFile":1004,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Blockchain-based Members Management for the Unified eXchange Platform","MSc thesis. Tallinn University of Technology, 2020 .",2020,[1001],{"author":1002},"Kask, M.",[],{"url":1005},"\u002Fuploads\u002Fmarten_kask_msc_ed68369fde.pdf",{"title":1007,"type":14,"excerpt":1008,"year":999,"authors":1009,"tags":1012,"pdfFile":1013,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"X-Road Trust Model and Technology Threat Analysis","MSc thesis. Tallinn University of Technology, 2020",[1010],{"author":1011},"Tarmo Oja",[],{"url":1014},"\u002Fuploads\u002Ftarmo_oja_msc_42196bb7e7.pdf",{"title":1016,"type":14,"excerpt":1017,"year":999,"authors":1018,"tags":1021,"pdfFile":1022,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Applying Statecharts in Enterprise Information System. A Case Study","MSc thesis. Tallinn University of Technology, 2020.",[1019],{"author":1020},"Salmistu, A.",[],{"url":1023},"\u002Fuploads\u002Faksel_salmistu_msc_78685be212.pdf",{"title":1025,"type":14,"excerpt":1008,"year":999,"authors":1026,"tags":1029,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Vulnerability Analysis of an Organisation on the Basis of a Semi-Formal Model",[1027],{"author":1028},"Maria Toomsalu",[],{"title":1031,"type":14,"excerpt":1032,"year":999,"authors":1033,"tags":1036,"pdfFile":1037,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Zero-Knowledge Proofs for Business Processes","MSc thesis. University of Tartu, 2020",[1034],{"author":1035},"Aivo Toots",[],{"url":1038},"\u002Fuploads\u002Faivo_toots_msc_438a500a90.pdf",{"title":1040,"type":14,"excerpt":1041,"year":16,"authors":1042,"tags":1045,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Framework for Developing Key Risk Indicators for Situational Awareness - the Case Study of Estonia","MSc thesis. Tallinn University of Technology, 2019",[1043],{"author":1044},"Kalev Mändmaa",[],{"title":1047,"type":14,"excerpt":1048,"year":107,"authors":1049,"tags":1052,"pdfFile":1053,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Luuüdi siirdamisjärgse dermise ja skeletilihaste biomehaaniliste omaduste võrdlemine müomeetrilisel teel","MSc thesis. Tallinn University of Technology, 2018.",[1050],{"author":1051},"Põldemaa, M.",[],{"url":1054},"\u002Fuploads\u002Fmihkel_poldemaa_msc_15c852a3eb.pdf",{"title":1056,"type":14,"excerpt":1057,"year":30,"authors":1058,"tags":1061,"pdfFile":1062,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Adapting a Stress Testing Framework to a Multi-module Security-oriented Spring Application","MSc thesis. University of Tartu, 2017.",[1059],{"author":1060},"Proskurin, A.",[],{"url":1063},"\u002Fuploads\u002Fandrei_proskurin_msc_8774ec3755.pdf",{"title":1065,"type":14,"excerpt":1066,"year":230,"authors":1067,"tags":1070,"pdfFile":1071,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Development of broadband aerosol optical depth models","PhD thesis. University of Tartu, 2016.",[1068],{"author":1069},"Kannel, M.",[],{"url":1072},"\u002Fuploads\u002Fmartin_kannel_phd_bbba1949ce.pdf",{"title":1074,"type":14,"excerpt":1075,"year":230,"authors":1076,"tags":1079,"pdfFile":1080,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Embedded Software Solutions for Development of Marine Navigation Light Systems","PhD thesis. Tallinn University of Technology, 2016.",[1077],{"author":1078},"Moorits, E.",[],{"url":1081},"\u002Fuploads\u002Ferkki_moorits_phd_e663f4334d.pdf",{"title":1083,"type":14,"excerpt":1084,"year":230,"authors":1085,"tags":1088,"pdfFile":1089,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Integer programming model for automated valet parking","MSc thesis. University of Tartu, 2016.",[1086],{"author":1087},"Tarbe, K.",[],{"url":1090},"\u002Fuploads\u002Fkarl_tarbe_msc_a40585779e.pdf",{"title":1092,"type":14,"excerpt":1093,"year":120,"authors":1094,"tags":1097,"pdfFile":1098,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Reliable and Efficient Determination of the Likelihood of Rational Attacks","PhD thesis. Tallinn University of Technology, 2015",[1095],{"author":1096},"Aleksandr Lenin",[],{"url":1099},"\u002Fuploads\u002Faleksandr_lenin_phd_8cabc55e30.pdf",{"title":1101,"type":14,"excerpt":1102,"year":80,"authors":1103,"tags":1106,"pdfFile":1107,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Simpl: A toolkit for domain-specific language development in enterprise information systems","PhD thesis. University of Tartu, 2013 ",[1104],{"author":1105},"Margus Freudenthal ",[],{"url":1108},"\u002Fuploads\u002Fmargus_freudenthal_phd_cf5c38f990.pdf",{"title":1110,"type":14,"excerpt":1111,"year":80,"authors":1112,"tags":1115,"pdfFile":1116,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"ESTCube-1 Electrical Power System operation software","MSc thesis. University of Tartu, 2013.",[1113],{"author":1114},"Ilves, T.",[],{"url":1117},"\u002Fuploads\u002Ftaavi_ilves_msc_b78fd42d21.pdf",{"title":1119,"type":14,"excerpt":1111,"year":80,"authors":1120,"tags":1122,"pdfFile":1123,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Insecurity of Transformation-Based Privacy-Preserving Linear Programming",[1121],{"author":355},[],{"url":1124},"\u002Fuploads\u002Falisa_pankova_msc_4d57b2a053.pdf",{"title":1126,"type":14,"excerpt":1127,"year":63,"authors":1128,"tags":1131,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Integrating radio station iCOM IC-M801 into Cybernetica Maritime Communication System","MSc thesis. Tallinn University of Technology, 2012.",[1129],{"author":1130},"Loemaa, R.",[],{"title":1133,"type":14,"excerpt":1134,"year":63,"authors":1135,"tags":1138,"pdfFile":1139,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Speech Synthesis using hidden Markov models","MSc thesis. Tallinn University of Technology, 2012",[1136],{"author":1137},"Rainer Metsavahi",[],{"url":1140},"\u002Fuploads\u002Frainer_metsvahi_msc_bea31dd73c.pdf",{"title":1142,"type":14,"excerpt":1143,"year":63,"authors":1144,"tags":1146,"pdfFile":1147,"pdfUrl":1149,"extendedUrl":10,"bibTeX":10},"Abstract Machine for a Comonadic Dataflow Language","MSc thesis. University of Tartu, 2012.",[1145],{"author":381},[],{"url":1148},"\u002Fuploads\u002Fjaak_randmets_msc_bb061154eb.pdf","http:\u002F\u002Fhdl.handle.net\u002F10062\u002F32991",{"title":1151,"type":14,"excerpt":1152,"year":132,"authors":1153,"tags":1156,"pdfFile":1157,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Attack Tree Methodology and Supporting Software Framework","MSc thesis. Tallinn University of Technology, 2010.",[1154],{"author":1155},"Andrusenko, A.",[],{"url":1158},"\u002Fuploads\u002Falexander_andrusenko_msc_872fd2d056.pdf",{"title":1160,"type":14,"excerpt":1161,"year":132,"authors":1162,"tags":1165,"pdfFile":1166,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Efficient Semantics of Parallel and Serial Models of Attack Trees","PhD thesis. Tallinn University of Technology, 2010.",[1163],{"author":1164},"Jürgenson, A.",[],{"url":1167},"\u002Fuploads\u002Faivo_jyrgenson_phd_fdd286f5c8.pdf",{"title":1169,"type":14,"excerpt":1170,"year":132,"authors":1171,"tags":1174,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Stress and the causes in teacher’s profession","MSc thesis. University of Tartu, 2010",[1172],{"author":1173},"Kerli Liblik",[],{"title":1176,"type":14,"excerpt":1177,"year":132,"authors":1178,"tags":1181,"pdfFile":1182,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Practical Finite-state Morphology of Estonian","MSc thesis.University of Tartu, 2010",[1179],{"author":1180},"Jaak Pruulmann-Vengerfeldt",[],{"url":1183},"\u002Fuploads\u002Fjaak_pruulmann_vengerfeldt_msc_a3c70847c4.pdf",{"title":1185,"type":14,"excerpt":1186,"year":132,"authors":1187,"tags":1190,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Development of SP and MatLAB based data processing environment (for SME)","MSc thesis. Mainor Business School, 2010.",[1188],{"author":1189},"Rahkema, A.",[],{"title":1192,"type":14,"excerpt":1193,"year":151,"authors":1194,"tags":1197,"pdfFile":1198,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"VirtualLife Security Infrastructure","MSc thesis. University of Tartu, 2009",[1195],{"author":1196},"Ilja Livenson",[],{"url":1199},"\u002Fuploads\u002Filja_livenson_msc_d7c2ef2b32.pdf",{"title":1201,"type":14,"excerpt":1202,"year":151,"authors":1203,"tags":1206,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"“Software Development Process Measurement Applied to Organization X","MSc thesis, Tallinn University of Technology, 2009",[1204],{"author":1205},"Anna Sizova",[],{"title":1208,"type":14,"excerpt":1209,"year":164,"authors":1210,"tags":1212,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Hardware Means for Provision of High Availability Operation of a Server Component in a Mission Critical Remote Monitoring System","MSc thesis. Tallinn University of Technology, 2008.",[1211],{"author":1078},[],{"title":1214,"type":14,"excerpt":1215,"year":164,"authors":1216,"tags":1218,"pdfFile":1219,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"A Functional Programming Language and its Semantics","MSc thesis. University of Tartu, 2008",[1217],{"author":466},[],{"url":1220},"\u002Fuploads\u002Fmartin_pettai_msc_18cd434b1c.pdf",{"title":1222,"type":14,"excerpt":1209,"year":164,"authors":1223,"tags":1226,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Case Study of Applying Software Reuse Methodology",[1224],{"author":1225},"Puus, P.",[],{"title":1228,"type":14,"excerpt":1229,"year":164,"authors":1230,"tags":1233,"pdfFile":1234,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Model of Self-Oscillating Ionic Polymer-Metal Composite Bending Actuator","MSc thesis. University of Tartu, 2008.",[1231],{"author":1232},"Pugal, D.",[],{"url":1235},"\u002Fuploads\u002Fdavid_pugal_msc_c595112f3a.pdf",{"title":1237,"type":14,"excerpt":1209,"year":164,"authors":1238,"tags":1241,"pdfFile":1242,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Conceptual analysis and development of the user interface framework",[1239],{"author":1240},"Tolstouhhov, J.",[],{"url":1243},"\u002Fuploads\u002Fjevgeni_tolstouhhov_msc_2e1ef7fb82.pdf",{"title":1245,"type":14,"excerpt":1246,"year":178,"authors":1247,"tags":1249,"pdfFile":1250,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Modeling of atmospheric aerosol spectral optical depth","MSc thesis. University of Tartu, 2007.",[1248],{"author":1069},[],{"url":1251},"\u002Fuploads\u002Fmartin_kannel_msc_33eeafd67d.pdf",{"title":1253,"type":14,"excerpt":1246,"year":178,"authors":1254,"tags":1257,"pdfFile":1258,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Forward Compatible Design of Web Services Presentation Layer",[1255],{"author":1256},"Karus, S.",[],{"url":1259},"\u002Fuploads\u002Fsiim_karus_msc_0429f348e2.pdf",{"title":1261,"type":14,"excerpt":1262,"year":178,"authors":1263,"tags":1266,"pdfFile":1267,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Modelling of terahertz broadband radiation sources based on GaAs\u002FAIGaAs quantum well heterostructures","MSc thesis. Tallinn University of Technology, 2007.",[1264],{"author":1265},"Reeder, R.",[],{"url":1268},"\u002Fuploads\u002Freeno_reeder_msc_f301cc6ff0.pdf",{"title":1270,"type":14,"excerpt":1246,"year":178,"authors":1271,"tags":1274,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Bio-optical model of Lake Peipsi",[1272],{"author":1273},"Valdmets, K.",[],{"title":1276,"type":14,"excerpt":1277,"year":967,"authors":1278,"tags":1281,"pdfFile":1282,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Path Planning and Learning Strategies for Mobile Robots in Dynamic Partially Unknown Environments","PhD thesis. University of Tartu, 2006",[1279],{"author":1280},"Kristo Heero",[],{"url":1283},"\u002Fuploads\u002Fkristo_heero_phd_75a243a782.pdf",{"title":1285,"type":14,"excerpt":1286,"year":1287,"authors":1288,"tags":1290,"pdfFile":1291,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"The Parser Generator JavaCC and Sketchy Modeling"," MSc thesis. University of Tartu, 2002",2002,[1289],{"author":1280},[],{"url":1292},"\u002Fuploads\u002Fkristo_heero_msc_dfd0d6a3f0.pdf",{"title":1294,"type":14,"excerpt":1295,"year":1287,"authors":1296,"tags":1298,"pdfFile":1299,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Methods for Improving Software Quality: a Case Study","MSc thesis. University of Tartu, 2002.",[1297],{"author":984},[],{"url":1300},"\u002Fuploads\u002Fsven_heiberg_msc_0bf15e8480.pdf",{"title":1302,"type":14,"excerpt":1303,"year":1287,"authors":1304,"tags":1306,"pdfFile":1307,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Computationally Secure Information Flow","PhD thesis. University of Saarland, 2002",[1305],{"author":33},[],{"url":1308},"\u002Fuploads\u002Fpeeter_laud_phd_43d7d9462a.pdf",{"title":1310,"type":14,"excerpt":1295,"year":1287,"authors":1311,"tags":1314,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Digital Document Standardization Process in Estonian Republic",[1312],{"author":1313},"Puus, U.",[],{"title":1316,"type":14,"excerpt":1317,"year":1287,"authors":1318,"tags":1321,"pdfFile":1322,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Size-efficient interval time stamps","PhD thesis. University of Tartu, 2002",[1319],{"author":1320},"Jan Villemson",[],{"url":1323},"\u002Fuploads\u002Fjan_villemson_phd_9c324b5336.pdf",{"title":1325,"type":14,"excerpt":1326,"year":978,"authors":1327,"tags":1329,"pdfFile":1330,"pdfUrl":1332,"extendedUrl":10,"bibTeX":10},"E-government from security viewpoint","MSc thesis. Tallinn Technical University, 2001.",[1328],{"author":981},[],{"url":1331},"\u002Fuploads\u002Farne_ansper_msc_8f292b787e.pdf","https:\u002F\u002Fcyber.ee\u002Fuploads\u002Farne_ansper_msc_8f292b787e.pdf",{"title":1334,"type":14,"excerpt":1335,"year":978,"authors":1336,"tags":1338,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Personal Security Environments","MSc thesis. Tallinn Technical University, 2001",[1337],{"author":862},[],{"title":1340,"type":14,"excerpt":1341,"year":978,"authors":1342,"tags":1345,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Unified Software Development Process and a Case Study of It’s Application","MSc thesis. University of Tartu, 2001",[1343],{"author":1344},"Asko Seeba",[],{"title":1347,"type":14,"excerpt":1348,"year":1349,"authors":1350,"tags":1352,"pdfFile":1353,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"An Algebraic Approach to the Structure of Graphs","PhD thesis. Tallinn University of Technology, 1999.",1999,[1351],{"author":845},[],{"url":1354},"\u002Fuploads\u002Fahto_buldas_phd_7a8b07a83e.pdf",{"title":1356,"type":14,"excerpt":1357,"year":1349,"authors":1358,"tags":1361,"pdfFile":1362,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Secure and Efficient Time-Stamping Systems","PhD thesis. University of Tartu, 1999",[1359],{"author":1360},"Helger Lipmaa",[],{"url":1363},"\u002Fuploads\u002Fhelger_lipmaa_phd_1b99d4351f.pdf",{"title":1365,"type":14,"excerpt":1366,"year":1349,"authors":1367,"tags":1370,"pdfFile":1371,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Integrating Time-Stamping and Notarization","MSc thesis. Universirty of Tartu, 1999.",[1368],{"author":1369},"Roos, M.",[],{"url":1372},"\u002Fuploads\u002Fmeelis_roos_msc_75c7bccc63.pdf",{"title":1374,"type":14,"excerpt":1375,"year":1376,"authors":1377,"tags":1379,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Generalised context-free grammars","MSc thesis. University of Tartu 1998.",1998,[1378],{"author":219},[],{"title":1381,"type":14,"excerpt":1382,"year":1376,"authors":1383,"tags":1385,"pdfFile":1386,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Cube graphs and their generalizations as vertex-transitive permutation graphs","MSc thesis, Tartu 1998.",[1384],{"author":141},[],{"url":1387},"\u002Fuploads\u002Fjan_villemson_msc_a501eaa2ae.pdf",{"title":1389,"type":228,"excerpt":1390,"year":1391,"authors":1392,"tags":1399,"pdfFile":10,"pdfUrl":1400,"extendedUrl":10,"bibTeX":1401},"Parallel Privacy-Preserving Shortest Paths by Radius-Stepping","29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, April 2021 ",2021,[1393,1395,1397,1398],{"author":1394},"Anagreh, M.",{"author":1396},"Vainikko, E.",{"author":219},{"author":55},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FPDP52278.2021.00051",{"tag":10,"width":10,"height":10,"text":1402},"@INPROCEEDINGS{9407214,  author={Anagreh, Mohammad and Vainikko, Eero and Laud, Peeter},  booktitle={2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)},   title={Parallel Privacy-Preserving Shortest Paths by Radius-Stepping},   year={2021},  volume={},  number={},  pages={276-280},  doi={10.1109\u002FPDP52278.2021.00051}}",{"title":1404,"type":228,"excerpt":1405,"year":1391,"authors":1406,"tags":1410,"pdfFile":10,"pdfUrl":1411,"extendedUrl":10,"bibTeX":1412},"Parallel Privacy-preserving Computation of Minimum Spanning Trees","In Proceedings of the 7th International Conference on Information Systems Security and Privacy - ICISSP 2021, SCITEPRESS ISBN 978-989-758-491-6, pages 181-190.",[1407,1408,1409],{"author":1394},{"author":1396},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.5220\u002F0010255701810190",{"tag":10,"width":10,"height":10,"text":1413},"@conference{icissp21,\nauthor={Mohammad Anagreh. and Eero Vainikko. and Peeter Laud.},\ntitle={Parallel Privacy-preserving Computation of Minimum Spanning Trees},\nbooktitle={Proceedings of the 7th International Conference on Information Systems Security and Privacy - ICISSP,},\nyear={2021},\npages={181-190},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0010255701810190},\nisbn={978-989-758-491-6},\nissn={2184-4356},\n}",{"title":1415,"type":228,"excerpt":1416,"year":1391,"authors":1417,"tags":1423,"pdfFile":10,"pdfUrl":1424,"extendedUrl":10,"bibTeX":1425},"Developing a Personal Voting Machine for the Estonian Internet Voting System","Proceedings of the 36th Annual ACM Symposium on Applied Computing, March 2021, Pages 1607–1616.",[1418,1420,1422],{"author":1419},"Farzaliyev, V.",{"author":1421},"Krips, K.",{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3412841.3442034",{"tag":10,"width":10,"height":10,"text":1426},"@inproceedings{10.1145\u002F3412841.3442034,\nauthor = {Farzaliyev, Valeh and Krips, Kristjan and Willemson, Jan},\ntitle = {Developing a Personal Voting Machine for the Estonian Internet Voting System},\nyear = {2021},\nisbn = {9781450381048},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3412841.3442034},\ndoi = {10.1145\u002F3412841.3442034},\nabstract = {As the world's population is increasingly mobile, remote voting becomes more and more a necessity. Vote casting by paper mail is slow, expensive and error-prone. Voting over Internet, on the other hand, is a subject to a wide range of cyber attacks. One of the weakest points in current Internet voting (i-voting) schemes is the end user environment that is hard to control against both vote integrity and privacy attacks. The essence of the problem is that conventional end user devices (PC-s, mobile phones, etc.) are in some sense too powerful, being able to run malware without the voter having efficient means to detect it.In the current paper, we propose a solution to this problem by introducing a single-purpose user-controlled voting device built on top of a microcontroller platform. We take the Estonian i-voting protocol as the example use case and build an independent client for it that runs on the ESP32 platform. As a by-product, we will also release the first open-source voting client for the Estonian i-voting protocol.},\nbooktitle = {Proceedings of the 36th Annual ACM Symposium on Applied Computing},\npages = {1607–1616},\nnumpages = {10},\nkeywords = {vote privacy, remote electronic voting, personal voting devices},\nlocation = {Virtual Event, Republic of Korea},\nseries = {SAC '21}\n}\n\n",{"title":1428,"type":228,"excerpt":1429,"year":1391,"authors":1430,"tags":1445,"pdfFile":10,"pdfUrl":1446,"extendedUrl":10,"bibTeX":1447},"A robust privacy preserving approach for electronic health records using multiple dataset with multiple sensitive attributes","Computers and Security, Volume 105, June 2021",[1431,1433,1435,1437,1439,1441,1443],{"author":1432},"Kanwal, T.",{"author":1434},"Anjum, A.",{"author":1436},"Malik, S.U.R.",{"author":1438},"Sajjad, H.",{"author":1440},"Khan, A.",{"author":1442},"Manzoor, U.",{"author":1444},"Asheralieva, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2021.102224",{"tag":10,"width":10,"height":10,"text":1448},"@article{KANWAL2021102224,\ntitle = {A robust privacy preserving approach for electronic health records using multiple dataset with multiple sensitive attributes},\njournal = {Computers & Security},\nvolume = {105},\npages = {102224},\nyear = {2021},\nissn = {0167-4048},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2021.102224},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167404821000481},\nauthor = {Tehsin Kanwal and Adeel Anjum and Saif U.R. Malik and Haider Sajjad and Abid Khan and Umar Manzoor and Alia Asheralieva},\nkeywords = {Electronic Health Record, Identity Disclosure, Sensitive Attribute Disclosure, Balanced p sensitive k anonymity model, Formal Verification, Privacy-Preserving, Multiple Sensitive Attributes (MSAs)},\nabstract = {Privacy preserving data publishing of electronic health record (EHRs) for 1 to M datasets with multiple sensitive attributes (MSAs) is an interesting and challenging issue. There is always a trade-off between privacy and utility in data publishing. Most of the privacy-preserving models shows critical privacy disclosure issues and, hence, they are not robust in practical datasets. The k-anonymity model is a broadly used privacy model to analyze privacy disclosures, however, this model is only useful against identity disclosure. To address the limitations of k-anonymity, a group of privacy model extensions have been proposed in past years. It includes a p-sensitive k-anonymity model, a p+-sensitive k-anonymity model, and a balanced p+-sensitive k-anonymity model. However these privacy-preserving models are not sufficient to preserve the privacy of end-users in practical datasets. In this paper we have formalize the behavior of an adversary which perform identity and attribute disclosures on balanced p+-sensitive k-anonymity model with the help of adversarial scenarios. Since balanced p+-sensitive k-anonymity model is not sufficient for 1 to M with MSAs datasets privacy preservation. We propose an extended privacy model called “1: M MSA-(p, l)-diversity” for 1: M dataset with MSAs. We then perform formal modeling and verification of the proposed model using High-Level Petri Nets (HLPN) to confirm privacy attacks invalidation. Experimental results show that our proposed “1: M MSA-(p, l)-diversity model” is efficient and provide enhanced data utility of published data.}\n}",{"title":1450,"type":228,"excerpt":1451,"year":1391,"authors":1452,"tags":1459,"pdfFile":10,"pdfUrl":1460,"extendedUrl":10,"bibTeX":1461},"Privacy preservation of electronic health records with adversarial attacks identification in hybrid cloud","Computers and Security, Volume 78, October 2021",[1453,1454,1455,1456,1457],{"author":1432},{"author":1434},{"author":1436},{"author":1440},{"author":1458},"Khan, M.",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.csi.2021.103522",{"tag":10,"width":10,"height":10,"text":1462},"@article{KANWAL2021103522,\ntitle = {Privacy preservation of electronic health records with adversarial attacks identification in hybrid cloud},\njournal = {Computer Standards & Interfaces},\nvolume = {78},\npages = {103522},\nyear = {2021},\nissn = {0920-5489},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.csi.2021.103522},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0920548921000179},\nauthor = {Tehsin Kanwal and Adeel Anjum and Saif U.R. Malik and Abid Khan and Muazzam A. Khan},\nkeywords = {EHRs, Hybrid cloud, Privacy, Generalization, Cryptography, Formal verification},\nabstract = {An increasing trend in healthcare organizations to outsource EHRs’ data to the cloud highlights new challenges regarding the privacy of given individuals. Healthcare organizations outsource their EHRs data in a hybrid cloud that elevates the problem of security and privacy in terms of EHRs’ access to an unlimited number of recipients in a hybrid cloud environment. In this paper, we investigated the need for a privacy-preserving access control model for the hybrid cloud. A comprehensive and exploratory analysis of privacy-preserving solutions with the help of taxonomy for cloud-based EHRs is described in this work. We have formally identified the existence of internal access control and external privacy disclosures in outsourcing system architecture for hybrid cloud. Then, we proposed a privacy-preserving XACML based access control model (PPX-AC) that supports fine-grained access control with the multipurpose utilization of EHRs alongside state-of-the-art privacy mechanism. Our proposed approach invalidates the identified security and privacy attacks. We have formally verified the proposed privacy-preserving XACML based access control model (PPX-AC) with the invalidation of identified privacy attacks using High-Level Petri Nets (HLPN). Moreover, property verification of the proposed model in SMT-lib and Z3 solver and implementation of the model proves its effectiveness in terms of privacy-aware EHRs access and multipurpose usage.}\n}",{"title":1464,"type":228,"excerpt":1465,"year":1391,"authors":1466,"tags":1475,"pdfFile":1476,"pdfUrl":1478,"extendedUrl":10,"bibTeX":1479},"A User-Centric QoS-Aware Multi-Path Service Provisioning in Mobile Edge Computing","IEEE Access ( Volume: 9), March 2021, Pages 56020 - 56030",[1467,1468,1469,1471,1473],{"author":1436},{"author":1432},{"author":1470},"Kjan, S.",{"author":1472},"Malik, H.",{"author":1474},"Pervaiz, H.",[],{"url":1477},"\u002Fuploads\u002FA_User_Centric_Qo_S_Aware_Multi_Path_Service_Provisioning_in_Mobile_Edge_Computing_cd012dc9de.pdf","https:\u002F\u002Fdoi.org\u002F10.1109\u002FACCESS.2021.3070104",{"tag":10,"width":10,"height":10,"text":1480},"@ARTICLE{9391720,  author={Malik, Saif U. R. and Kanwal, Tehsin and Khan, Samee U. and Malik, Hassan and Pervaiz, Haris},  journal={IEEE Access},   title={A User-Centric QoS-Aware Multi-Path Service Provisioning in Mobile Edge Computing},   year={2021},  volume={9},  number={},  pages={56020-56030},  doi={10.1109\u002FACCESS.2021.3070104}}",{"title":1482,"type":228,"excerpt":1483,"year":999,"authors":1484,"tags":1504,"pdfFile":10,"pdfUrl":1505,"extendedUrl":10,"bibTeX":10},"Transitioning from testbeds to ships: an experience study in deploying the TIPPERS Internet of Things platform to the US Navy","The Journal of Defence Modeling and Simulation: Applications, Methodology, Technology, ARTN 1548512920956383, September 2020",[1485,1487,1489,1491,1493,1495,1497,1499,1501,1503],{"author":1486},"Dave Archer",{"author":1488},"Michael A. August",{"author":1490},"Georgios Bouloukakis",{"author":1492},"Christopher Davison",{"author":1494},"Mamadou H. Diallo",{"author":1496},"Dhrubajyoti Ghosh",{"author":1498},"Christopher T. Graves",{"author":1500},"Michael Hay",{"author":1502},"Xi He",{"author":33},[],"https:\u002F\u002Fdoi.org\u002F10.1177\u002F1548512920956383",{"title":1507,"type":228,"excerpt":1508,"year":999,"authors":1509,"tags":1513,"pdfFile":10,"pdfUrl":1514,"extendedUrl":10,"bibTeX":10},"Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM","Proceedings of the 6th International Conference on Information Systems Security and Privacy: ICISSP 2020, 6th International Conference on Information Systems Security and Privacy, Valetta, Malta, 25.-27.02.2020. SciTePress, 176−184.",[1510,1511,1512],{"author":1394},{"author":1396},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.5220\u002F0009129501760184",{"title":1516,"type":228,"excerpt":1517,"year":999,"authors":1518,"tags":1530,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Verification of privacy-enhanced collaborations","FORMALISE 2020 8th Conference on Formal Methods in Software Engineering, May 25-26 2020, Seoul, South Korea. ACM Digital Library",[1519,1521,1523,1525,1526,1528],{"author":1520},"Belluccini, S.",{"author":1522},"De Nicola, R.",{"author":1524},"Dumas, M.",{"author":607},{"author":1527},"Re, B.",{"author":1529},"Tiezzi, F. ",[],{"title":1532,"type":228,"excerpt":1533,"year":999,"authors":1534,"tags":1538,"pdfFile":10,"pdfUrl":1539,"extendedUrl":10,"bibTeX":10},"Infotehnoloogilised võimalused põhiõiguste kaitsel","Juridica, 2020\u002F6, lk 474-481. Tartu Ülikool.",[1535,1536],{"author":135},{"author":1537},"Siil, T.",[],"https:\u002F\u002Fjuridica.ee\u002Farticle.php?uri=2020_6_infotehnoloogilised_v_imalused_p_hi_iguste_kaitsel",{"title":1541,"type":228,"excerpt":1542,"year":999,"authors":1543,"tags":1555,"pdfFile":1556,"pdfUrl":1558,"extendedUrl":10,"bibTeX":10},"Use your Brain! Arithmetic 3PC For Any Modulus with Active Security.","1st Conference on Information-Theoretic Cryptography (ITC 2020)",[1544,1546,1548,1550,1551,1553],{"author":1545},"Eerikson, H.",{"author":1547},"Keller, M.",{"author":1549},"Orlandi, C.",{"author":607},{"author":1552},"Puura, J.",{"author":1554},"Simkin, M. ",[],{"url":1557},"\u002Fuploads\u002FLIP_Ics_ITC_2020_5_fa23bfed08.pdf","https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ITC.2020.5",{"title":1560,"type":228,"excerpt":1561,"year":999,"authors":1562,"tags":1572,"pdfFile":10,"pdfUrl":1573,"extendedUrl":10,"bibTeX":10},"Proceedings of the Best Dissertation Award, Doctoral Consortium, and Demonstration & Resources Track","BPM 2020 co-located with the 18th International Conference on Business Process Management (BPM 2020), Sevilla, Spain, September 13-18, 2020. CEUR, 72−76. (CEUR Workshop Proceedings; 2673)",[1563,1565,1567,1568,1569,1570],{"author":1564},"Elkoumy, G.",{"author":1566},"Fahrenkrog-Petersen, S.A.",{"author":1524},{"author":219},{"author":355},{"author":1571},"Weidlich, M.",[],"http:\u002F\u002Fceur-ws.org\u002FVol-2673\u002FpaperDR02.pdf",{"title":1575,"type":228,"excerpt":1576,"year":999,"authors":1577,"tags":1585,"pdfFile":1586,"pdfUrl":1588,"extendedUrl":10,"bibTeX":10},"Secure Multi-Party Computation for Inter-Organizational Process Mining. Enterprise, Business-Process and Information Systems Modeling: Business Process Modeling, Development, and Support – the 21th edition of the BPMDS series","Grenoble, France, 8.-9.06.2020. Springer. (Lecture Notes in Business Information Processing (LNBIP))",[1578,1579,1580,1581,1582,1584],{"author":1564},{"author":1566},{"author":1524},{"author":219},{"author":1583},"Pankova, A",{"author":1571},[],{"url":1587},"\u002Fuploads\u002FElkoumy2020_Chapter_Secure_Multi_party_Computation_Fo_31cc95938d.pdf","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-49418-6_11",{"title":1590,"type":228,"excerpt":1591,"year":999,"authors":1592,"tags":1600,"pdfFile":10,"pdfUrl":1601,"extendedUrl":10,"bibTeX":1602},"Cyber Physical Systems and IoT: Architectural Practices, Interoperability, and Transformation.","IT Professional, Volume: 22 , Issue: 3 , May-June 1 2020.",[1593,1595,1597,1598],{"author":1594},"Fatima, I.",{"author":1596},"Malik, S.U. R.",{"author":1434},{"author":1599},"Ahmad, N.",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FMITP.2019.2912604",{"tag":10,"width":10,"height":10,"text":1603},"@ARTICLE{9098003,\n  author={Fatima, Iqra and Malik, Saif U. R. and Anjum, Adeel and Ahmad, Naveed},\n  journal={IT Professional}, \n  title={Cyber Physical Systems and IoT: Architectural Practices, Interoperability, and Transformation}, \n  year={2020},\n  volume={22},\n  number={3},\n  pages={46-54},\n  doi={10.1109\u002FMITP.2019.2912604}}\n",{"title":1605,"type":228,"excerpt":1606,"year":999,"authors":1607,"tags":1613,"pdfFile":10,"pdfUrl":1614,"extendedUrl":10,"bibTeX":10},"Application of formal methods to modelling and analysis aspects of business process reengineering.","Business Process Management Journal, 26 (2), 548−569.",[1608,1610,1611,1612],{"author":1609},"Haseeb, J.",{"author":1599},{"author":1436},{"author":1434},[],"https:\u002F\u002Fdoi.org\u002F10.1108\u002FBPMJ-02-2019-0078",{"title":1616,"type":228,"excerpt":1617,"year":999,"authors":1618,"tags":1622,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Planning the next steps for Estonian Internet voting","In Robert Krimmer, Melanie Volkamer, Bernhard Beckert, Ardita Driza Maurer, David Dueñas-Cid, Stéphane Glondu, Iuliia Krivonosova, Oksana Kulyk, Ralf Küsters, Beata Martin-Rozumilowicz, Peter Rønne, Mihkel Solvak, Oliver Spycher, Proceedings of the Fifth International Joint Conference on Electronic Voting, E-Vote-ID 2020. TALTECH Press 2020, pp. 82-97.",[1619,1620,1621],{"author":984},{"author":1421},{"author":141},[],{"title":1624,"type":228,"excerpt":1625,"year":999,"authors":1626,"tags":1640,"pdfFile":1641,"pdfUrl":1643,"extendedUrl":10,"bibTeX":10},"θ-Sensitive k-Anonymity: An Anonymization Model for IoT based Electronic Health Records","Electronics 2020, Volume 9, Issue 5, 716",[1627,1629,1631,1633,1634,1635,1636,1638],{"author":1628},"Khan, R.",{"author":1630},"Tao, X.",{"author":1632}," Anjum, A.",{"author":1432},{"author":1436},{"author":1440},{"author":1637},"Rehman, W.",{"author":1639},"Maple, C.",[],{"url":1642},"\u002Fuploads\u002Felectronics_09_00716_v2_89a4882392.pdf","https:\u002F\u002Fdoi.org\u002F10.3390\u002Felectronics9050716",{"title":1645,"type":228,"excerpt":1646,"year":999,"authors":1647,"tags":1657,"pdfFile":10,"pdfUrl":1658,"extendedUrl":10,"bibTeX":10},"Privacy Preserving for Multiple Sensitive Attributes against Fingerprint Correlation Attack Satisfying c-Diversity.","Hindawi Wireless Communications and Mobile Computing Volume 2020, Article ID 8416823, 18 pages",[1648,1649,1650,1651,1653,1654,1655],{"author":1628},{"author":1630},{"author":1434},{"author":1652}," Sajjad, H.",{"author":1436},{"author":1440},{"author":1656},"Amiri, F.",[],"https:\u002F\u002Fdoi.org\u002F10.1155\u002F2020\u002F8416823",{"title":1660,"type":228,"excerpt":1661,"year":999,"authors":1662,"tags":1675,"pdfFile":10,"pdfUrl":1676,"extendedUrl":10,"bibTeX":1677},"A Cache-Based Approach Towards Improved Scheduling in Fog Computing","Journal of Software: Practice and Experience, 12.04.2020",[1663,1665,1667,1669,1671,1672,1673],{"author":1664},"Khan, O.A.",{"author":1666}," Malik, S.U.R.",{"author":1668},"Baig, F.M.",{"author":1670},"Islam, S.U.",{"author":1474},{"author":1472},{"author":1674},"Ahmed, S.A.",[],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2824",{"tag":10,"width":10,"height":10,"text":1678},"@article{https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2824,\nauthor = {Khan, Osama Amir and Malik, Saif U. R. and Baig, Faizan M. and Islam, Saif Ul and Pervaiz, Haris and Malik, Hassan and Ahmed, Syed Hassan},\ntitle = {A cache-based approach toward improved scheduling in fog computing},\njournal = {Software: Practice and Experience},\nvolume = {51},\nnumber = {12},\npages = {2360-2372},\nkeywords = {cache, cloud computing, fog computing, IoT, job scheduling, QoE, QoS},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2824},\nurl = {https:\u002F\u002Fonlinelibrary.wiley.com\u002Fdoi\u002Fabs\u002F10.1002\u002Fspe.2824},\neprint = {https:\u002F\u002Fonlinelibrary.wiley.com\u002Fdoi\u002Fpdf\u002F10.1002\u002Fspe.2824},\nabstract = {Abstract Fog computing is a promising technique to reduce the latency and power consumption issues of the Internet of Things (IoT) ecosystem by enabling storage and computational resource close to the end-user devices with additional benefits such as improved execution time and processing. However, with an increase in IoT devices, the resource allocation and job scheduling became a complicated and cumbersome task due to limited and heterogeneous resources along with the locality restriction in such computing environment. Therefore, this paper proposes a cache-based approach for efficient resource allocation in fog computing environment, while maintaining the quality of service. The proposed algorithm is realized using iFogSim simulator and a comprehensive comparison is presented with the traditional First Come First Served and Shortest Job First policies. The performance evaluation revealed that with the proposed scheme the execution time, latency, processing delays and power consumption decreased by 38\\%, 11.1\\%, 6\\%, and 17.8\\%, respectively, as compared to those of the traditional schemes.},\nyear = {2021}\n}",{"title":1680,"type":228,"excerpt":1681,"year":999,"authors":1682,"tags":1692,"pdfFile":10,"pdfUrl":1693,"extendedUrl":10,"bibTeX":10},"(τ, m)-slicedBucket privacy model for sequential anonymization for improving privacy and utility","Technologies, October 2020, ARTN e4130",[1683,1684,1685,1686,1687,1689,1690,1691],{"author":1628},{"author":1630},{"author":1434},{"author":1436},{"author":1688},"Yu, S.",{"author":1440},{"author":1637},{"author":1472},[],"https:\u002F\u002Fdoi.org\u002F10.1002\u002Fett.4130",{"title":1695,"type":228,"excerpt":1696,"year":999,"authors":1697,"tags":1709,"pdfFile":10,"pdfUrl":1710,"extendedUrl":10,"bibTeX":1711},"Elutähtsate teenuste ristsõltuvuse analüüs","Sõjateadlane (Estonian Journal of Military Studies), köide 15, lk 207-237.",[1698,1699,1701,1703,1705,1707],{"author":219},{"author":1700},"Bahsi, H.",{"author":1702},"Lenin, A.",{"author":1704},"Mändmaa, K.",{"author":1706},"Priisalu, J.",{"author":1708},"Tuuling, R. ",[],"https:\u002F\u002Fwww.kvak.ee\u002Ffiles\u002F2021\u002F04\u002FS%C3%B5jateadlane_15_veebifail-1.pdf",{"tag":10,"width":10,"height":10,"text":1712},"@Article{cryptography5030022,\nAUTHOR = {Laud, P. and Bahsi, H. and Lenin, A. and Mändmaa, K. and Priisalu, J. and Tuuling, R.},\nTITLE = {Elutähtsate teenuste ristsõltuvuse analüüs},\nJOURNAL = {Sõjateadlane (Estonian Journal of Military Studies)},\nVOLUME = {15},\nYEAR = {2021},\nPAGES = {207-237},\nURL = {https:\u002F\u002Fwww.kvak.ee\u002Ffiles\u002F2021\u002F04\u002FS%C3%B5jateadlane_15_veebifail-1.pdf},\n}",{"title":1714,"type":228,"excerpt":1715,"year":999,"authors":1716,"tags":1721,"pdfFile":10,"pdfUrl":1722,"extendedUrl":10,"bibTeX":1723},"A Framework of Metrics for Differential Privacy from Local Sensitivity.","Proceedings on Privacy Enhancing Technologies, 2020 (2), 176-208",[1717,1718,1719],{"author":219},{"author":355},{"author":1720},"Pettai, M. ",[],"https:\u002F\u002Fwww.petsymposium.org\u002F2020\u002Ffiles\u002Fpapers\u002Fissue2\u002Fpopets-2020-0023.pdf",{"tag":10,"width":10,"height":10,"text":1724},"@article{article,\nauthor = {Laud, Peeter and Pankova, Alisa and Pettai, Martin},\nyear = {2020},\nmonth = {04},\npages = {175-208},\ntitle = {A Framework of Metrics for Differential Privacy from Local Sensitivity},\nvolume = {2020},\njournal = {Proceedings on Privacy Enhancing Technologies},\ndoi = {10.2478\u002Fpopets-2020-0023}\n}",{"title":1726,"type":228,"excerpt":1508,"year":999,"authors":1727,"tags":1732,"pdfFile":10,"pdfUrl":1514,"extendedUrl":10,"bibTeX":10},"Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM.",[1728,1729,1730],{"author":219},{"author":1396},{"author":1731},"Anagreh, M. ",[],{"title":1734,"type":228,"excerpt":1735,"year":999,"authors":1736,"tags":1746,"pdfFile":1747,"pdfUrl":1749,"extendedUrl":10,"bibTeX":1750},"EFFORT : Energy efficient framework for offload communication in mobile cloud computing.","Journal of Software: Practice and Experience, 31.05.2020.",[1737,1738,1740,1742,1744],{"author":1436},{"author":1739},"Akram, H.",{"author":1741},"Gill, S.S.",{"author":1743}," Pervaiz, H.",{"author":1745},"Malik, H. ",[],{"url":1748},"\u002Fuploads\u002FSoftw_Pract_Exp_2020_Malik_EFFORT_Energy_efficient_framework_for_offload_communication_in_mobile_cloud_computing_c8bd474a42.pdf","https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2850",{"tag":10,"width":10,"height":10,"text":1751},"@article{https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2850,\nauthor = {Malik, Saif U. R. and Akram, Hina and Gill, Sukhpal Singh and Pervaiz, Haris and Malik, Hassan},\ntitle = {EFFORT: Energy efficient framework for offload communication in mobile cloud computing},\njournal = {Software: Practice and Experience},\nvolume = {51},\nnumber = {9},\npages = {1896-1909},\nkeywords = {cloud computing, cloud service providers, energy consumption, IoT, Internet spoofing, offload communication},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1002\u002Fspe.2850},\nurl = {https:\u002F\u002Fonlinelibrary.wiley.com\u002Fdoi\u002Fabs\u002F10.1002\u002Fspe.2850},\neprint = {https:\u002F\u002Fonlinelibrary.wiley.com\u002Fdoi\u002Fpdf\u002F10.1002\u002Fspe.2850},\nabstract = {Summary There is an abundant expansion in the race of technology, specifically in the production of data, because of the smart devices, such as mobile phones, smart cards, sensors, and Internet of Things (IoT). Smart phones and devices have undergone an enormous evolution in a way that they can be used. More and more new applications, such as face recognition, augmented reality, online interactive gaming, and natural language processing are emerging and attracting the users. Such applications are generally data intensive or compute intensive, which demands high resource and energy consumption. Mobile devices are known for the resource scarcity, having limited computational power and battery life. The tension between compute\u002Fdata intensive application and resource constrained mobile devices hinders the successful adaption of emerging paradigms. In the said perspective, the objective of this article is to study the role of computation offloading in mobile cloud computing to supplement mobile platforms ability in executing complex applications. This article proposes a systematic approach (EFFORT) for offload communication in the cloud. The proposed approach provides a promising solution to partially solve energy consumption issue for communication-intensive applications in a smartphone. The experimental study shows that our proposed approach outperforms its counterparts in terms of energy consumption and fast processing of smartphone devices. The battery consumption was reduced to 19\\% and the data usage was reduced to 16\\%.},\nyear = {2021}\n}",{"title":1753,"type":228,"excerpt":1754,"year":999,"authors":1755,"tags":1757,"pdfFile":10,"pdfUrl":1758,"extendedUrl":10,"bibTeX":10},"Moving Toward 5G: Significance, Differences, and Impact on Quality of Experience. ","IEEE Consumer Electronics Magazine, 9 (6), 9−14.",[1756],{"author":1436},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FMCE.2020.2988039",{"title":1760,"type":228,"excerpt":1761,"year":999,"authors":1762,"tags":1767,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Developing requirements for the new encryption mechanisms in the Estonian eID infrastructure. ","Keynote paper at Baltic DB&IS 2020. Communications in Computer and Information Science vol. 1243, pp. 13-20, Springer 2020.",[1763,1765],{"author":1764},"Oruaas, M.",{"author":1766},"Willemson, J. ",[],{"title":1769,"type":228,"excerpt":1770,"year":999,"authors":1771,"tags":1775,"pdfFile":10,"pdfUrl":1776,"extendedUrl":10,"bibTeX":10},"Secure Multiparty Logic Programming.","Proceedings of the 15th Workshop on Programming Languages and Analysis for SecurityNovember 2020 Pages 3–7 ",[1772,1773],{"author":355},{"author":1774}," Jääger, J. ",[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3411506.3417597",{"title":1778,"type":228,"excerpt":1779,"year":999,"authors":1780,"tags":1787,"pdfFile":10,"pdfUrl":1788,"extendedUrl":10,"bibTeX":10},"WOTS-S: A Quantum Secure Compact Signature Scheme for Distributed Ledger"," Information Sciences Volume 539, October 2020, Pages 229-249",[1781,1783,1784,1785],{"author":1782},"Shahid, F.",{"author":1440},{"author":1436},{"author":1786},"Choo, K.K.R. ",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ins.2020.05.024",{"title":1790,"type":228,"excerpt":1791,"year":999,"authors":1792,"tags":1804,"pdfFile":10,"pdfUrl":1805,"extendedUrl":10,"bibTeX":1806},"FESDA: Fog-Enabled Secure Data Aggregation in Smart Grid IoT Network","IEEE Internet of Things Journal Volume: 7 , Issue: 7 , 6132−6142, July 2020.",[1793,1795,1797,1798,1799,1800,1802],{"author":1794},"Saleem, A.",{"author":1796}," Khan, A.",{"author":1436},{"author":1474},{"author":1472},{"author":1801},"Alam, M.",{"author":1803},"Jindal, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FJIOT.2019.2957314",{"tag":10,"width":10,"height":10,"text":1807},"@ARTICLE{8920057,\n  author={Saleem, Ahsan and Khan, Abid and Malik, Saif Ur Rehman and Pervaiz, Haris and Malik, Hassan and Alam, Masoom and Jindal, Anish},\n  journal={IEEE Internet of Things Journal}, \n  title={FESDA: Fog-Enabled Secure Data Aggregation in Smart Grid IoT Network}, \n  year={2020},\n  volume={7},\n  number={7},\n  pages={6132-6142},\n  doi={10.1109\u002FJIOT.2019.2957314}}\n",{"title":1809,"type":228,"excerpt":1810,"year":1391,"authors":1811,"tags":1819,"pdfFile":1820,"pdfUrl":1822,"extendedUrl":10,"bibTeX":1823},"MobChain: Three-Way Collusion Resistance in Witness-Oriented Location Proof Systems Using Distributed Consensus.","Sensors 2021, 21(15), 5096.",[1812,1814,1815,1816,1817],{"author":1813},"Zafar, F.",{"author":1440},{"author":1436},{"author":1434},{"author":1818},"Ahmed, M. ",[],{"url":1821},"\u002Fuploads\u002Fsensors_21_05096_2b7f5a7bde.pdf","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs21155096",{"tag":10,"width":10,"height":10,"text":1824},"@Article{s21155096,\nAUTHOR = {Zafar, Faheem and Khan, Abid and Malik, Saif Ur Rehman and Ahmed, Mansoor and Maple, Carsten and Anjum, Adeel},\nTITLE = {MobChain: Three-Way Collusion Resistance in Witness-Oriented Location Proof Systems Using Distributed Consensus},\nJOURNAL = {Sensors},\nVOLUME = {21},\nYEAR = {2021},\nNUMBER = {15},\nARTICLE-NUMBER = {5096},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F1424-8220\u002F21\u002F15\u002F5096},\nPubMedID = {34372333},\nISSN = {1424-8220},\nABSTRACT = {Smart devices have accentuated the importance of geolocation information. Geolocation identification using smart devices has paved the path for incentive-based location-based services (LBS). However, a user’s full control over a smart device can allow tampering of the location proof. Witness-oriented location proof systems (LPS) have emerged to resist the generation of false proofs and mitigate collusion attacks. However, witness-oriented LPS are still susceptible to three-way collusion attacks (involving the user, location authority, and the witness). To overcome the threat of three-way collusion in existing schemes, we introduce a decentralized consensus protocol called MobChain in this paper. In this scheme the selection of a witness and location authority is achieved through a distributed consensus of nodes in an underlying P2P network that establishes a private blockchain. The persistent provenance data over the blockchain provides strong security guarantees; as a result, the forging and manipulation of location becomes impractical. MobChain provides secure location provenance architecture, relying on decentralized decision making for the selection of participants of the protocol thereby addressing the three-way collusion problem. Our prototype implementation and comparison with the state-of-the-art solutions show that MobChain is computationally efficient and highly available while improving the security of LPS.},\nDOI = {10.3390\u002Fs21155096}\n}",{"title":1826,"type":228,"excerpt":1827,"year":999,"authors":1828,"tags":1830,"pdfFile":10,"pdfUrl":1831,"extendedUrl":10,"bibTeX":1832},"How Not to Use a Privacy-Preserving Computation Platform: Case Study of a Voting Application","In: Computer Security (111−121) 2020. Springer. (Lecture Notes in Computer Science). ",[1829],{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-42048-2_8",{"tag":10,"width":10,"height":10,"text":1833},"@InProceedings{10.1007\u002F978-3-030-42048-2_8,\nauthor=\"Willemson, Jan\",\neditor=\"Katsikas, Sokratis\nand Cuppens, Fr{\\'e}d{\\'e}ric\nand Cuppens, Nora\nand Lambrinoudakis, Costas\nand Kalloniatis, Christos\nand Mylopoulos, John\nand Ant{\\'o}n, Annie\nand Gritzalis, Stefanos\nand Pallas, Frank\nand Pohle, J{\\\"o}rg\nand Sasse, Angela\nand Meng, Weizhi\nand Furnell, Steven\nand Garcia-Alfaro, Joaquin\",\ntitle=\"How Not to Use a Privacy-Preserving Computation Platform: Case Study of a Voting Application\",\nbooktitle=\"Computer Security\",\nyear=\"2020\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"111--121\",\nabstract=\"We present an analysis of a recent proposal by Dang-awan et al. who develop a remote electronic voting protocol based on secure multi-party computation framework Sharemind. Even though Sharemind comes with provable security guarantees and an application development framework, the proposed protocol and its implementation contain a number of flaws making the result insecure. We hope this case study serves as a good educational material for future secure computation application and voting protocol developers.\",\nisbn=\"978-3-030-42048-2\"\n}\n\n",{"title":1835,"type":228,"excerpt":1836,"year":16,"authors":1837,"tags":1845,"pdfFile":10,"pdfUrl":1846,"extendedUrl":10,"bibTeX":1847},"Order preserving secure provenance scheme for distributed networks","Computers & Security, vol. 82, 2019, pp: 99-117. ",[1838,1840,1841,1843],{"author":1839},"Ahmed, I.",{"author":1796},{"author":1842},"Ahmed, M.",{"author":1844},"Malik, S.U.R. ",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2018.12.008",{"tag":10,"width":10,"height":10,"text":1848},"@article{AHMED201999,\ntitle = {Order preserving secure provenance scheme for distributed networks},\njournal = {Computers & Security},\nvolume = {82},\npages = {99-117},\nyear = {2019},\nissn = {0167-4048},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2018.12.008},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167404818306667},\nauthor = {Idrees Ahmed and Abid Khan and Mansoor Ahmed and Saif ur Rehman},\nkeywords = {Provenance, Secure provenance, Chaining, Aggregated signatures, Petri nets, Formal verification},\nabstract = {Data provenance has an essential role in establishing the trustworthiness of data in many applications, where critical decisions have to be made based on the data collected from different sources. Therefore, it is indispensable to use authentic and accurate data for such mission critical applications. In order to fully trust the data provenance itself, it is extremely important to secure the data provenance from forgeries and misuse. Provenance generation, management, and dissemination have received substantial attention from the research community. However, provenance security in a file sharing network has earned less heed from the research community. One cannot apply the time-honoured security solutions as it is to secure the provenance information because of its chained structure. We propose a secure provenance scheme for distributed environments that ensures confidentiality, integrity, and non-repudiation while maintaining the chained structure through aggregated signatures. Our proposed scheme detects the attacks launched by multiple consecutive and\u002For non-consecutive colluders, which is missing in existing secure provenance schemes. Moreover, our scheme detects attack launched by an adversary to shuffle the order of provenance records. In order to check the correctness of proposed scheme, we conduct the formal verification using High-Level Petri Net (HLPN), Satisfiability Modulo Theories Library (SMT-Lib) and Z3 solver. Furthermore, to validate our results and claims, we evaluate our scheme both empirically and analytically. Experimental results show that our scheme performs better as compared to existing state of the art provenance schemes with regards to security, computation and storage cost.}\n}",{"title":1850,"type":228,"excerpt":1851,"year":16,"authors":1852,"tags":1857,"pdfFile":10,"pdfUrl":1858,"extendedUrl":10,"bibTeX":1859},"Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing. ","1: the 5th International Conference on Information Systems Security and Privacy,February 23-25, 2019, in Prague, Czech Republic. Ed. Paolo Mori; Steven Furnell; and Olivier Camp. Citepress Digital Library , 238−245.",[1853,1854,1855],{"author":1394},{"author":1396},{"author":1856},"Laud, P. ",[],"https:\u002F\u002Fdoi.org\u002F10.5220\u002F0007312702380245",{"tag":10,"width":10,"height":10,"text":1860},"@conference{icissp19,\nauthor={Mohammad Anagreh. and Eero Vainikko. and Peeter Laud.},\ntitle={Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing},\nbooktitle={Proceedings of the 5th International Conference on Information Systems Security and Privacy - ICISSP},\nyear={2019},\npages={238-245},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0007312702380245},\nisbn={978-989-758-359-9},\nissn={2184-4356},\n}",{"title":1862,"type":228,"excerpt":1863,"year":16,"authors":1864,"tags":1873,"pdfFile":10,"pdfUrl":1874,"extendedUrl":10,"bibTeX":1875},"An effective privacy preserving mechanism for 1: M microdata with high utility","Sustainable cities and society, vol. 45, 2019.",[1865,1866,1868,1869,1870,1871],{"author":1434},{"author":1867},"Farooq, N.",{"author":1436},{"author":1440},{"author":1842},{"author":1872},"Gohar, M.",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scs.2018.11.037",{"tag":10,"width":10,"height":10,"text":1876},"@article{ANJUM2019213,\ntitle = {An effective privacy preserving mechanism for 1: M microdata with high utility},\njournal = {Sustainable Cities and Society},\nvolume = {45},\npages = {213},\nyear = {2019},\nissn = {2210-6707},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.scs.2018.11.037},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS2210670718305559},\nauthor = {Adeel Anjum and Nayma Farooq and Saif Ur Rehman Malik and Abid Khan and Mansoor Ahmed and Moneeb Gohar},\nkeywords = {Anatomy, Computational efficiency, Data utility, 1: M generalization, 1: M microdata, NCP, Privacy},\nabstract = {Privacy-preserving data publishing (PPDP) aims at providing an anonymized view of a private microdata to the recipients, e.g., researchers, pharmaceutical companies etc. This private data contains sensitive information about individuals that needs to be protected. In the literature, it is generally assumed that there exists a single record for one individual in any given microdata (1:1 dataset). However, more practically, there are many instances in which an individual can have multiple records in microdata (termed as 1: M datasets). Several techniques have been proposed for the 1:1 microdata but, a few researchers paid attention towards 1:M microdata problems, that perhaps led to new privacy disclosures. A novel privacy model (k, l)-diversity was proposed to cater such disclosure risks and based on this model, an algorithm named 1: M generalization was proposed. Although it was efficient than several other techniques; still has a drawback of huge information loss. In this paper, we propose a hybrid approach named as l-anatomy for 1: M microdata and prove that l-anatomy ensures the privacy of given individuals. Also, experiments performed on two real-world datasets (namely INFORMS and YOUTUBE) reveal that the proposed scheme exhibits higher efficiency and effectiveness as compared to its counterpart.}\n}",{"title":1878,"type":228,"excerpt":1879,"year":16,"authors":1880,"tags":1890,"pdfFile":10,"pdfUrl":1891,"extendedUrl":10,"bibTeX":1892},"A Game-based Thermal-aware Resource Allocation Strategy for Data Centers","IEEE Transactions on Cloud Computing, Feb 14, 2019.",[1881,1883,1884,1886,1888,1889],{"author":1882},"Akbar, S.",{"author":1436},{"author":1885},"Khan, S.U.",{"author":1887},"Choo, R.",{"author":1434},{"author":1599},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FTCC.2019.2899310",{"tag":10,"width":10,"height":10,"text":1893},"@ARTICLE{8642435,\n  author={Akbar, Saeed and Malik, Saif Ur Rehman and Choo, Kim-Kwang Raymond and Khan, Samee U. and Ahmad, Naveed and Anjum, Adeel},\n  journal={IEEE Transactions on Cloud Computing}, \n  title={A Game-based Thermal-Aware Resource Allocation Strategy for Data Centers}, \n  year={2021},\n  volume={9},\n  number={3},\n  pages={845-853},\n  doi={10.1109\u002FTCC.2019.2899310}}",{"title":1895,"type":228,"excerpt":1896,"year":16,"authors":1897,"tags":1906,"pdfFile":10,"pdfUrl":1907,"extendedUrl":10,"bibTeX":1908},"Attribute Evaluation on Attack Trees with Incomplete Information","Computers & Security, 88, 101630, 1−17.10.1016\u002Fj.cose.2019.101630.",[1898,1899,1901,1902,1904],{"author":845},{"author":1900},"Gadyatskaya, O.",{"author":1702},{"author":1903},"Mauw, S.",{"author":1905},"Trujillo-Rasua, R. ",[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2019.101630",{"tag":10,"width":10,"height":10,"text":1909},"@article{BULDAS2020101630,\ntitle = {Attribute evaluation on attack trees with incomplete information},\njournal = {Computers & Security},\nvolume = {88},\npages = {101630},\nyear = {2020},\nissn = {0167-4048},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2019.101630},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167404819301774},\nauthor = {Ahto Buldas and Olga Gadyatskaya and Aleksandr Lenin and Sjouke Mauw and Rolando Trujillo-Rasua},\nkeywords = {Attack trees, Constraint programming, Historical data, Security risk assessment, Quantitative security, Decoration problem},\nabstract = {Attack trees are considered a useful tool for security modelling because they support qualitative as well as quantitative analysis. The quantitative approach is based on values associated to each node in the tree, expressing, for instance, the minimal cost or probability of an attack. Current quantitative methods for attack trees allow the analyst to, based on an initial assignment of values to the leaf nodes, derive the values of the higher nodes in the tree. In practice, however, it shows to be very difficult to obtain reliable values for all leaf nodes. The main reasons are that data is only available for some of the nodes, that data is available for intermediate nodes rather than for the leaf nodes, or even that the available data is inconsistent. We address these problems by developing a generalisation of the standard bottom-up calculation method in three ways. First, we allow initial attributions of non-leaf nodes. Second, we admit additional relations between attack steps beyond those provided by the underlying attack tree semantics. Third, we support the calculation of an approximative solution in case of inconsistencies. We illustrate our method, which is based on constraint programming, by a comprehensive case study.}\n}",{"title":1911,"type":228,"excerpt":1912,"year":16,"authors":1913,"tags":1925,"pdfFile":10,"pdfUrl":1926,"extendedUrl":10,"bibTeX":10},"Data offloading in IoT environments: modeling, analysis, and verification","EURASIP Journal on Wireless Communications and Networking, Mar. 2019.",[1914,1916,1918,1920,1922,1923],{"author":1915},"Ghosh, A.",{"author":1917},"Khalid, O.",{"author":1919},"Rais, R.N.B.",{"author":1921},"Rehman, A.",{"author":1436},{"author":1924},"Khan, I.A.",[],"https:\u002F\u002Fdoi.org\u002F10.1186\u002Fs13638-019-1358-8",{"title":1928,"type":228,"excerpt":1929,"year":16,"authors":1930,"tags":1935,"pdfFile":10,"pdfUrl":1936,"extendedUrl":10,"bibTeX":1937},"Is your vote overheard? A new scalable side-channel attack against paper voting","In 4th IEEE European Symposium on Security and Privacy, June 17-19, 2019, Stockholm, Sweden, IEEE, pp. 621-634.",[1931,1932,1933],{"author":1421},{"author":141},{"author":1934},"Värv, S-S.",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FEuroSP.2019.00051",{"tag":10,"width":10,"height":10,"text":1938},"@INPROCEEDINGS{8806759,\n  author={Krips, Kristjan and Willemson, Jan and Värv, Sebastian},\n  booktitle={2019 IEEE European Symposium on Security and Privacy (EuroS&P)}, \n  title={Is Your Vote Overheard? A New Scalable Side-Channel Attack Against Paper Voting}, \n  year={2019},\n  volume={},\n  number={},\n  pages={621-634},\n  doi={10.1109\u002FEuroSP.2019.00051}}\n",{"title":1940,"type":228,"excerpt":1941,"year":16,"authors":1942,"tags":1947,"pdfFile":10,"pdfUrl":1948,"extendedUrl":10,"bibTeX":1949},"On Practical Aspects of Coercion-Resistant Remote Voting Systems","In: Krimmer R. et al. (eds) Electronic Voting. E-Vote-ID 2019. Lecture Notes in Computer Science, vol 11759. Springer, Cham.",[1943,1945],{"author":1944},"Krips K.",{"author":1946},"Willemson J.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-30625-0_14",{"tag":10,"width":10,"height":10,"text":1950},"@InProceedings{10.1007\u002F978-3-030-30625-0_14,\nauthor=\"Krips, Kristjan\nand Willemson, Jan\",\neditor=\"Krimmer, Robert\nand Volkamer, Melanie\nand Cortier, Veronique\nand Beckert, Bernhard\nand K{\\\"u}sters, Ralf\nand Serd{\\\"u}lt, Uwe\nand Duenas-Cid, David\",\ntitle=\"On Practical Aspects of Coercion-Resistant Remote Voting Systems\",\nbooktitle=\"Electronic Voting\",\nyear=\"2019\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"216--232\",\nabstract=\"Coercive behaviour is hard to control in the remote electronic voting setting. This is why a number of protocols have been proposed that aim at mitigating this threat. However, these proposals have remained largely academic. This paper takes the practical viewpoint and analyses the most common assumptions that are required by the various schemes, together with the exact level of coercion-resistance they provide.\",\nisbn=\"978-3-030-30625-0\"\n}\n",{"title":1952,"type":228,"excerpt":1953,"year":16,"authors":1954,"tags":1962,"pdfFile":10,"pdfUrl":1963,"extendedUrl":10,"bibTeX":10},"Privacy-enhanced BPMN: enabling data privacy analysis in business processes models","Software & Systems Modeling, Springer 2019.",[1955,1956,1958,1960],{"author":607},{"author":1957},"Tom, J.",{"author":1959},"Matulevičius, R.",{"author":1961},"Toots, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10270-019-00718-z",{"title":1965,"type":228,"excerpt":1966,"year":16,"authors":1967,"tags":1982,"pdfFile":10,"pdfUrl":1983,"extendedUrl":10,"bibTeX":1984},"Business Process Privacy Analysis in Pleak","In: R. Hahnle and W. van der Aalst (Ed.). Fundamental Approaches to Software Engineering (306−312). Springer Nature Switzerland AG. (Lecture Notes in Computer Science). \n\nhttps:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007%2F978-3-030-16722-6_18\nhttps:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00287-019-01204-y",[1968,1969,1971,1973,1974,1976,1977,1978,1980,1981],{"author":1961},{"author":1970},"Tuuling, R.",{"author":1972},"Yerokhin, M.",{"author":1524},{"author":1975},"García-Bañuelos, L.",{"author":219},{"author":1959},{"author":1979}," Pankova, A.",{"author":217},{"author":607},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-16722-6_18",{"tag":10,"width":10,"height":10,"text":1985},"@InProceedings{10.1007\u002F978-3-030-16722-6_18,\nauthor=\"Toots, Aivo\nand Tuuling, Reedik\nand Yerokhin, Maksym\nand Dumas, Marlon\nand Garc{\\'i}a-Ba{\\~{n}}uelos, Luciano\nand Laud, Peeter\nand Matulevi{\\v{c}}ius, Raimundas\nand Pankova, Alisa\nand Pettai, Martin\nand Pullonen, Pille\nand Tom, Jake\",\neditor=\"H{\\\"a}hnle, Reiner\nand van der Aalst, Wil\",\ntitle=\"Business Process Privacy Analysis in Pleak \",\nbooktitle=\"Fundamental Approaches to Software Engineering\",\nyear=\"2019\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"306--312\",\nabstract=\"Pleak is a tool to capture and analyze privacy-enhanced business process models to characterize and quantify to what extent the outputs of a process leak information about its inputs. Pleak incorporates an extensible set of analysis plugins, which enable users to inspect potential leakages at multiple levels of detail.\",\nisbn=\"978-3-030-16722-6\"\n}\n\n",{"title":1987,"type":228,"excerpt":1988,"year":107,"authors":1989,"tags":1994,"pdfFile":10,"pdfUrl":1995,"extendedUrl":10,"bibTeX":1996},"Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data"," IEEE \u002F ACM Transactions on Computational Biology and Bioinformatics, 1−8. ",[1990,1991,1992,1993],{"author":135},{"author":234},{"author":236},{"author":238},[],"https:\u002F\u002Fieeexplore.ieee.org\u002Fdocument\u002F8417961",{"tag":10,"width":10,"height":10,"text":1997},"@ARTICLE{8417961,\n  author={Bogdanov, Dan and Kamm, Liina and Laur, Sven and Sokk, Ville},\n  journal={IEEE\u002FACM Transactions on Computational Biology and Bioinformatics}, \n  title={Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data}, \n  year={2018},\n  volume={15},\n  number={5},\n  pages={1427-1432},\n  doi={10.1109\u002FTCBB.2018.2858818}}",{"title":1999,"type":228,"excerpt":2000,"year":107,"authors":2001,"tags":2007,"pdfFile":10,"pdfUrl":2008,"extendedUrl":10,"bibTeX":2009},"A Blockchain-Assisted Hash-Based Signature Scheme","Secure IT Systems: 23rd Nordic Conference, NordSec 2018, Oslo, Norway, November 28-30, 2018, Proceedings. Ed. Gruschka, Nils. Cham: Springer, 138−153.",[2002,2003,2005],{"author":845},{"author":2004},"Laanoja, R.",{"author":2006},"Truu, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-03638-6_9",{"tag":10,"width":10,"height":10,"text":2010},"@InProceedings{10.1007\u002F978-3-030-03638-6_9,\nauthor=\"Buldas, Ahto\nand Laanoja, Risto\nand Truu, Ahto\",\neditor=\"Gruschka, Nils\",\ntitle=\"A Blockchain-Assisted Hash-Based Signature Scheme\",\nbooktitle=\"Secure IT Systems\",\nyear=\"2018\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"138--153\",\nabstract=\"We present a server-supported, hash-based digital signature scheme. To achieve greater efficiency than current state of the art, we relax the security model somewhat. We postulate a set of design requirements, discuss some approaches and their practicality, and finally reach a forward-secure scheme with only modest trust assumptions, achieved by employing the concepts of authenticated data structures and blockchains. The concepts of blockchain authenticated data structures and the presented blockchain design could have independent value and are worth further research.\",\nisbn=\"978-3-030-03638-6\"\n}",{"title":2012,"type":228,"excerpt":2013,"year":107,"authors":2014,"tags":2019,"pdfFile":10,"pdfUrl":2020,"extendedUrl":10,"bibTeX":2021},"Disclosure Analysis of SQL Workflows","In: Cybenko G., Pym D., Fila B. (eds) Graphical Models for Security. GraMSec 2018. Lecture Notes in Computer Science, vol 11086. Springer, Cham. ",[2015,2016,2017],{"author":1524},{"author":1975},{"author":2018}," Laud, P.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-15465-3_4",{"tag":10,"width":10,"height":10,"text":2022},"@InProceedings{10.1007\u002F978-3-030-15465-3_4,\nauthor=\"Dumas, Marlon\nand Garc{\\'i}a-Ba{\\~{n}}uelos, Luciano\nand Laud, Peeter\",\neditor=\"Cybenko, George\nand Pym, David\nand Fila, Barbara\",\ntitle=\"Disclosure Analysis of SQL Workflows\",\nbooktitle=\"Graphical Models for Security\",\nyear=\"2019\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"51--70\",\nabstract=\"In the context of business process management, the implementation of data minimization requirements requires that analysts are able to assert what private data each worker is able to access, not only directly via the inputs of the tasks they perform in a business process, but also indirectly via the chain of tasks that lead to the production of these inputs. In this setting, this paper presents a technique which, given a workflow that transforms a set of input tables into a set of output tables via a set of inter-related SQL statements, determines what information from each input table is disclosed by each output table, and under what conditions this disclosure occurs. The result of this disclosure analysis is a summary representation of the possible computations leading from the inputs of the workflow to a given output thereof.\",\nisbn=\"978-3-030-15465-3\"\n}\n",{"title":2024,"type":228,"excerpt":2025,"year":107,"authors":2026,"tags":2033,"pdfFile":10,"pdfUrl":10,"extendedUrl":2034,"bibTeX":10},"On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards"," In Robert Krimmer, Melanie Volkamer, Véronique Cortier, David Duenas-Cid, Rajeev Goré, Manik Hapsara, Reto Koenig, Steven Martin, Ronan McDermott, Peter Roenne, Uwe Serdült, Tomasz Truderung, editors, proceedings of the Third International Joint Conference on Electronic Voting E-Vote-ID 2018, 2–5 October 2018, Lochau\u002FBregenz, Austria, TUT press, pp. 259-276.",[2027,2028,2030,2032],{"author":984},{"author":2029},"Kubjas, I.",{"author":2031},"Siim, J.",{"author":141},[],"https:\u002F\u002Fia.cr\u002F2018\u002F685",{"title":2036,"type":228,"excerpt":2037,"year":107,"authors":2038,"tags":2042,"pdfFile":10,"pdfUrl":2043,"extendedUrl":10,"bibTeX":2044},"An Internet Voting Protocol with Distributed Verification Receipt Generation","In Robert Krimmer, Melanie Volkamer, Véronique Cortier, David Duenas-Cid, Rajeev Goré, Manik Hapsara, Reto Koenig, Steven Martin, Ronan McDermott, Peter Roenne, Uwe Serdült, Tomasz Truderung, editors, proceedings of the Third International Joint Conference on Electronic Voting E-Vote-ID 2018, 2–5 October 2018, Lochau\u002FBregenz, Austria, TUT press, pp. 128-146",[2039,2040,2041],{"author":1421},{"author":2029},{"author":1766},[],"https:\u002F\u002Fwww.researchgate.net\u002Fpublication\u002F327176377_An_Internet_Voting_Protocol_with_Distributed_Verification_Receipt_Generation",{"tag":10,"width":10,"height":10,"text":2045},"@inproceedings{inproceedings,\nauthor = {Krips, Kristjan and Kubjas, Ivo and Willemson, Jan},\nyear = {2018},\nmonth = {07},\npages = {},\ntitle = {An Internet Voting Protocol with Distributed Verification Receipt Generation}\n}",{"title":2047,"type":228,"excerpt":2048,"year":107,"authors":2049,"tags":2054,"pdfFile":10,"pdfUrl":2055,"extendedUrl":10,"bibTeX":2056},"Implementing an audio side channel for paper voting","In Robert Krimmer, Melanie Volkamer, Véronique Cortier, Rajeev Goré, Manik Hapsara, Uwe Serdült, David Duenas-Cid, editors, Third International Joint Conference, E-Vote-ID 2018, Bregenz, Austria, October 2-5, 2018, Proceedings, Springer LNCS, volume 11143, pp. 132-145.",[2050,2051,2052],{"author":1421},{"author":141},{"author":2053},"Värv, S.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-00419-4_9",{"tag":10,"width":10,"height":10,"text":2057},"@InProceedings{10.1007\u002F978-3-030-00419-4_9,\nauthor=\"Krips, Kristjan\nand Willemson, Jan\nand V{\\\"a}rv, Sebastian\",\neditor=\"Krimmer, Robert\nand Volkamer, Melanie\nand Cortier, V{\\'e}ronique\nand Gor{\\'e}, Rajeev\nand Hapsara, Manik\nand Serd{\\\"u}lt, Uwe\nand Duenas-Cid, David\",\ntitle=\"Implementing an Audio Side Channel for Paper Voting\",\nbooktitle=\"Electronic Voting\",\nyear=\"2018\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"132--145\",\nabstract=\"In the ongoing debate between the proponents of electronic and paper voting, a frequently used argument is that electronic voting is susceptible to electronic attacks, and those are less detectable by a human than physical ones. This paper contributes to the research of electronic attacks against paper voting by building a proof-of-concept classifier for audio samples recorded while writing numbers. Such a classifier can be used to break the privacy, for example, in case of preferential voting ballot sheets, or voting systems where the voter must fill in the candidate number. We estimate the quality of the classifier and discuss its implications to the physical security measures of polling stations and ballot design.\",\nisbn=\"978-3-030-00419-4\"\n}\n",{"title":2059,"type":228,"excerpt":2060,"year":107,"authors":2061,"tags":2064,"pdfFile":10,"pdfUrl":2065,"extendedUrl":10,"bibTeX":2066},"Bit Decomposition Protocols in Secure Multiparty Computation","Proceedings of WAHC 2018 – 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, January 2018 Pages 37–48.",[2062,2063],{"author":219},{"author":355},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3267973.3267979",{"tag":10,"width":10,"height":10,"text":2067},"@inproceedings{10.1145\u002F3267973.3267979,\nauthor = {Laud, Peeter and Pankova, Alisa},\ntitle = {Bit Decomposition Protocols in Secure Multiparty Computation},\nyear = {2018},\nisbn = {9781450359870},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3267973.3267979},\ndoi = {10.1145\u002F3267973.3267979},\nabstract = {We present improved protocols for the conversion of secret-shared bit-vectors into secret-shared integers and vice versa, for the use as subroutines in secure multiparty computation (SMC) protocols and for protocols verifying the adherence of parties to prescribed SMC protocols. The protocols are primarily designed for three-party computation with honest majority. We evaluate our protocols as part of the Sharemind three-party protocol set and see a general reduction of verification overheads, thereby increasing the practicality of covertly or actively secure Sharemind protocols.},\nbooktitle = {Proceedings of the 6th Workshop on Encrypted Computing \\& Applied Homomorphic Cryptography},\npages = {37–48},\nnumpages = {12},\nkeywords = {covert adversary, verifiable computation, secure multiparty computation},\nlocation = {Toronto, Canada},\nseries = {WAHC '18}\n}",{"title":2069,"type":228,"excerpt":2070,"year":107,"authors":2071,"tags":2075,"pdfFile":10,"pdfUrl":112,"extendedUrl":10,"bibTeX":10},"Privacy-preserving record linkage in large databases using secure multiparty computation","BMC Medical Genomics, 2018. BMC Med Genomics 11, 84 (2018).\n\nhttps:\u002F\u002Fbmcmedgenomics.biomedcentral.com\u002Farticles\u002F10.1186\u002Fs12920-018-0400-8",[2072,2073],{"author":219},{"author":2074},"Pankova, A. ",[],{"title":2077,"type":228,"excerpt":2078,"year":107,"authors":2079,"tags":2083,"pdfFile":10,"pdfUrl":2084,"extendedUrl":10,"bibTeX":10},"Sensitivity Analysis of SQL Queries","PLAS ‘18: Proceedings of the 13th Workshop on Programming Languages and Analysis for Security, January 2018 Pages 2–12. \n\nhttps:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3264820.3264825",[2080,2081,2082],{"author":219},{"author":217},{"author":381},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3264820.3264825",{"title":2086,"type":228,"excerpt":2087,"year":30,"authors":2088,"tags":2096,"pdfFile":10,"pdfUrl":2097,"extendedUrl":10,"bibTeX":2098},"MCMix: Anonymous Messaging via Secure Multiparty Computation","Proceedings of the 26th USENIX Security Symposium. Vancouver, BC: USENIX Association, 1217−1234.",[2089,2091,2093,2094],{"author":2090},"Alexopoulos, N.",{"author":2092},"Kiayias, A.",{"author":191},{"author":2095},"Zacharias, T.",[],"https:\u002F\u002Fwww.usenix.org\u002Fconference\u002Fusenixsecurity17\u002Ftechnical-sessions\u002Fpresentation\u002Falexopoulos",{"tag":10,"width":10,"height":10,"text":2099},"@inproceedings {203626,\nauthor = {Nikolaos Alexopoulos and Aggelos Kiayias and Riivo Talviste and Thomas Zacharias},\ntitle = {{MCMix}: Anonymous Messaging via Secure Multiparty Computation},\nbooktitle = {26th USENIX Security Symposium (USENIX Security 17)},\nyear = {2017},\nisbn = {978-1-931971-40-9},\naddress = {Vancouver, BC},\npages = {1217--1234},\nurl = {https:\u002F\u002Fwww.usenix.org\u002Fconference\u002Fusenixsecurity17\u002Ftechnical-sessions\u002Fpresentation\u002Falexopoulos},\npublisher = {USENIX Association},\nmonth = aug,\n}",{"title":2101,"type":228,"excerpt":2102,"year":30,"authors":2103,"tags":2109,"pdfFile":10,"pdfUrl":2110,"extendedUrl":10,"bibTeX":10},"Simple Infeasibility Certificates for Attack Trees"," In: Obana S., Chida K. (eds) Advances in Information and Computer Security. IWSEC 2017. Lecture Notes in Computer Science, vol 10418. Springer, Cham ",[2104,2105,2106,2107],{"author":845},{"author":1702},{"author":141},{"author":2108},"Charnamord, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-64200-0_3",{"title":2112,"type":228,"excerpt":2113,"year":30,"authors":2114,"tags":2119,"pdfFile":10,"pdfUrl":2120,"extendedUrl":10,"bibTeX":2121},"Are the current system engineering practices sufficient to meet cyber crime?","Human Aspects of Information Security, Privacy and Trust : 5th International Conference, HAS 2017, Held as Part of HCI International 2017, Vancouver, BC, Canada, July 9-14, 2017, Proceedings. Ed. Tryfonas,Theo. Springer, 451−463. (Lecture Notes in Computer Science ; 10292). ",[2115,2117],{"author":2116},"Buldas, A,",{"author":2118},"Saarepera, M.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-58460-7_31",{"tag":10,"width":10,"height":10,"text":2122},"@InProceedings{10.1007\u002F978-3-319-58460-7_31,\nauthor=\"Buldas, Ahto\nand Saarepera, M{\\\"a}rt\",\neditor=\"Tryfonas, Theo\",\ntitle=\"Are the Current System Engineering Practices Sufficient to Meet Cyber Crime?\",\nbooktitle=\"Human Aspects of Information Security, Privacy and Trust\",\nyear=\"2017\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"451--463\",\nabstract=\"During the last decades, we have witnessed an explosive growth of computer-technology and the Internet. Due to the growing role of computers and Internet in important business and state-related activities, investments to computer security and the security industry have also been growing fast. In spite of that, we also see the growing trend of cyber crime and losses due to security incidents. We predict that these three growing trends will continue in the future the main reasons being that: (1) as more and more assets will be connected to the Internet, the number of potential targets and stimuli for attackers grow; (2) fundamental (and hard to change) design decisions made in early development stages of todays Internet- and computer technology guarantee persistent technical vulnerabilities in Internet-based systems due to which attackers will always be one step ahead of defenders; (3) growing role of Chief Security Officers (CSOs) in organisations, who do not necessarily have to understand the detailed purpose and functionality of the system but whose duty is still to make the ITC system of the organisation secure. These reasons guarantee the continuous growth of the security industry but also the continuous growth of losses through cyber crime.\",\nisbn=\"978-3-319-58460-7\"\n}",{"title":2124,"type":228,"excerpt":2125,"year":30,"authors":2126,"tags":2132,"pdfFile":10,"pdfUrl":2133,"extendedUrl":10,"bibTeX":2134},"Long-term secure commitments via extractable-binding commitments","Information Security and Privacy : 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I. Ed. Pieprzyk, Josef; Suriadi, Suriadi. Cham: Springer, 65−81. (Lecture Notes in Computer Science; 10342).10.1007\u002F978-3-319-60055-0_4.",[2127,2128,2130],{"author":845},{"author":2129},"Geihs, M.",{"author":2131},"Buchmann, J.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-60055-0_4",{"tag":10,"width":10,"height":10,"text":2135},"@InProceedings{10.1007\u002F978-3-319-60055-0_4,\nauthor=\"Buldas, Ahto\nand Geihs, Matthias\nand Buchmann, Johannes\",\neditor=\"Pieprzyk, Josef\nand Suriadi, Suriadi\",\ntitle=\"Long-Term Secure Commitments via Extractable-Binding Commitments\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2017\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"65--81\",\nabstract=\"Cryptographic commitments are either unconditionally hiding or unconditionally binding, but cannot be both. As a consequence, the security of commonly used commitment schemes is threatened in the long-term, when adversaries become computationally much more powerful. We improve over this situation by putting forward a new notion of commitment schemes, so called long-term commitment schemes. These schemes allow for long-term protection because they allow to adjust the protection level after the initial commitment. We also present a construction of a long-term commitment scheme. Unfortunately, it seems impossible to prove the security of such a scheme using the traditional commitment binding definition. Therefore, we put forward a new notion of binding commitments, so called extractable-binding commitments, and use this notion to establish a security proof for our proposed long-term commitment scheme.\",\nisbn=\"978-3-319-60055-0\"\n}\n",{"title":2137,"type":228,"excerpt":2138,"year":30,"authors":2139,"tags":2145,"pdfFile":10,"pdfUrl":2146,"extendedUrl":10,"bibTeX":10},"Server-Supported RSA Signatures for Mobile Devices","Computer Security – ESORICS 2017 – 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part I: Oslo, Norway, 11.-15.09.2017. Ed. Foley, S.N. et al. Springer,. (Lecture Notes in Computer Science; 10492).",[2140,2141,2143,2144],{"author":845},{"author":2142},"Kalu, A.",{"author":219},{"author":1764},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-66402-6_19",{"title":2148,"type":228,"excerpt":2149,"year":30,"authors":2150,"tags":2153,"pdfFile":10,"pdfUrl":2154,"extendedUrl":10,"bibTeX":2155},"Challenges of Federating National Data Access Infrastructures","In Pooya Farshim, Emil Simion, editors, SecITC 2017: Innovative Security Solutions for Information Technology and Communications, June 8-9 2017, Bucharest, Romania, Springer LNCS 10543, pp. 104-114.",[2151,2152],{"author":879},{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-69284-5_8",{"tag":10,"width":10,"height":10,"text":2156},"@InProceedings{10.1007\u002F978-3-319-69284-5_8,\nauthor=\"Freudenthal, Margus\nand Willemson, Jan\",\neditor=\"Farshim, Pooya\nand Simion, Emil\",\ntitle=\"Challenges of Federating National Data Access Infrastructures\",\nbooktitle=\"Innovative Security Solutions for Information Technology and Communications\",\nyear=\"2017\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"104--114\",\nabstract=\"X-Road is a secure and scalable database access middleware originally developed in Estonia in early 2000s. In 2014, a decision was taken to also deploy X-Road infrastructure within Finland, hence facilitation cross-national federation. Even though being very close both geographically and culturally, the legislation, technology and best practices used by the two nations differ. This paper discusses the nature and implications of these differences in the context of federated installation of the infrastructure.\",\nisbn=\"978-3-319-69284-5\"\n}\n",{"title":2158,"type":228,"excerpt":2159,"year":30,"authors":2160,"tags":2164,"pdfFile":10,"pdfUrl":2165,"extendedUrl":10,"bibTeX":2166},"Estonian Voting Verification Mechanism Revisited Again","In Robert Krimmer, Melanie Volkamer, Nadja Braun Binder, Norbert Kersting, Olivier Pereira, Carsten Schürmann, editors, Proceedings of the Second International Joint Conference E-Vote-ID 2017, Bregenz, Austria, October 24-27, 2017, LNCS, volume 10615, pp. 306-317, Springer 2017.",[2161,2162,2163],{"author":2029},{"author":618},{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-68687-5_19",{"tag":10,"width":10,"height":10,"text":2167},"@InProceedings{10.1007\u002F978-3-319-68687-5_19,\nauthor=\"Kubjas, Ivo\nand Pikma, Tiit\nand Willemson, Jan\",\neditor=\"Krimmer, Robert\nand Volkamer, Melanie\nand Braun Binder, Nadja\nand Kersting, Norbert\nand Pereira, Olivier\nand Sch{\\\"u}rmann, Carsten\",\ntitle=\"Estonian Voting Verification Mechanism Revisited Again\",\nbooktitle=\"Electronic Voting\",\nyear=\"2017\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"306--317\",\nabstract=\"Recently, Mu{\\c{s}}, Kiraz, Cenk and Sertkaya proposed an improvement over the present Estonian Internet voting vote verification scheme [6]. This paper points to the weaknesses and questionable design choices of the new scheme. We show that the scheme does not fix the vote privacy issue it claims to. It also introduces a way for a malicious voting application to manipulate the vote without being detected by the verification mechanism, hence breaking the cast-as-intended property. As a solution, we propose modifying the protocol of Mu{\\c{s}} et al. slightly and argue for improvement of the security guarantees. However, there is inherent drop in usability in the protocol as proposed by Mu{\\c{s}} et al., and this issue will also remain in our improved protocol.\",\nisbn=\"978-3-319-68687-5\"\n}\n",{"title":2169,"type":228,"excerpt":2170,"year":30,"authors":2171,"tags":2176,"pdfFile":10,"pdfUrl":39,"extendedUrl":10,"bibTeX":10},"Preprocessing Based Verification of Multiparty Protocols with Honest Majority.","Proceedings on Privacy Enhancing Technologies. Volume 2017, Issue 4, Pages 19-72. Presented at the 17th Privacy Enhancing Technologies Symposium, PETS 2017, Minneapolis, MN, USA, July 18-21, 2017.\n\nhttps:\u002F\u002Fcontent.sciendo.com\u002Fview\u002Fjournals\u002Fpopets\u002F2017\u002F4\u002Farticle-p23.xml",[2172,2173,2174],{"author":219},{"author":355},{"author":2175},"Jagomägis, R. ",[],{"title":2178,"type":228,"excerpt":2179,"year":30,"authors":2180,"tags":2183,"pdfFile":10,"pdfUrl":2184,"extendedUrl":10,"bibTeX":2185},"Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows","In proceedings of the 6th International Conference on Principles of Security and Trust (POST), Uppsala, Sweden, April 24-25, 2017. In: Maffei, M., Ryan, M. (eds) Principles of Security and Trust. POST 2017. Lecture Notes in Computer Science(), vol 10204. Springer, Berlin, Heidelberg. © Springer. ",[2181,2182],{"author":217},{"author":1856},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-54455-6_14",{"tag":10,"width":10,"height":10,"text":2186},"@InProceedings{10.1007\u002F978-3-662-54455-6_14,\nauthor=\"Pettai, Martin\nand Laud, Peeter\",\neditor=\"Maffei, Matteo\nand Ryan, Mark\",\ntitle=\"Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows\",\nbooktitle=\"Principles of Security and Trust\",\nyear=\"2017\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"298--319\",\nabstract=\"Workflows are a notation for business processes, focusing on tasks and data flows between them. We have designed and implemented a method for analyzing leakages in workflows by combining differential privacy and mutual information. The input of the method is a description of leakages for each workflow component, using either differential-privacy- or mutual-information-based quantification (whichever is known for the component). The differential-privacy-based bounds are combined using the triangle inequality and are then converted to mutual-information-based bounds. Then the bounds for the components are combined using a maximum-flow algorithm. The output of the method is a mutual-information-based quantification of leakages of the whole workflow.\",\nisbn=\"978-3-662-54455-6\"\n}\n",{"title":2188,"type":228,"excerpt":2189,"year":30,"authors":2190,"tags":2195,"pdfFile":10,"pdfUrl":2196,"extendedUrl":10,"bibTeX":10},"PE-BPMN: Privacy-Enhanced Business Process Model and Notation","International Conference on Business Process Management (BPM 2017), 10445: International Conference on Business Process Management (BPM 2017), Barcelona. Ed. Carmona J., Engels G., Kumar A. Springer, 40−56.",[2191,2192,2193],{"author":607},{"author":1959},{"author":2194},"Bogdanov, D. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-65000-5_3",{"title":2198,"type":228,"excerpt":2199,"year":30,"authors":2200,"tags":2202,"pdfFile":10,"pdfUrl":2203,"extendedUrl":10,"bibTeX":10},"Bits or Paper: which should get to carry your vote? ","In Robert Krimmer, Melanie Volkamer, Nadja Braun Binder, Norbert Kersting, Olivier Pereira, Carsten Schürmann, editors, Proceedings of the Second International Joint Conference E-Vote-ID 2017, LNCS, volume 10615, pp. 292-305, Springer 2017",[2201],{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jisa.2017.11.007",{"title":2205,"type":228,"excerpt":2206,"year":30,"authors":2207,"tags":2208,"pdfFile":10,"pdfUrl":2209,"extendedUrl":10,"bibTeX":10},"Cryptographic Algorithms Lifecycle Report 2017","Cybernetica researchers.",[],[],"https:\u002F\u002Fwww.ria.ee\u002Fsites\u002Fdefault\u002Ffiles\u002Fcontent-editors\u002Fpublikatsioonid\u002Fcryptographic-algorithms-lifecycle-report-2017.pdf",{"title":2211,"type":228,"excerpt":2212,"year":230,"authors":2213,"tags":2220,"pdfFile":10,"pdfUrl":2221,"extendedUrl":10,"bibTeX":2222},"Maturity and Performance of Programmable Secure Computation"," In IEEE Security & Privacy, vol. 14, no. 5, pp. 48-56, Sept.-Oct. 2016.",[2214,2216,2217,2219],{"author":2215},"Archer, D.W.",{"author":135},{"author":2218},"Pinkas, B.",{"author":607},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FMSP.2016.97",{"tag":10,"width":10,"height":10,"text":2223},"@ARTICLE{7676176,\n  author={Archer, David W. and Bogdanov, Dan and Pinkas, Benny and Pullonen, Pille},\n  journal={IEEE Security & Privacy}, \n  title={Maturity and Performance of Programmable Secure Computation}, \n  year={2016},\n  volume={14},\n  number={5},\n  pages={48-56},\n  doi={10.1109\u002FMSP.2016.97}}\n",{"title":2225,"type":228,"excerpt":789,"year":230,"authors":2226,"tags":2234,"pdfFile":10,"pdfUrl":2235,"extendedUrl":10,"bibTeX":10},"Students and Taxes: a Privacy-Preserving Social Study Using Secure Computation",[2227,2228,2229,2231,2232,2233],{"author":135},{"author":234},{"author":2230},"Kubo, B.",{"author":344},{"author":238},{"author":191},[],"https:\u002F\u002Fpetsymposium.org\u002F2016\u002Ffiles\u002Fpapers\u002FStudents_and_Taxes__a_Privacy-Preserving_Study_Using_Secure_Computation.pdf",{"title":2237,"type":228,"excerpt":2238,"year":230,"authors":2239,"tags":2257,"pdfFile":10,"pdfUrl":2258,"extendedUrl":10,"bibTeX":2259},"Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge","In Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC@AsiaCCS, Xi’an, China, May 30 – June 03, 2016, pp 11-20. ACM, 2016.",[2240,2242,2244,2246,2248,2250,2252,2253,2255],{"author":2241},"Buchmann, J.A.",{"author":2243}," Büscher, N.",{"author":2245},"Göpfert, F.",{"author":2247},"Katzenbeisser, S.",{"author":2249},"Krämer, J.",{"author":2251},"Micciancio, D.",{"author":810},{"author":2254},"van Vredendaal, C.",{"author":2256},"Walter, M.",[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F2898420.2898422",{"tag":10,"width":10,"height":10,"text":2260},"@inproceedings{10.1145\u002F2898420.2898422,\nauthor = {Buchmann, Johannes and B\\\"{u}scher, Niklas and G\\\"{o}pfert, Florian and Katzenbeisser, Stefan and Kr\\\"{a}mer, Juliane and Micciancio, Daniele and Siim, Sander and van Vredendaal, Christine and Walter, Michael},\ntitle = {Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge},\nyear = {2016},\nisbn = {9781450342865},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F2898420.2898422},\ndoi = {10.1145\u002F2898420.2898422},\nabstract = {Practical hardness results are necessary to select parameters for cryptographic schemes. Cryptographic challenges proved to be useful for determining the practical hardness of computational problems that are used to build public-key cryptography. However, several of these problems have the drawback that it is not known how to create a challenge for them without knowing the solutions. Hence, for these problems the creators of the challenges are excluded from participating. In this work, we present a method to create cryptographic challenges without excluding anyone from participating. This method is based on secure multi-party computation (MPC). We demonstrate that the MPC-based approach is indeed feasible by using it to build a challenge for the learning with errors (LWE) problem. The LWE problem is one of the most important problems in lattice-based cryptography. The security of many cryptographic schemes that have been proposed in the last decade is directly based on it. We identify parameters for LWE instances that provide the appropriate hardness level for a challenge while representing instances used to instantiate encryption schemes as close as possible. The LWE challenge is designed to determine the practical hardness of LWE, to gain an overview of the best known LWE solvers, and to motivate additional research effort in this direction.},\nbooktitle = {Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography},\npages = {11–20},\nnumpages = {10},\nkeywords = {secure multi-party computation, lattices, lwe, learning with errors, mpc},\nlocation = {Xi'an, China},\nseries = {AsiaPKC '16}\n}",{"title":2262,"type":228,"excerpt":2263,"year":230,"authors":2264,"tags":2272,"pdfFile":10,"pdfUrl":2273,"extendedUrl":2274,"bibTeX":2275},"Alternative Implementations of Secure Real Numbers","In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, Shai Halevi, editors, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (ACM CCS), Vienna, Austria, October 24-28, 2016, pp. 553-564, ACM 2016",[2265,2267,2268,2270,2271],{"author":2266},"Dimitrov, V.",{"author":679},{"author":2269},"Krips, T.,",{"author":381},{"author":141},[],"http:\u002F\u002Feprint.iacr.org\u002F2016\u002F773","https:\u002F\u002Fdoi.org\u002F10.1145\u002F2976749.2978348",{"tag":10,"width":10,"height":10,"text":2276},"@inproceedings{10.1145\u002F2976749.2978348,\nauthor = {Dimitrov, Vassil and Kerik, Liisi and Krips, Toomas and Randmets, Jaak and Willemson, Jan},\ntitle = {Alternative Implementations of Secure Real Numbers},\nyear = {2016},\nisbn = {9781450341394},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F2976749.2978348},\ndoi = {10.1145\u002F2976749.2978348},\nabstract = {This paper extends the choice available for secure real number implementations with two new contributions. We will consider the numbers represented in form a-φ b where φ is the golden ratio, and in form (-1)s.2e where e is a fixed-point number. We develop basic arithmetic operations together with some frequently used elementary functions. All the operations are implemented and benchmarked on SHAREMIND secure multi-party computation framework. It turns out that the new proposals provide viable alternatives to standard floating- and fixed-point implementations from the performance\u002Ferror viewpoint in various settings. However, the optimal choice still depends on the exact requirements of the numerical algorithm to be implemented.},\nbooktitle = {Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security},\npages = {553–564},\nnumpages = {12},\nkeywords = {privacy-preserving data analysis, secure fixed- and floating-point arithmetic, secure computations},\nlocation = {Vienna, Austria},\nseries = {CCS '16}\n}",{"title":2278,"type":10,"excerpt":2279,"year":230,"authors":2280,"tags":2285,"pdfFile":10,"pdfUrl":2286,"extendedUrl":10,"bibTeX":2287},"Differential Privacy Analysis of Data Processing Workflows","In proceedings of the Third International Workshop on Graphical Models for Security (GraMSec 2016) Lisbon, Portugal, June 27th, 2016. © Springer.",[2281,2282,2284],{"author":1524},{"author":2283},"Bañuelos, L. G.",{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-46263-9_4",{"tag":10,"width":10,"height":10,"text":2288},"@InProceedings{10.1007\u002F978-3-319-46263-9_4,\nauthor=\"Dumas, Marlon\nand Garc{\\'i}a-Ba{\\~{n}}uelos, Luciano\nand Laud, Peeter\",\neditor=\"Kordy, Barbara\nand Ekstedt, Mathias\nand Kim, Dong Seong\",\ntitle=\"Differential Privacy Analysis of Data Processing Workflows\",\nbooktitle=\"Graphical Models for Security\",\nyear=\"2016\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"62--79\",\nabstract=\"Differential privacy is an established paradigm to measure and control private information leakages occurring as a result of disclosures of derivatives of sensitive data sources. The bulk of differential privacy research has focused on designing mechanisms to ensure that the output of a program or query is {\\$}{\\$}{\\backslash}epsilon {\\$}{\\$}-differentially private with respect to its input. In an enterprise environment however, data processing generally occurs in the context of business processes consisting of chains of tasks performed by multiple IT system components, which disclose outputs to multiple parties along the way. Ensuring privacy in this setting requires us to reason in terms of series of disclosures of intermediate and final outputs, derived from multiple data sources. This paper proposes a method to quantify the amount of private information leakage from each sensitive data source vis-a-vis of each party involved in a business process. The method relies on generalized composition rules for sensitivity and differential privacy, which are applicable to chained compositions of tasks, where each task may have multiple inputs and outputs of different types, and such that a differentially private output of a task may be taken as input by other tasks.\",\nisbn=\"978-3-319-46263-9\"\n}",{"title":2290,"type":228,"excerpt":2291,"year":230,"authors":2292,"tags":2299,"pdfFile":10,"pdfUrl":2300,"extendedUrl":10,"bibTeX":2301},"Improving the verifiability of the Estonian Internet Voting scheme"," In: Robert Krimmer, Melanie Volkamer, Jordi Barrat, Josh Benaloh, Nicole Goodman, Peter Y.A. Ryan, Oliver Spycher, Vanessa Teague, Gregor Wenda (Eds.), The International Conference on Electronic Voting E-Vote-ID 2016, 18-21 October 2016, Lochau\u002FBregenz, Austria, TUT Press, pp. 213-229, ISBN 978-9949-83-022-0.",[2293,2294,2296,2298],{"author":984},{"author":2295},"Martens, T.",{"author":2297},"Vinkel, P.",{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-52240-1_6",{"tag":10,"width":10,"height":10,"text":2302},"@InProceedings{10.1007\u002F978-3-319-52240-1_6,\nauthor=\"Heiberg, Sven\nand Martens, Tarvi\nand Vinkel, Priit\nand Willemson, Jan\",\neditor=\"Krimmer, Robert\nand Volkamer, Melanie\nand Barrat, Jordi\nand Benaloh, Josh\nand Goodman, Nicole\nand Ryan, Peter Y. A.\nand Teague, Vanessa\",\ntitle=\"Improving the Verifiability of the Estonian Internet Voting Scheme\",\nbooktitle=\"Electronic Voting\",\nyear=\"2017\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"92--107\",\nabstract=\"We describe an update of the Estonian Internet Voting scheme targeted towards adding verification capabilities to the central system. We propose measures to ensure the auditability of the correctness of vote decryption and i-ballot box integrity. The latter will be improved to a level where it would be possible to outsource the vote collection process to an untrusted party and later fully verify the correctness of its operations.\",\nisbn=\"978-3-319-52240-1\"\n}\n",{"title":2304,"type":228,"excerpt":2305,"year":230,"authors":2306,"tags":2310,"pdfFile":10,"pdfUrl":2311,"extendedUrl":10,"bibTeX":10},"Optimizing MPC for robust and scalable integer and floating-point arithmetic","In proceedings of the 4th Workshop on Encrypted Computing and Applied Homomorphic Cryptography (WAHC 2016), Barbados, February 26th, 2016. © Springer.",[2307,2308,2309],{"author":679},{"author":219},{"author":381},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-53357-4_18",{"title":2313,"type":228,"excerpt":2314,"year":230,"authors":2315,"tags":2321,"pdfFile":10,"pdfUrl":2322,"extendedUrl":10,"bibTeX":10},"The Attack Navigator","In Sjouke Mauw, Barbara Kordy, Sushil Jajodia, editors, Second International Workshop, GraMSec 2015, Verona, Italy, July 13, 2015, Revised Selected Papers. Volume 9390 of LNCS, Springer, 2016, pp. 1-17. ",[2316,2318,2319],{"author":2317},"Probst C.W.",{"author":141},{"author":2320},"Pieters, W.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-29968-6_1",{"title":2324,"type":228,"excerpt":2325,"year":230,"authors":2326,"tags":2329,"pdfFile":10,"pdfUrl":2330,"extendedUrl":10,"bibTeX":10},"Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation","In Joaquin Garcia-Alfaro, Evangelos Kranakis and Guillaume Bonfante, editors, oundations and Practice of Security: 8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, Revised Selected Papers. Volume 9482 of the Lecture Notes in Computer Science, Springer 2016, pp. 66-82. 8 ",[2327,2328],{"author":19},{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-30303-1_5",{"title":2332,"type":228,"excerpt":2333,"year":230,"authors":2334,"tags":2337,"pdfFile":10,"pdfUrl":2338,"extendedUrl":10,"bibTeX":10},"Securing Multiparty Protocols against the Exposure of Data to Honest Parties"," In proceedings of the 11th DPM International Workshop on Data Privacy Management (DPM 2016), Heraklion, Greece, September 26-27, 2016. © Springer. ",[2335,2336],{"author":1856},{"author":355},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-47072-6_11",{"title":2340,"type":228,"excerpt":2341,"year":230,"authors":2342,"tags":2345,"pdfFile":10,"pdfUrl":2346,"extendedUrl":2347,"bibTeX":2348},"Optimizing Secure Computation Programs with Private Conditionals","In proceedings of the 18th International Conference on Information and Communications Security (ICICS2016), Singapore, November 29th — December 2nd, 2016. © Springer.",[2343,2344],{"author":219},{"author":355},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-50011-9_32","http:\u002F\u002Feprint.iacr.org\u002F2016\u002F942",{"tag":10,"width":10,"height":10,"text":2349},"@InProceedings{10.1007\u002F978-3-319-50011-9_32,\nauthor=\"Laud, Peeter\nand Pankova, Alisa\",\neditor=\"Lam, Kwok-Yan\nand Chi, Chi-Hung\nand Qing, Sihan\",\ntitle=\"Optimizing Secure Computation Programs with Private Conditionals\",\nbooktitle=\"Information and Communications Security\",\nyear=\"2016\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"418--430\",\nabstract=\"Secure computation platforms are often provided with a programming language that allows a developer to write privacy-preserving applications and hides away the underlying cryptographic details. The control flow of these programs is expensive to hide, hence branching on private values is often disallowed. The application programmers have to specify their programs in terms of allowed constructions, either using ad-hoc methods to avoid such branchings, or the general methodology of executing all branches and obliviously selecting the effects of one at the end. There may be compiler support for the latter.\",\nisbn=\"978-3-319-50011-9\"\n}\n\n",{"title":2351,"type":228,"excerpt":2352,"year":230,"authors":2353,"tags":2356,"pdfFile":10,"pdfUrl":2357,"extendedUrl":10,"bibTeX":10},"Secure Multiparty Sorting Protocols with Covert Privacy"," In proceedings of the 21st Nordic Conference on Secure IT Systems (NordSec 2016), Oulu, Finland, November 2-4, 2016. © Springer. ",[2354,2355],{"author":219},{"author":217},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-47560-8_14",{"title":2359,"type":228,"excerpt":2360,"year":230,"authors":2361,"tags":2371,"pdfFile":10,"pdfUrl":2372,"extendedUrl":10,"bibTeX":10},"Privacy Protection for Wireless Medical Sensor Data"," IEEE Transactions on Dependable and Secure Computing 13(3): 369-380 (2016)",[2362,2364,2366,2368,2370],{"author":2363},"Yi, X.",{"author":2365},"Bouguettaya, A.",{"author":2367},"Georgakopoulos, D.",{"author":2369},"Song, A.",{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FTDSC.2015.2406699",{"title":2374,"type":228,"excerpt":2375,"year":230,"authors":2376,"tags":2377,"pdfFile":10,"pdfUrl":2378,"extendedUrl":10,"bibTeX":10},"Cryptographic Algorithms Lifecycle Report 2016","Cybernetica researchers (procured by RIA).",[],[],"https:\u002F\u002Fwww.id.ee\u002Fwp-content\u002Fuploads\u002F2020\u002F02\u002Fcryptographic_algorithms_lifecycle_report_2016.pdf",{"title":2380,"type":228,"excerpt":2381,"year":120,"authors":2382,"tags":2389,"pdfFile":10,"pdfUrl":2390,"extendedUrl":10,"bibTeX":2391},"How the Estonian Tax and Customs Board Evaluated a Tax Fraud Detection System Based on Secure Multi-party Computation"," Financial Cryptography and Data Security – 19th International Conference, 2015, San Juan, Puerto Rico, January 26-30, 2015.",[2383,2384,2386,2388],{"author":135},{"author":2385},"Jõemets, M.",{"author":2387},"Vaht, M.",{"author":810},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-47854-7_14",{"tag":10,"width":10,"height":10,"text":2392},"@InProceedings{10.1007\u002F978-3-662-47854-7_14,\nauthor=\"Bogdanov, Dan\nand J{\\~o}emets, Marko\nand Siim, Sander\nand Vaht, Meril\",\neditor=\"B{\\\"o}hme, Rainer\nand Okamoto, Tatsuaki\",\ntitle=\"How the Estonian Tax and Customs Board Evaluated a Tax Fraud Detection System Based on Secure Multi-party Computation\",\nbooktitle=\"Financial Cryptography and Data Security\",\nyear=\"2015\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"227--234\",\nabstract=\"The Estonian Tax and Customs Board (MTA) has identified that Estonia is losing over 220 million euros a year due to avoidance of value-added tax (VAT). The parliament proposed legislation that makes companies declare their purchase and sales invoices for automated risk analysis and fraud detection. The law was vetoed by the Estonian President on the grounds of confidentiality breach and unnecessary burden to companies. In this paper, we report on our collaboration with MTA to build a tax fraud detection system prototype that uses secure multi-party computation (SMC) to remove the companies' concerns over confidentiality. We estimate that the prototype could process a month of Estonian VAT data in ten days running on 20 000 euros worth of hardware.\",\nisbn=\"978-3-662-47854-7\"\n}\n\n",{"title":2394,"type":228,"excerpt":2395,"year":120,"authors":2396,"tags":2398,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Simpl DSL toolkit","Science of Computer Programming, Volume 114, 15 December 2015, Pages 85-91, ISSN 0167-6423",[2397],{"author":879},[],{"title":2400,"type":228,"excerpt":2401,"year":120,"authors":2402,"tags":2408,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"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.",[2403,2405,2406],{"author":2404},"Gurov, D.",{"author":2018},{"author":2407},"Guanciale, R.",[],{"title":2410,"type":228,"excerpt":2411,"year":120,"authors":2412,"tags":2417,"pdfFile":10,"pdfUrl":2418,"extendedUrl":10,"bibTeX":2419},"Log Analysis of Estonian Internet Voting 2013-2014","In Rolf Haenni, Reto E. Koenig and Douglas Wikström (editors) E-Voting and Identity, Lecture Notes in Computer Science Volume 9269, pp 19-34, Springer 2015.",[2413,2414,2416],{"author":984},{"author":2415},"Parsovs, A.",{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-22270-7_2",{"tag":10,"width":10,"height":10,"text":2420},"@InProceedings{10.1007\u002F978-3-319-22270-7_2,\nauthor=\"Heiberg, Sven\nand Parsovs, Arnis\nand Willemson, Jan\",\neditor=\"Haenni, Rolf\nand Koenig, Reto E.\nand Wikstr{\\\"o}m, Douglas\",\ntitle=\"Log Analysis of Estonian Internet Voting 2013--2014\",\nbooktitle=\"E-Voting and Identity\",\nyear=\"2015\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"19--34\",\nabstract=\"This paper presents analysis of Internet voting system logs of 2013 local municipal and 2014 European Parliament elections in Estonia. We study both sociodemographic characteristics of voters and technical aspects of voting. Special attention is paid to voting and verification sessions that can be considered irregular (e.g. inability to cast a valid vote or failed verifications). We observe several interesting phenomena, e.g. that older people are generally faster Internet voters and that women use the vote verification option significantly less than men.\",\nisbn=\"978-3-319-22270-7\"\n}",{"title":2422,"type":228,"excerpt":2423,"year":120,"authors":2424,"tags":2427,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Secure floating point arithmetic and private satellite collision analysis"," in International Journal of Information Security, November 2015, Volume 14, Issue 6, pp 531-548, Springer (link.springer.com)",[2425,2426],{"author":234},{"author":141},[],{"title":2429,"type":228,"excerpt":2430,"year":120,"authors":2431,"tags":2433,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees","Proceedings on Privacy Enhancing Technologies, 2015(2), 188–205.",[2432],{"author":219},[],{"title":2435,"type":228,"excerpt":2436,"year":120,"authors":2437,"tags":2440,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Applications of Secure Multiparty Computation"," IOS Press 2015 (ebooks\u002Fiospress)",[2438,2439],{"author":219},{"author":234},[],{"title":2442,"type":228,"excerpt":2443,"year":120,"authors":2444,"tags":2448,"pdfFile":10,"pdfUrl":2449,"extendedUrl":10,"bibTeX":2450},"A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols","22nd ACM Conference on Computer and Communications Security, Denver, CO, USA, October 12th–16th, 2015. (Toim.) Kruegel, Christopher; Li, Ninghui. ACM, 1492 – 1503.",[2445,2446],{"author":219},{"author":2447}," Randmets, J. ",[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F2810103.2813664",{"tag":10,"width":10,"height":10,"text":2451},"@inproceedings{10.1145\u002F2810103.2813664,\nauthor = {Laud, Peeter and Randmets, Jaak},\ntitle = {A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols},\nyear = {2015},\nisbn = {9781450338325},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F2810103.2813664},\ndoi = {10.1145\u002F2810103.2813664},\nabstract = {Sharemind is an efficient framework for secure multiparty computations (SMC). Its efficiency is in part achieved through a large set of primitive, optimized SMC protocols that it makes available to applications built on its top. The size of this set has brought with it an issue not present in frameworks with a small number of supported operations: the set of protocols must be maintained, as new protocols are still added to it and possible optimizations for a particular sub-protocol should be propagated into larger protocols working with data of different types.To ease the maintenance of existing and implementation of new protocols, we have devised a domain-specific language (DSL) and its optimizing compiler for specifying protocols for secure computation. In this paper, we give the rationale of the design, describe the translation steps, the location of the compiler in the whole Sharemind protocol stack, and the results obtained with this system.},\nbooktitle = {Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security},\npages = {1492–1503},\nnumpages = {12},\nkeywords = {secure multi-party computation, compiler, secure computation outsourcing, additive secret sharing, protocol optimization},\nlocation = {Denver, Colorado, USA},\nseries = {CCS '15}\n}",{"title":2453,"type":228,"excerpt":2454,"year":120,"authors":2455,"tags":2458,"pdfFile":10,"pdfUrl":2459,"extendedUrl":10,"bibTeX":2460},"Composable Oblivious Extended Permutations","In Frdédéric Cuppens, Joaquin Garcia-Alfaro, Nur Zincir Heywood and Philip W. L. Fong (editors) Foundations and Practice of Security, Lecture Notes in Computer Science Volume 8930, pp 294-310, Springer 2015",[2456,2457],{"author":219},{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-17040-4_19",{"tag":10,"width":10,"height":10,"text":2461},"@InProceedings{10.1007\u002F978-3-540-72738-5_14,\nauthor=\"Laur, Sven\nand Lipmaa, Helger\",\neditor=\"Katz, Jonathan\nand Yung, Moti\",\ntitle=\"A New Protocol for Conditional Disclosure of Secrets and Its Applications\",\nbooktitle=\"Applied Cryptography and Network Security\",\nyear=\"2007\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"207--225\",\nabstract=\"Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}. Conditional disclosure of secrets (CDS) helps to overcome this restriction. In a CDS protocol for a set {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}, the client obtains server's secret if and only if the client's inputs belong to {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}and thus the server can guard itself against malformed queries. We extend the existing CDS protocols to work over additively homomorphic cryptosystems for every set from NP\u002Fpoly. The new construction is modular and easy to apply. As an example, we derive a new oblivious transfer protocol with log-squared communication and a millionaire's protocol with logarithmic communication. We also implement private, universally verifiable and robust multi-candidate electronic voting so that all voters only transmit an encryption of their vote. The only hardness assumption in all these protocols is that the underlying public-key cryptosystem is IND-CPA secure and the plaintext order does not have small factors.\",\nisbn=\"978-3-540-72738-5\"\n}",{"title":2463,"type":228,"excerpt":2464,"year":120,"authors":2465,"tags":2470,"pdfFile":10,"pdfUrl":2471,"extendedUrl":10,"bibTeX":2472},"Genetic Approximations for the Failure-Free Security Games","In Khouzani, MHR, Panaousis, Emmanouil, Theodorakopoulos, George, editors, Decision and Game Theory for Security, 6th International Conference, GameSec 2015, Lecture Notes in Computer Science Volume 9406, pp 311-321, Springer 2015.",[2466,2467,2468],{"author":1702},{"author":141},{"author":2469},"Charnamord A.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-25594-1_17",{"tag":10,"width":10,"height":10,"text":2473},"@InProceedings{10.1007\u002F978-3-319-25594-1_17,\nauthor=\"Lenin, Aleksandr\nand Willemson, Jan\nand Charnamord, Anton\",\neditor=\"Khouzani, MHR\nand Panaousis, Emmanouil\nand Theodorakopoulos, George\",\ntitle=\"Genetic Approximations for the Failure-Free Security Games\",\nbooktitle=\"Decision and Game Theory for Security\",\nyear=\"2015\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"311--321\",\nabstract=\"This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failure-free game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.\",\nisbn=\"978-3-319-25594-1\"\n}\n",{"title":2475,"type":228,"excerpt":2476,"year":120,"authors":2477,"tags":2480,"pdfFile":10,"pdfUrl":2481,"extendedUrl":10,"bibTeX":2482},"Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries","28th IEEE Computer Security Foundations Symposium, Verona, Italy, July 13th–17th, 2015. (Toim.) Fournet, Cedric; Hicks, Michael. IEEE Computer Society Press, 75–89.",[2478,2479],{"author":217},{"author":1856},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FCSF.2015.13",{"tag":10,"width":10,"height":10,"text":2483},"@INPROCEEDINGS{7243726,\n  author={Pettai, Martin and Laud, Peeter},\n  booktitle={2015 IEEE 28th Computer Security Foundations Symposium}, \n  title={Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries}, \n  year={2015},\n  volume={},\n  number={},\n  pages={75-89},\n  doi={10.1109\u002FCSF.2015.13}}",{"title":2485,"type":228,"excerpt":2486,"year":120,"authors":2487,"tags":2491,"pdfFile":10,"pdfUrl":2492,"extendedUrl":10,"bibTeX":2493},"Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations","Financial Cryptography and Data Security – 2015 Workshops, San Juan, Puerto Rico, January 30, 2015. In: Brenner, M., Christin, N., Johnson, B., Rohloff, K. (eds) Financial Cryptography and Data Security. FC 2015. Lecture Notes in Computer Science(), vol 8976. Springer, Berlin, Heidelberg.",[2488,2489],{"author":607},{"author":2490}," Siim, S. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-48051-9_13",{"tag":10,"width":10,"height":10,"text":2494},"@InProceedings{10.1007\u002F978-3-662-48051-9_13,\nauthor=\"Pullonen, Pille\nand Siim, Sander\",\neditor=\"Brenner, Michael\nand Christin, Nicolas\nand Johnson, Benjamin\nand Rohloff, Kurt\",\ntitle=\"Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations\",\nbooktitle=\"Financial Cryptography and Data Security\",\nyear=\"2015\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"172--183\",\nabstract=\"Two of the major branches in secure multi-party computation research are secret sharing and garbled circuits. This work succeeds in combining these to enable seamlessly switching to the technique more efficient for the required functionality. As an example, we add garbled circuits based IEEE 754 floating-point numbers to a secret sharing environment achieving very high efficiency and the first, to our knowledge, fully IEEE 754 compliant secure floating-point implementation.\",\nisbn=\"978-3-662-48051-9\"\n}",{"title":2496,"type":228,"excerpt":2497,"year":120,"authors":2498,"tags":2500,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Elliptkõverate krüptograafia","Seminar “E-Narnia is a fairytale: The real cyber security resides in Estonia”, Tallinn, 13. mai 2015",[2499],{"author":141},[],{"title":2502,"type":228,"excerpt":2503,"year":120,"authors":2504,"tags":2507,"pdfFile":10,"pdfUrl":2508,"extendedUrl":10,"bibTeX":2509},"Krüptograafiliste algoritmide elutsükli uuring","Uuring Riigi Infosüsteemi Ametile 2015. ",[2505],{"author":2506},"Cybernetica researchers",[],"https:\u002F\u002Fria.ee\u002Famet-uudised-ja-kontakt\u002Fuudised-pressikontakt\u002Fuuringud-ja-analuusid?view_instance=2&current_page=1",{"tag":10,"width":10,"height":10,"text":2510},"@techreport{CYBER:R2015,\n  author      = \"Cybernetica\",\n  title       = \"Krüptograafiliste algoritmide elutsükli uuring\",\n  institution = \"Cybernetica AS\",\n  year        = \"2015\",\n number = \"\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":2512,"type":228,"excerpt":2513,"year":282,"authors":2514,"tags":2519,"pdfFile":10,"pdfUrl":2520,"extendedUrl":10,"bibTeX":2521},"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. (Toim.) Datta, Anupam; Fournet, Cedric. IEEE Computer Society, 2014, lk 184-198.",[2515,2516,2517,2518],{"author":135},{"author":219},{"author":236},{"author":607},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FCSF.2014.21",{"tag":10,"width":10,"height":10,"text":2522},"@INPROCEEDINGS{6957111,\n  author={Bogdanov, Dan and Laud, Peeter and Laur, Sven and Pullonen, Pille},\n  booktitle={2014 IEEE 27th Computer Security Foundations Symposium}, \n  title={From Input Private to Universally Composable Secure Multi-party Computation Primitives}, \n  year={2014},\n  volume={},\n  number={},\n  pages={184-198},\n  doi={10.1109\u002FCSF.2014.21}}\n",{"title":2524,"type":228,"excerpt":2525,"year":282,"authors":2526,"tags":2530,"pdfFile":10,"pdfUrl":2531,"extendedUrl":10,"bibTeX":2532},"A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation","In Karin Bernsmed, Simone Fischer-Hübner (editors), Secure IT Systems. 19th Nordic Conference, NordSec 2014, Tromsø, Norway, October 15-17, LNCS 8788, pp. 59-74, Springer 2014.",[2527,2528,2529],{"author":135},{"author":236},{"author":191},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-11599-3_4",{"tag":10,"width":10,"height":10,"text":2533},"@InProceedings{10.1007\u002F978-3-319-11599-3_4,\nauthor=\"Bogdanov, Dan\nand Laur, Sven\nand Talviste, Riivo\",\neditor=\"Bernsmed, Karin\nand Fischer-H{\\\"u}bner, Simone\",\ntitle=\"A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation\",\nbooktitle=\"Secure IT Systems\",\nyear=\"2014\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"59--74\",\nabstract=\"Cryptographic secure computing methods like secure multi-party computation, circuit garbling and homomorphic encryption are becoming practical enough to be usable in applications. Such applications need special data-independent sorting algorithms to preserve privacy. In this paper, we describe the design and implementation of four different oblivious sorting algorithms. We improve two earlier designs based on sorting networks and quicksort with the capability of sorting matrices. We also propose two new designs---a naive comparison-based sort with a low round count and an oblivious radix sort algorithm that does not require any private comparisons. For all these algorithms, we present thorough complexity and performance analysis including detailed breakdown of running-time, network and memory usage.\",\nisbn=\"978-3-319-11599-3\"\n}",{"title":2535,"type":228,"excerpt":2536,"year":282,"authors":2537,"tags":2541,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":2542},"Adoption Barriers of Secure Computation for Decision Making in a Defence Application","Proceedings of the STO-MP-SAS-106 – Analysis Support to Decision Making in Cyber Defence and Security. NATO STO. 2014",[2538,2539],{"author":135},{"author":2540},"Pruulmann-Vengerfeldt, P.",[],{"tag":10,"width":10,"height":10,"text":2543},"Sharemind\nProducts\n \nSolutions\n \nBlog\n \nResellers\nResearch\nThe fundamentals of Sharemind's security\n\nPapers by year\nTHESIS 25\n \nAPPLICATIONS 29\n \nBASICS 15\n \nPERFORMANCE 48\n \nTOOLS 20\n \nPROTOCOLS 31\n \nALGORITHMS 25\n2021\nJaak Randmets An Overview of Vulnerabilities and Mitigations of Intel SGX Applications. Cybernetica research report D-2-116. 2021. (PDF, BibTeX)\n\nbasics\n\n2019\nToomas Krips. Improving performance of secure real-number operations. PhD thesis. University of Tartu. 2019. (PDF, BibTeX)\n\nthesis performance protocols algorithms\n\nJan Willemson. How Not to Use a Privacy-Preserving Computation Platform: Case Study of a Voting Application. Computer Security - ESORICS 2019 International Workshops, CyberICPS, SECPRE, SPOSE, and ADIoT, Luxembourg City, Luxembourg, September 26-27, 2019, Lecture Notes in Computer Science, vol. 11980, pp. 111--121, Springer, 2020. (PDF, BibTeX)\n\napplications basics algorithms\n\n2018\nPeeter Laud, Alisa Pankova. Privacy-preserving record linkage in large databases using secure multiparty computation. BMC Medical Genomics, Volume 11, Supplement 4, 35–55, 2018. (PDF, BibTeX)\n\napplications performance\n\nPeeter Laud, Alisa Pankova. Bit Decomposition Protocols in Secure Multiparty Computation. In Proceedings of WAHC 2018 – 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 37-48, 2018. (PDF, BibTeX)\n\nperformance protocols\n\nDan Bogdanov, Liina Kamm, Sven Laur, Ville Sokk. Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data. IEEE\u002FACM Transactions on Computational Biology and Bioinformatics, Volume 15, Issue 5, 1427-1432, 2018. (PDF, BibTeX)\n\nperformance algorithms\n\nDavid W. Archer and Dan Bogdanov and Y. Lindell and Liina Kamm and Kurt Nielsen and Jakob Illeborg Pagter and Nigel P. Smart and Rebecca N. Wright. From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation. The Computer Journal, Volume 61, Issue 12, 1 December 2018, Pages 1749–1771. (PDF, BibTeX)\n\napplications performance tools\n\n2017\nPeeter Laud, Alisa Pankova, Roman Jagomägis. Preprocessing Based Verification of Multiparty Protocols with Honest Majority In Proceedings on Privacy Enhancing Technologies, Volume 2017, Issue 4, 23-76, 2017. (PDF, BibTeX)\n\nperformance protocols\n\nNikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, Thomas Zacharias. MCMix: Anonymous Messaging via Secure Multiparty Computation. In proceedings of USENIX Security Symposium. USENIX Association, Vancouver, BC, 1217–1234. 2017. (PDF, BibTeX)\n\napplications algorithms\n\nAlisa Pankova. Efficient multiparty computation secure against covert and active adversaries. PhD thesis. University of Tartu. 2017. (PDF, BibTeX)\n\nthesis basics performance protocols\n\nJaak Randmets. Programming Languages for Secure Multi-party Computation Application Development. PhD thesis. University of Tartu. 2017. (PDF, BibTeX)\n\nthesis performance tools protocols\n\n2016\nPeeter Laud, Alisa Pankova. Optimizing Secure Computation Programs with Private Conditionals. In Proceedings of 18th International Conference on Information and Communications Security. 2017. (Extended version, PDF, BibTeX)\n\nperformance tools\n\nDan Bogdanov, Liina Kamm, Sven Laur, Ville Sokk. Implementation and Evaluation of an Algorithm for Cryptographically Private Principal Component Analysis on Genomic Data. Proceedings of the 3rd International Workshop on Genome Privacy and Security. (PDF, BibTeX)\n\nperformance algorithms\n\nVassil Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, Jan Willemson. Alternative Implementations of Secure Real Numbers. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (ACM CCS). (Extended version, PDF, BibTeX)\n\nperformance protocols\n\nDavid W. Archer, Dan Bogdanov, Benny Pinkas, Pille Pullonen. Maturity and Performance of Programmable Secure Computation. IEEE Security and Privacy. 2016. (Extended version, PDF, BibTeX)\n\napplications performance\n\nDan Bogdanov, Marko Jõemets, Sander Siim, Meril Vaht. Privacy-preserving tax fraud detection in the cloud with realistic data volumes. Cybernetica research report T-4-24. 2016. (PDF, BibTeX)\n\napplications performance\n\nDan Bogdanov, Liina Kamm, Sven Laur, Ville Sokk. Rmind: a tool for cryptographically secure statistical analysis. IEEE Transactions on Dependable and Secure Computing. 2016. (Extended version, PDF, BibTeX)\n\nperformance tools algorithms\n\nLiisi Kerik, Peeter Laud, Jaak Randmets Optimizing for Robust and Scalable Integer and Floating-Point Arithmetic. Financial Cryptography and Data Security - Workshops, BITCOIN, VOTING, and WAHC. 2016. (PDF, BibTeX)\n\n\nJohannes A. Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter. Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. In Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC@AsiaCCS, Xi'an, China, May 30 - June 03, 2016. (PDF, BibTeX)\n\napplications algorithms\n\nSander Siim. A Comprehensive Protocol Suite for Secure Two-Party Computation. Master's Thesis. University of Tartu. 2016. (PDF, BibTeX)\n\nthesis performance protocols\n\nVille Sokk. An improved type system for a privacy-aware programming language and its practical applications. Master's Thesis. University of Tartu. 2016. (PDF, BibTeX)\n\nthesis tools\n\nDan Bogdanov, Liina Kamm, Baldur Kubo, Reimo Rebane, Ville Sokk, Riivo Talviste. Students and Taxes: a Privacy-Preserving Social Study Using Secure Computation. In Proceedings on Privacy Enhancing Technologies, PoPETs, 2016 (3), pp 117–135, 2016. (Extended version, PDF, BibTeX)\n\napplications performance algorithms\n\nToomas Krips, Jan Willemson. Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation. In Foundations and Practice of Security: 8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, LNCS, vol. 9482, pp. 66--82, Springer 2016. (PDF, BibTeX)\n\nprotocols algorithms\n\nRiivo Talviste. Applying Secure Multi-party Computation in Practice. PhD thesis. University of Tartu. 2016. (PDF, BibTeX)\n\nthesis applications performance protocols algorithms\n\n2015\nLiina Kamm, Jan Willemson. Secure floating point arithmetic and private satellite collision analysis. International Journal of Information Security. 2015. (PDF, BibTeX)\n\napplications performance protocols\n\nMartin Pettai, Peeter Laud. Combining Differential Privacy and Secure Multiparty Computation. In Proceedings of the 31st Annual Computer Security Applications Conference. 2015. (Extended version, PDF, BibTeX)\n\nalgorithms\n\nPeeter Laud, Jaak Randmets. A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols. In Proceedings of 22nd ACM Conference on Computer and Communications Security. 2015. (PDF, BibTeX)\n\nperformance tools\n\nMartin Pettai, Peeter Laud. Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries. In Proceedings of the 28th IEEE Computer Security Foundations Symposium. 2015. (Extended version, PDF, BibTeX)\n\nbasics\n\nPeeter Laud. Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees. In Proceedings of Privacy Enhancing Technologies. 2015. (PDF, BibTeX)\n\nprotocols\n\nDavid W. Archer, Dan Bogdanov, Benny Pinkas, Pille Pullonen. Maturity and Performance of Programmable Secure Computation. Cryptology ePrint Archive: Report 2015\u002F1039. 2015. (PDF, BibTeX)\n\napplications performance\n\nAnnett Saarik. Privacy Risks and Data Protection Controls in Passenger Name Record Processing. Diploma Thesis. Estonian Aviation Academy. 2015. (Extended version, PDF, BibTeX)\n\napplications\n\nMeril Vaht. The Analysis and Design of a Privacy-Preserving Survey System. Master's Thesis. University of Tartu. 2015. (PDF, BibTeX)\n\nthesis applications\n\nPille Pullonen, Sander Siim. Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations. Financial Cryptography and Data Security - Workshops on BITCOIN, WAHC and Wearable. 2015. (Extended version, PDF, BibTeX)\n\nperformance protocols\n\nDan Bogdanov, Marko Jõemets, Sander Siim, Meril Vaht. How the Estonian Tax and Customs Board Evaluated a Tax Fraud Detection System Based on Secure Multi-party Computation. Financial Cryptography and Data Security - 19th International Conference. 2015. (PDF, BibTeX)\n\napplications performance\n\nLiina Kamm. Privacy-preserving statistical analysis using secure multi-party computation. PhD thesis. University of Tartu. 2015. (PDF, BibTeX)\n\nthesis applications performance tools protocols algorithms\n\n2014\nPeeter Laud. A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. In Proceedings of 16th International Conference on Information and Communications Security. 2014. (PDF, BibTeX)\n\nprotocols\n\nPeeter Laud, Jan Willemson. Composable Oblivious Extended Permutations. In Proceedings of the 7th International Symposium on Foundations and Practice of Security. 2014. (Extended version, PDF, BibTeX)\n\nprotocols\n\nPeeter Laud, Alisa Pankova. Verifiable Computation in Multiparty Protocols with Honest Majority. In Proceedings of the 8th International Conference on Provable Security. 2014. (Extended version, PDF, BibTeX)\n\nbasics protocols\n\nDan Bogdanov, Peeter Laud, Jaak Randmets. Domain-Polymorphic Programming of Privacy-Preserving Applications. In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS'14, ACM Digital Library. 2014. (PDF, BibTeX)\n\nbasics tools\n\nDan Bogdanov, Peeter Laud, Sven Laur, Pille Pullonen. From Input Private to Universally Composable Secure Multi-party Computation Primitives. In Proceedings of the 27th IEEE Computer Security Foundations Symposium, CSF 2014, pp. 184-198. 2014. (PDF, BibTeX)\n\nbasics\n\nToomas Krips, Jan Willemson. Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations. In Proceedings of the 17th International Information Security Conference, ISC 2014, LNCS, vol. 8783, pp. 179-197. Springer. 2014. (Extended version, PDF, BibTeX)\n\nperformance protocols\n\nTiit Pikma. Auditing of Secure Multiparty Computations. Master's thesis. University of Tartu. 2014. (PDF, BibTeX)\n\nthesis basics\n\nDan Bogdanov, Liina Kamm, Sven Laur, Ville Sokk. Rmind: a tool for cryptographically secure statistical analysis. Cryptology ePrint Archive, Report 2014\u002F512. 2014. (PDF, BibTeX)\n\nperformance tools algorithms\n\nDan Bogdanov, Marko Jõemets, Sander Siim, Meril Vaht. Turvalist ühisarvutust kasutava käibemaksudeklaratsioonide riskianalüüsi süsteemi prototüüp (Secure multi-party computation system prototype for analyzing risks in value added tax declarations). Cybernetica research report T-4-22. 2014. (PDF, BibTeX)\n\napplications\n\nDan Bogdanov, Pille Pruulmann-Vengerfeldt. Adoption Barriers of Secure Computation for Decision Making in a Defence Application. Proceedings of the STO-MP-SAS-106 - Analysis Support to Decision Making in Cyber Defence and Security. NATO STO. 2014. (BibTeX)\n\napplications\n\nDan Bogdanov, Keita Emura, Roman Jagomägis, Akira Kanaoka, Shin'ichiro Matsuo, Jan Willemson. A secure genetic algorithm for the subset cover problem and its application to privacy protection. In Proceedings of the 8th International Workshop on Information Security Theory and Practice, WISTP 2014, LNCS, vol 8501, pp. 108-123. Springer. 2014. (PDF, BibTeX)\n\napplications algorithms\n\nDan Bogdanov, Liina Kamm, Sven Laur, Pille Pruulmann-Vengerfeldt, Riivo Talviste, Jan Willemson. Privacy-preserving statistical data analysis on federated databases. In Proceedings of the 2nd Annual Privacy Forum 2014, APF 2014, LNCS, vol. 8450, pp. 30-55. Springer. 2014. (PDF, BibTeX)\n\napplications performance algorithms\n\nSander Siim, Dan Bogdanov. A general mechanism for implementing secure operations on secret shared data. Cybernetica research report T-4-21. 2014. (PDF, BibTeX)\n\nperformance protocols\n\nDan Bogdanov, Sven Laur, Riivo Talviste. A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. In Proceedings of the 19th Nordic Conference on Secure IT Systems, NordSec 2014, LNCS, vol. 8788, pp. 59-74. Springer (2014). (PDF, BibTeX)\n\nperformance algorithms\n\nTiina Turban. Secure Multi-Party Computation Protocol Suite Inspired by Shamir's Secret Sharing Scheme. Master's thesis. University of Tartu. 2014. (PDF, BibTeX)\n\nthesis performance protocols\n\n2013\nLiina Kamm, Jan Willemson. Secure Floating-Point Arithmetic and Private Satellite Collision Analysis. Cryptology ePrint Archive, Report 2013\u002F850. 2013. (PDF, BibTeX)\n\napplications performance algorithms\n\nDan Bogdanov, Liina Kamm, Sven Laur, Pille Pruulmann-Vengerfeldt. Secure multi-party data analysis: end user validation and practical experiments. Cryptology ePrint Archive, Report 2013\u002F826. 2013. (PDF, BibTeX)\n\napplications algorithms\n\nDan Bogdanov, Sven Laur, Riivo Talviste. Oblivious Sorting of Secret-Shared Data. Cybernetica research report T-4-19. 2013. (PDF, BibTeX)\n\nperformance algorithms\n\nPeeter Laud, Alisa Pankova, Martin Pettai, Jaak Randmets. Specifying Sharemind's Arithmetic Black Box. In Proceedings of the First ACM Workshop on Language Support for Privacy-enhancing Technologies, PETShop 2013, ACM Digital Library. 2013. (PDF, BibTeX)\n\ntools\n\nDan Bogdanov, Peeter Laud, Jaak Randmets. Domain-Polymorphic Programming of Privacy-Preserving Applications. In Proceedings of the First ACM Workshop on Language Support for Privacy-enhancing Technologies, PETShop 2013, ACM Digital Library. 2013. (Extended version, PDF, BibTeX)\n\nbasics tools\n\nPille Pullonen. Actively Secure Two-Party Computation: Efficient Beaver Triple Generation. Master's thesis. University of Tartu. 2013. (PDF, BibTeX)\n\nthesis performance protocols\n\nDan Bogdanov, Aivo Kalu. Pushing Back the Rain—How to Create Trustworthy Services in the Cloud. ISACA Journal, Issue 3 - Big Data, 49 - 51, 2013. (Extended version, BibTeX)\n\napplications\n\nLiina Kamm, Dan Bogdanov, Sven Laur, Jaak Vilo. A new way to protect privacy in large-scale genome-wide association studies. Bioinformatics 29 (7): 886-893, 2013. (Extended version, BibTeX)\n\napplications performance algorithms\n\nSven Laur, Riivo Talviste, Jan Willemson. From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting. In Proceedings of the 11th International Conference on Applied Cryptography and Network Security, ACNS 2013, LNCS, vol. 7954, pp. 84-101. Springer. 2013. (Extended version, BibTeX)\n\nperformance protocols\n\nDan Bogdanov. Sharemind: programmable secure computations with practical applications. PhD thesis. University of Tartu. 2013. (PDF, BibTeX)\n\nthesis applications basics performance tools protocols algorithms\n\n2012\nPille Pullonen, Dan Bogdanov, Thomas Schneider. The design and implementation of a two-party protocol suite for Sharemind 3. Cybernetica research report T-4-17. 2012. (PDF, BibTeX)\n\nprotocols\n\nDan Bogdanov, Margus Niitsoo, Tomas Toft, Jan Willemson. High-performance secure multi-party computation for data mining applications. International Journal of Information Security 11(6), pp 403-418. Springer. 2012. (PDF, BibTeX)\n\nperformance protocols\n\nReimo Rebane. A Feasibility Analysis of Secure Multiparty Computation Deployments. Master's thesis. University of Tartu. 2012. (PDF, BibTeX)\n\nthesis performance\n\nDan Bogdanov, Riivo Talviste, Jan Willemson. Deploying secure multi-party computation for financial data analysis (Short Paper). In Proceedings of the Sixteenth International Conference on Financial Cryptography and Data Security 2012, FC 2012, LNCS, vol 7397, pp 57-64. Springer. 2012. (Extended version, PDF, BibTeX)\n\napplications performance\n\nDan Bogdanov, Roman Jagomägis, Sven Laur. A universal toolkit for cryptographically secure privacy-preserving data mining. In Proceedings of Pacific Asia Workshop on Intelligence and Security Informatics, PAISI 2012, LNCS, vol. 7299, pp. 112-126. Springer. 2012. (PDF, BibTeX)\n\napplications performance algorithms\n\n2011\nRisto Saar. A new database layer for the Sharemind privacy preserving computer. Bachelor's thesis. University of Tartu. 2011. (PDF, BibTeX)\n\nthesis tools\n\nRiivo Talviste. Deploying secure multiparty computation for joint data analysis — a case study. Master's thesis. University of Tartu. 2011. (PDF, BibTeX)\n\nthesis applications performance\n\nDan Bogdanov, Liina Kamm. Constructing Privacy-Preserving Information Systems Using Secure Multiparty Computation. Cybernetica research report T-4-13. 2011. (PDF, BibTeX)\n\nbasics\n\nSven Laur, Bingsheng Zhang, Jan Willemson. Round-efficient Oblivious Database Manipulation. In Proceedings of the 14th International Conference on Information Security, ISC 2011, LNCS, vol. 7001, pp. 262-277. Springer, Heidelberg. 2011. (Extended version, BibTeX)\n\nperformance protocols\n\nOleg Šelajev. The Use of Circuit Evaluation Techniques for Secure Computation. Master's thesis. University of Tartu. 2011. (PDF, BibTeX)\n\nthesis protocols\n\nOleg Šelajev, Sven Laur. Yao Garbled Circuits in Secret Sharing-based Secure Multi-party Computation. Cybernetica research report T-4-15. 2011. (PDF, BibTeX)\n\nprotocols\n\nKristján Valur Jónsson, Gunnar Kreitz, Abu Hamed Mohammad Misbah Uddin. Secure Multi-Party Sorting and Applications. Cryptology ePrint Archive, Report 2011\u002F122. 2011. (PDF, BibTeX)\n\nperformance algorithms\n\n2010\nDan Bogdanov, Margus Niitsoo, Tomas Toft, Jan Willemson. Improved protocols for the Sharemind virtual machine. Cybernetica research report T-4-10. 2010. (PDF, BibTeX)\n\nperformance protocols\n\nAbu Hamed Mohammad Misbah Uddin. Privacy Preserving Collaborative Anomaly Detection Using Secure Multi-party Computation. Master's thesis. School of Computer Science and Communication, KTH Royal Institute of Technology. 2010. (PDF, BibTeX)\n\nthesis performance algorithms\n\nJaak Ristioja. An analysis framework for an imperative privacy-preserving programming language. Master's thesis. University of Tartu. 2010. (PDF, BibTeX)\n\nthesis tools\n\nReimo Rebane. An integrated development environment for the SecreC programming language. Bachelor's thesis. University of Tartu. 2010. (PDF, BibTeX)\n\nthesis tools\n\nRoman Jagomägis. SecreC: a Privacy-Aware Programming Language with Applications in Data Mining. Master's thesis. University of Tartu. 2010. (PDF, BibTeX)\n\nthesis tools\n\nDan Bogdanov, Sven Laur. The design of a privacy-preserving distributed virtual machine. In the Collection of AEOLUS theoretical findings. Deliverable D1.0.6. AEOLUS project IP-FP6-015964. 2010. (PDF, BibTeX)\n\ntools protocols\n\n2009\nKatharina Kahrs. Share Computing Protocols over Fields and Rings. Master's thesis. University of Tartu. 2009. (PDF, BibTeX)\n\nthesis basics\n\nDan Bogdanov, Riivo Talviste. An improved method for privacy-preserving web-based data collection. Cybernetica research report T-4-5. 2009. (PDF, BibTeX)\n\ntools\n\nRiivo Talviste. Web-based data entry in privacy-preserving applications. Bachelor's thesis. University of Tartu. 2009. (PDF, BibTeX)\n\nthesis tools\n\nDan Bogdanov, Roman Jagomägis, Sven Laur. Privacy-preserving Histogram Computation and Frequent Itemset Mining with Sharemind. Cybernetica research report T-4-8. 2009. (PDF, BibTeX)\n\napplications performance algorithms\n\nDan Bogdanov, Riivo Talviste. A Comparison of Software Pseudorandom Number Generators. In Proceedings of Third Baltic Conference on Advanced Topics in Telecommunication, Tartu, Estonia 2009 (61 - 71). Rostock: Universität Rostock, Wissenschaftsverbund Iu. 2009. (BibTeX)\n\nperformance\n\n2008\nDan Bogdanov, Richard Sassoon. Privacy preserving collaborative filtering with Sharemind. Cybernetica research report T-4-2. 2008. (PDF, BibTeX)\n\napplications\n\nRoman Jagomägis. A programming language for creating privacy-preserving applications. Bachelor's thesis. University of Tartu. 2008. (PDF, BibTeX)\n\nthesis tools\n\nYanjun Yao. Automated Security Proofs of Secret Shared Protocols. Master's thesis. University of Tartu. 2008. (PDF, BibTeX)\n\nthesis basics\n\nDan Bogdanov, Sven Laur, Jan Willemson. Sharemind: a framework for fast privacy-preserving computations. In Proceedings of 13th European Symposium on Research in Computer Security, ESORICS 2008, LNCS, vol. 5283, pp. 192-206. Springer, Heidelberg. 2008. (Extended version, PDF, BibTeX)\n\nbasics performance protocols\n\n2007\nDan Bogdanov. How to securely perform computations on secret-shared data. Master's thesis. University of Tartu. 2007. (PDF, BibTeX)\n\nthesis basics performance protocols\n\n\nThis project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 778615\n\nCybernetica\nSharemind is a trademark of\nCybernetica. All materials\nCopyright Cybernetica AS\nTallinn, Estonia\nsharemind@cyber.ee\nWe are using cookies for delivering a better service. By continuing on the site you are agreeing to the use of cookies. Read our Privacy Policy and Cookie Policy.\n\n\n@inproceedings{SAS-106:BP14,\n  author = {Dan Bogdanov and Pille Pruulmann-Vengerfeldt},\n  title = {Adoption Barriers of Secure Computation for Decision Making in a Defence Application},\n  booktitle = {STO-MP-SAS-106 - Analysis Support to Decision Making in Cyber Defence and Security},\n  year= {2014},\n  location = {Tallinn, Estonia},\n  publisher = {NATO STO}\n}",{"title":2545,"type":228,"excerpt":2546,"year":282,"authors":2547,"tags":2552,"pdfFile":10,"pdfUrl":2553,"extendedUrl":10,"bibTeX":2554},"Bounded Pre-Image Awareness and the Security of Hash-Tree Keyless Signatures","In: Provable Security, 8th International Conference: ProvSec 2014, Hong Kong, 09.10-10.10.2014. Springer, 2014, (Lecture Notes in Computer Science; 8782), 130 – 145.",[2548,2549,2550,2551],{"author":845},{"author":2004},{"author":2006},{"author":1856},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-12475-9_10",{"tag":10,"width":10,"height":10,"text":2555},"@InProceedings{10.1007\u002F978-3-319-12475-9_10,\nauthor=\"Buldas, Ahto\nand Laanoja, Risto\nand Laud, Peeter\nand Truu, Ahto\",\neditor=\"Chow, Sherman S. M.\nand Liu, Joseph K.\nand Hui, Lucas C. K.\nand Yiu, Siu Ming\",\ntitle=\"Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures\",\nbooktitle=\"Provable Security\",\nyear=\"2014\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"130--145\",\nabstract=\"We present a new tighter security proof for unbounded hash tree keyless signature (time-stamping) schemes that use Merkle-Damg{\\aa}rd (MD) hash functions with Preimage Aware (PrA) compression functions. It is known that the PrA assumption alone is insufficient for proving the security of unbounded hash tree schemes against back-dating attacks. We show that many known PrA constructions satisfy a stronger Bounded Pre-Image Awareness (BPrA) condition that assumes the existence of an extractor {\\$}{\\backslash}mathcal{\\{}E{\\}}{\\$}that is bounded in the sense that for any efficiently computable query string $\\alpha$, the number of outputs y for which {\\$}{\\backslash}mathcal{\\{}E{\\}}(y,{\\backslash}alpha){\\$}succeeds does not exceed the number of queries in $\\alpha$. We show that blockcipher based MD-hash functions with rate-1 compression functions (such as Davies-Meyer and Miyaguchi-Preneel) of both type I and type II are BPrA. We also show that the compression function of Shrimpton-Stam that uses non-compressing components is BPrA. The security proof for unbounded hash-tree schemes is very tight under the BPrA assumption. In order to have 2s-security against back-dating, the hash function must have n{\\thinspace}={\\thinspace}2s{\\thinspace}+{\\thinspace}4 output bits, assuming that the security of the hash function is close to the birthday barrier, i.e. that there are no structural weaknesses in the hash function itself. Note that the previous proofs that assume PrA gave the estimation n{\\thinspace}={\\thinspace}2s{\\thinspace}+{\\thinspace}2 log2C{\\thinspace}+{\\thinspace}2, where C is the maximum allowed size of the hash tree. For example, if s{\\thinspace}={\\thinspace}100 (2100-security) and C{\\thinspace}={\\thinspace}260, the previous proofs require n{\\thinspace}={\\thinspace}322 output bits, while the new proof requires n{\\thinspace}={\\thinspace}204 output bits.\",\nisbn=\"978-3-319-12475-9\"\n}\n\n",{"title":2557,"type":228,"excerpt":2558,"year":282,"authors":2559,"tags":2563,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Private intersection of regular languages","In: Privacy, Security and Trust (PST), 2014 Twelfth Annual International Conference on: Twelfth Annual International Conference on Privacy, Security and Trust (PST), Toronto, Canada, 23.-24.07.2014. IEEE, 2014, 112 – 120.",[2560,2561,2562],{"author":2407},{"author":2404},{"author":1856},[],{"title":2565,"type":228,"excerpt":2566,"year":282,"authors":2567,"tags":2570,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Modeling Threats of a Voting Method","Chapter 7 of Dimitrios Zissis and Dimitrios Lekkas (editors) Design, Development, and Use of Secure Electronic Voting Systems. IGI Global, 2014, pages 128-148.",[2568,2569],{"author":984},{"author":141},[],{"title":2572,"type":228,"excerpt":2573,"year":282,"authors":2574,"tags":2577,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Verifiable Internet Voting in Estonia","In: Krimmer, R., Volkamer, M.: Proceedings of Electronic Voting 2014 (EVOTE2014), TUT Press, Tallinn, p. 23-29.",[2575,2576],{"author":984},{"author":141},[],{"title":2422,"type":228,"excerpt":2579,"year":282,"authors":2580,"tags":2583,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"International Journal of Information Security. 2014.",[2581,2582],{"author":234},{"author":141},[],{"title":2585,"type":228,"excerpt":2586,"year":282,"authors":2587,"tags":2590,"pdfFile":10,"pdfUrl":2591,"extendedUrl":10,"bibTeX":2592},"Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations","In Proceedings of ISC 2014, LNCS 8783, pp. 179-197, Springer 2014.",[2588,2589],{"author":19},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-13257-0_11",{"tag":10,"width":10,"height":10,"text":2593},"@InProceedings{10.1007\u002F978-3-319-13257-0_11,\nauthor=\"Krips, Toomas\nand Willemson, Jan\",\neditor=\"Chow, Sherman S. M.\nand Camenisch, Jan\nand Hui, Lucas C. K.\nand Yiu, Siu Ming\",\ntitle=\"Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations\",\nbooktitle=\"Information Security\",\nyear=\"2014\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"179--197\",\nabstract=\"This paper develops a new hybrid model of floating point numbers suitable for operations in secure multi-party computations. The basic idea is to consider the significand of the floating point number as a fixed point number and implement elementary function applications separately of the significand. This gives the greatest performance gain for the power functions (e.g. inverse and square root), with computation speeds improving up to 18 times in certain configurations. Also other functions (like exponent and Gaussian error function) allow for the corresponding optimisation.\",\nisbn=\"978-3-319-13257-0\"\n}\n",{"title":2595,"type":228,"excerpt":2596,"year":282,"authors":2597,"tags":2599,"pdfFile":10,"pdfUrl":2600,"extendedUrl":10,"bibTeX":2601},"A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation","In: Hui, L., Qing, S., Shi, E., Yiu, S. (eds) Information and Communications Security. ICICS 2014. Lecture Notes in Computer Science(), vol 8958. Springer, Cham.",[2598],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-21966-0_11",{"tag":10,"width":10,"height":10,"text":2602},"@InProceedings{10.1007\u002F978-3-319-21966-0_11,\nauthor=\"Laud, Peeter\",\neditor=\"Hui, Lucas C. K.\nand Qing, S. H.\nand Shi, Elaine\nand Yiu, S. M.\",\ntitle=\"A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation\",\nbooktitle=\"Information and Communications Security\",\nyear=\"2015\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"143--157\",\nabstract=\"We present a secure multiparty computation (SMC) protocol for obliviously reading an element of an array, achieving constant online communication complexity. While the total complexity of the protocol is linear in the size of the array, the bulk of it is pushed into the offline precomputation phase, which is independent of the array and the index of the element.\",\nisbn=\"978-3-319-21966-0\"\n}\n",{"title":2604,"type":228,"excerpt":2605,"year":282,"authors":2606,"tags":2609,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Verifiable Computation in Multiparty Protocols with Honest Majority","In: 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, 2014, (Lecture Notes in Computer Science; 8782), 146 – 161.",[2607,2608],{"author":219},{"author":2074},[],{"title":2611,"type":228,"excerpt":2612,"year":282,"authors":2613,"tags":2616,"pdfFile":10,"pdfUrl":2617,"extendedUrl":10,"bibTeX":2618},"Limiting adversarial budget in quantitative security assessment","In Decision and Game Theory for Security – 5th International Conference, GameSec 2014,Los Angeles, CA, USA, November 6-7, 2014. Proceedings, pages 153–172, 2014.",[2614,2615],{"author":1702},{"author":845},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-12601-2_9",{"tag":10,"width":10,"height":10,"text":2619},"@InProceedings{10.1007\u002F978-3-319-12601-2_9,\nauthor=\"Lenin, Aleksandr\nand Buldas, Ahto\",\neditor=\"Poovendran, Radha\nand Saad, Walid\",\ntitle=\"Limiting Adversarial Budget in Quantitative Security Assessment\",\nbooktitle=\"Decision and Game Theory for Security\",\nyear=\"2014\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"155--174\",\nabstract=\"We present the results of research of limiting adversarial budget in attack games, and, in particular, in the failure-free attack tree models presented by Buldas-Stepanenko in 2012 and improved in 2013 by Buldas and Lenin. In the previously presented models attacker's budget was assumed to be unlimited. It is natural to assume that the adversarial budget is limited and such an assumption would allow us to model the adversarial decision making more close to the one that might happen in real life. We analyze three atomic cases -- the single atomic case, the atomic AND, and the atomic OR. Even these elementary cases become quite complex, at the same time, limiting adversarial budget does not seem to provide any better or more precise results compared to the failure-free models. For the limited model analysis results to be reliable, it is required that the adversarial reward is estimated with high precision, probably not achievable by providing expert estimations for the quantitative annotations on the attack steps, such as the cost or the success probability. It is doubtful that it is reasonable to face this complexity, as the failure-free model provides reliable upper bounds, being at the same time computationally less complex.\",\nisbn=\"978-3-319-12601-2\"\n}",{"title":2621,"type":228,"excerpt":2622,"year":282,"authors":2623,"tags":2628,"pdfFile":10,"pdfUrl":2629,"extendedUrl":10,"bibTeX":2630},"Attacker profiling in quantitative security assessment based on attack trees","In Karin Bernsmed and Simone Fischer-Hübner, editors, Secure IT Systems, 19th Nordic Conference, NordSec 2014, LNCS 8988, pp. 199-212, Springer 2014.",[2624,2625,2626],{"author":1702},{"author":141},{"author":2627},"Sari, D.P.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-11599-3_12",{"tag":10,"width":10,"height":10,"text":2631},"@InProceedings{10.1007\u002F978-3-319-11599-3_12,\nauthor=\"Lenin, Aleksandr\nand Willemson, Jan\nand Sari, Dyan Permata\",\neditor=\"Bernsmed, Karin\nand Fischer-H{\\\"u}bner, Simone\",\ntitle=\"Attacker Profiling in Quantitative Security Assessment Based on Attack Trees\",\nbooktitle=\"Secure IT Systems\",\nyear=\"2014\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"199--212\",\nabstract=\"Providing meaningful estimations for the quantitative annotations on the steps of complex multi-step attacks is hard, as they are jointly influenced by the infrastructure and attacker properties. The paper introduces attacker profiling as the concept of separation of the infrastructure properties from the properties of malicious agents undertaking strategic decisions in the considered environment. We show that attacker profiling may be integrated into existing quantitative security assessment tools without any significant performance penalty. As an example of such integration we introduce the new analysis tool named ApproxTree+ which is an extension of the existing ApproxTree tool, enhancing it by incorporating attacker profiling capabilities into it.\",\nisbn=\"978-3-319-11599-3\"\n}\n",{"title":2633,"type":228,"excerpt":2634,"year":282,"authors":2635,"tags":2643,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"TREsPASS: Plug-and-Play Attacker Profiles for Security Risk Analysis (poster and extended abstract)","Proceedings of the 35th IEEE Symposium on Security and Privacy, San Jose, CA, 2014.",[2636,2637,2639,2640,2642],{"author":2320},{"author":2638},"Hadžiosmanovich, D.",{"author":1702},{"author":2641},"Montoya, L.",{"author":141},[],{"title":2645,"type":228,"excerpt":2646,"year":80,"authors":2647,"tags":2652,"pdfFile":10,"pdfUrl":2653,"extendedUrl":10,"bibTeX":2654},"High-Performance Qualified Digital Signatures for X-Road","In Hanne Riis Nielson and Dieter Gollmann, editors, Secure IT Systems. 18th Nordic Conference, NordSec 2013, LNCS 8208, pp. 123-138, Springer 2013.",[2648,2649,2650,2651],{"author":981},{"author":845},{"author":879},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-41488-6_9",{"tag":10,"width":10,"height":10,"text":2655},"@InProceedings{10.1007\u002F978-3-642-41488-6_9,\nauthor=\"Ansper, Arne\nand Buldas, Ahto\nand Freudenthal, Margus\nand Willemson, Jan\",\neditor=\"Riis Nielson, Hanne\nand Gollmann, Dieter\",\ntitle=\"High-Performance Qualified Digital Signatures for X-Road\",\nbooktitle=\"Secure IT Systems\",\nyear=\"2013\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"123--138\",\nabstract=\"In Estonia, the X-Road infrastructure for unified governmental database access has been in use for more than 10 years. The number of queries mediated over the X-Road has exceeded 240 million per year. Even though all the queries and replies are signed by using the X-Road's own PKI facilities, the resulting signatures are not fully qualified in the sense of the Estonian Digital Signatures Act that requires the use of hardware-protected keys. In order to replace software-protected keys in the X-Road infrastructure with a moderate-cost hardware solution, there are several technical issues to be solved, most notably performance requirements, since the operations needed to achieve qualified signatures (obtaining OCSP responses and time stamps) require time. The topic of this paper is to propose organisational and technical solutions to overcome these challenges. A novel batch signature and time stamp format is proposed allowing to perform many PKI operations at the price of one, helping to meet the performance requirements.\",\nisbn=\"978-3-642-41488-6\"\n}",{"title":2657,"type":228,"excerpt":2658,"year":80,"authors":2659,"tags":2664,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Protecting a Federated Database Infrastructure Against Denial-of-Service Attacks","CRITIS 2013, LNCS 8328, pp 26-37, Springer 2013.",[2660,2661,2662,2663],{"author":981},{"author":845},{"author":879},{"author":141},[],{"title":2666,"type":228,"excerpt":10,"year":80,"authors":2667,"tags":2672,"pdfFile":2673,"pdfUrl":2674,"extendedUrl":10,"bibTeX":10}," Digitaalallkirjade jätkusuutlikkuse analüüs.",[2668,2669,2670,2671],{"author":981},{"author":845},{"author":984},{"author":1766},[],{"url":994},"https:\u002F\u002Fcyber.ee\u002Fuploads\u002FDigital_signatures_strat_plan_2001_copy_d95f904edd.pdf",{"title":2676,"type":228,"excerpt":2677,"year":80,"authors":2678,"tags":2682,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Pushing Back the Rain—How to Create Trustworthy Services in the Cloud","ISACA Journal, Volume 3, 2013, 49-51. (isaca.org\u002Fjournal)",[2679,2680],{"author":135},{"author":2681},"Kalu, A. ",[],{"title":2684,"type":228,"excerpt":2685,"year":80,"authors":2686,"tags":2689,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size","Proceedings of the 18th Australasian Conference, ACIP 2013, LNCS 7959, pp 235-250. Springer 2013.",[2687,2688],{"author":845},{"author":2004},[],{"title":2691,"type":228,"excerpt":2692,"year":80,"authors":2693,"tags":2696,"pdfFile":10,"pdfUrl":2697,"extendedUrl":10,"bibTeX":2698},"New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees","M. Kantarcioglu, C. Nita-Rotaru (Eds.), GameSec 2013.",[2694,2695],{"author":845},{"author":1702},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-02786-9_12",{"tag":10,"width":10,"height":10,"text":2699},"@InProceedings{10.1007\u002F978-3-319-02786-9_12,\nauthor=\"Buldas, Ahto\nand Lenin, Aleksandr\",\neditor=\"Das, Sajal K.\nand Nita-Rotaru, Cristina\nand Kantarcioglu, Murat\",\ntitle=\"New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees\",\nbooktitle=\"Decision and Game Theory for Security\",\nyear=\"2013\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"192--205\",\nabstract=\"We present a new fully adaptive computational model for attack trees that allows attackers to repeat atomic attacks if they fail and to play on if they are caught and have to pay penalties. The new model allows safer conclusions about the security of real-life systems and is somewhat (computationally) easier to analyze. We show that in the new model optimal strategies always exist and finding the optimal strategy is (just) an np-complete problem. We also present methods to compute adversarial utility estimation and utility upper bound approximated estimation using a bottom-up approach.\",\nisbn=\"978-3-319-02786-9\"\n}\n\n",{"title":2701,"type":228,"excerpt":2702,"year":80,"authors":2703,"tags":2707,"pdfFile":10,"pdfUrl":2708,"extendedUrl":10,"bibTeX":2709},"Black-Box Separations and Their Adaptability to the Non-uniform Model","Proceedings of the 18th Australasian Conference, ACIP 2013, LNCS 7959, pp 152-167. Springer 2013.",[2704,2705],{"author":845},{"author":2706},"Niitsoo, M. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-39059-3_11",{"tag":10,"width":10,"height":10,"text":2710},"@InProceedings{10.1007\u002F978-3-642-39059-3_11,\nauthor=\"Buldas, Ahto\nand Niitsoo, Margus\",\neditor=\"Boyd, Colin\nand Simpson, Leonie\",\ntitle=\"Black-Box Separations and Their Adaptability to the Non-uniform Model\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2013\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"152--167\",\nabstract=\"Oracle separation methods are used in cryptography to rule out black-box reductions between cryptographic primitives. It is sufficient to find an oracle relative to which the base primitive exists but there are no secure instances of the constructed primitive. It is often beyond our current reach to construct a fixed oracle with such properties because it is difficult to prove the existence of secure base primitives. To overcome this gap, randomized oracles are used to create random base primitives that are secure on average. After that, a fixed oracle is extracted from the probability distribution by using non-constructive probabilistic arguments and the countability of the set of adversaries. Such extraction only applies to uniform reductions because the set of non-uniform adversaries is not countable. We study how to adapt oracle separation results to the non-uniform model. The known separation techniques are capable of ruling out the so-called fully black-box reductions and a certain strong form of semi black-box reductions also in the non-uniform model. We study how to go beyond the barrier of strong semi black-box reductions and show that this is possible by using random oracles with auxiliary advice. For that end, we prove a conjecture of Unruh (2007) about pre-sampling being a sufficient substitute for advice for any oracle distribution.\",\nisbn=\"978-3-642-39059-3\"\n}\n",{"title":2712,"type":228,"excerpt":2713,"year":80,"authors":2714,"tags":2716,"pdfFile":10,"pdfUrl":2717,"extendedUrl":10,"bibTeX":2718},"New Technologies for Democratic Elections"," Business Process Management Workshops. Lecture Notes in Business Information Processing Volume 132, 2013, pp 630-635. Springer 2013.",[2715],{"author":984},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-36285-9_63",{"tag":10,"width":10,"height":10,"text":2719},"@InProceedings{10.1007\u002F978-3-642-36285-9_63,\nauthor=\"Heiberg, Sven\",\neditor=\"La Rosa, Marcello\nand Soffer, Pnina\",\ntitle=\"New Technologies for Democratic Elections\",\nbooktitle=\"Business Process Management Workshops\",\nyear=\"2013\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"630--635\",\nabstract=\"Estonia has implemented a specific form of electronic voting -- internet voting -- as a method to participate in various types of legally binding elections since 2005. The mitigation of security risks in the method has lead to changes in the voting procedures. Those changes might affect the way we think about traditional voting.\",\nisbn=\"978-3-642-36285-9\"\n}\n\n",{"title":2721,"type":228,"excerpt":2722,"year":80,"authors":2723,"tags":2729,"pdfFile":10,"pdfUrl":2730,"extendedUrl":10,"bibTeX":2731},"A new way to protect privacy in large-scale genome-wide association studies","Bioinformatics, Volume 29, Issue 7, April 2013, Pages 886–893.",[2724,2725,2726,2727],{"author":234},{"author":135},{"author":236},{"author":2728}," Vilo, J.",[],"https:\u002F\u002Fdoi.org\u002F10.1093\u002Fbioinformatics\u002Fbtt066",{"tag":10,"width":10,"height":10,"text":2732},"@article{10.1093\u002Fbioinformatics\u002Fbtt066,\n    author = {Kamm, Liina and Bogdanov, Dan and Laur, Sven and Vilo, Jaak},\n    title = \"{A new way to protect privacy in large-scale genome-wide association studies}\",\n    journal = {Bioinformatics},\n    volume = {29},\n    number = {7},\n    pages = {886-893},\n    year = {2013},\n    month = {02},\n    abstract = \"{Motivation: Increased availability of various genotyping techniques has initiated a race for finding genetic markers that can be used in diagnostics and personalized medicine. Although many genetic risk factors are known, key causes of common diseases with complex heritage patterns are still unknown. Identification of such complex traits requires a targeted study over a large collection of data. Ideally, such studies bring together data from many biobanks. However, data aggregation on such a large scale raises many privacy issues.Results: We show how to conduct such studies without violating privacy of individual donors and without leaking the data to third parties. The presented solution has provable security guarantees.Contact:  jaak.vilo@ut.eeSupplementary information:  Supplementary data are available at Bioinformatics online.}\",\n    issn = {1367-4803},\n    doi = {10.1093\u002Fbioinformatics\u002Fbtt066},\n    url = {https:\u002F\u002Fdoi.org\u002F10.1093\u002Fbioinformatics\u002Fbtt066},\n    eprint = {https:\u002F\u002Facademic.oup.com\u002Fbioinformatics\u002Farticle-pdf\u002F29\u002F7\u002F886\u002F49060856\u002Fbioinformatics\\_29\\_7\\_886.pdf},\n}\n",{"title":2734,"type":228,"excerpt":2735,"year":80,"authors":2736,"tags":2739,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"On the (Im)possibility of Privately Outsourcing Linear","In proceedings of the 2013 ACM Cloud Computing Security Workshop (CCSW), November 8th, 2013, Berlin, Germany",[2737,2738],{"author":219},{"author":355},[],{"title":2741,"type":228,"excerpt":2742,"year":80,"authors":2743,"tags":2749,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Specifying Sharemind’s Arithmetic Black Box","PETShop: The Workshop on Language Support for Privacy Enhancing Technologies, Berlin, Germany, November 4th, 2013. Association for Computing Machinery (ACM) , 2013, 19 – 21.",[2744,2745,2746,2747],{"author":219},{"author":355},{"author":217},{"author":2748}," Randmets, J.",[],{"title":2751,"type":228,"excerpt":2752,"year":80,"authors":2753,"tags":2756,"pdfFile":10,"pdfUrl":2757,"extendedUrl":10,"bibTeX":2758},"Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus","18th Nordic Conference on Secure IT Systems (Nordsec 2013), Ilulissat, Greenland, October 18-21, 2013. (Toim.) Gollmann, Dieter; Nielson, Hanne Riis. Springer, 2013, (Lecture Notes in Computer Science; 8208), 100 – 115.",[2754,2755],{"author":217},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-41488-6_7",{"tag":10,"width":10,"height":10,"text":2759},"@InProceedings{10.1007\u002F978-3-642-41488-6_7,\nauthor=\"Pettai, Martin\nand Laud, Peeter\",\neditor=\"Riis Nielson, Hanne\nand Gollmann, Dieter\",\ntitle=\"Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus\",\nbooktitle=\"Secure IT Systems\",\nyear=\"2013\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"100--115\",\nabstract=\"We show how a type system for secure information flow for a $\\pi$-calculus with higher-order $\\lambda$-abstractions can be extended with dynamics without weakening the non-interference guarantees. The type system for the $\\pi$-calculus ensures that the traffic on high channels does not influence the traffic on low channels. $\\lambda$-abstractions make it possible to send processes over channels. Dynamics make it possible to send processes and other data of different types over the same channel, making communication between processes easier. If dynamics are used, the types of some expressions or channels may depend on type variables that are instantiated at run time. To make it still possible to statically check secure information flow, we ensure that instantiating a type variable in an expression also instantiates it in the type of the expression.\",\nisbn=\"978-3-642-41488-6\"\n}",{"title":2502,"type":228,"excerpt":2761,"year":80,"authors":2762,"tags":2764,"pdfFile":10,"pdfUrl":2508,"extendedUrl":10,"bibTeX":2765},"Uuring Riigi Infosüsteemi Ametile 2013.",[2763],{"author":2506},[],{"tag":10,"width":10,"height":10,"text":2766},"@techreport{CYBER:R2013,\n  author      = \"Cybernetica researchers\",\n  title       = \"Krüptograafiliste algoritmide elutsükli uuring\",\n  institution = \"Cybernetica AS\",\n  year        = \"2013\",\n number = \"\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":2768,"type":228,"excerpt":2769,"year":63,"authors":2770,"tags":2775,"pdfFile":10,"pdfUrl":2776,"extendedUrl":10,"bibTeX":2777},"A universal toolkit for cryptographically secure privacy-preserving data mining","In: Chau, M., Wang, G.A., Yue, W.T., Chen, H. (eds) Intelligence and Security Informatics. PAISI 2012. Lecture Notes in Computer Science, vol 7299. Springer, Berlin, Heidelberg.",[2771,2772,2773],{"author":135},{"author":261},{"author":2774}," Laur, S.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-30428-6_9",{"tag":10,"width":10,"height":10,"text":2778},"@InProceedings{10.1007\u002F978-3-642-30428-6_9,\nauthor=\"Bogdanov, Dan\nand Jagom{\\\"a}gis, Roman\nand Laur, Sven\",\neditor=\"Chau, Michael\nand Wang, G. Alan\nand Yue, Wei Thoo\nand Chen, Hsinchun\",\ntitle=\"A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining\",\nbooktitle=\"Intelligence and Security Informatics\",\nyear=\"2012\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"112--126\",\nabstract=\"The issue of potential data misuse rises whenever it is collected from several sources. In a common setting, a large database is either horizontally or vertically partitioned between multiple entities who want to find global trends from the data. Such tasks can be solved with secure multi-party computation (MPC) techniques. However, practitioners tend to consider such solutions inefficient. Furthermore, there are no established tools for applying secure multi-party computation in real-world applications. In this paper, we describe Sharemind---a toolkit, which allows data mining specialist with no cryptographic expertise to develop data mining algorithms with good security guarantees. We list the building blocks needed to deploy a privacy-preserving data mining application and explain the design decisions that make Sharemind applications efficient in practice. To validate the practical feasibility of our approach, we implemented and benchmarked four algorithms for frequent itemset mining.\",\nisbn=\"978-3-642-30428-6\"\n}\n",{"title":2780,"type":228,"excerpt":2781,"year":63,"authors":2782,"tags":2789,"pdfFile":10,"pdfUrl":2790,"extendedUrl":10,"bibTeX":2791},"High-performance secure multi-party computation for data mining applications","In International Journal of Information Security, Springer, 2012, DOI: 10.1007\u002Fs10207-012-0177-2.",[2783,2784,2786,2787],{"author":135},{"author":2785}," Niitsoo, M.",{"author":139},{"author":2788}," Willemson, J.",[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002Fs10207-012-0177-2",{"tag":10,"width":10,"height":10,"text":2792},"@article {IJIS12:Bogdanov12,\n   author = {Dan Bogdanov and Margus Niitsoo and Tomas Toft and Jan Willemson},\n   title = {High-performance secure multi-party computation for data mining applications},\n   journal = {International Journal of Information Security},\n   publisher = {Springer},\n   issn = {1615-5262},\n   pages = {403-418},\n   volume = {11},\n   number = {6},\n   year = {2012},\n   url = {http:\u002F\u002Fdx.doi.org\u002F10.1007\u002Fs10207-012-0177-2}\n}",{"title":2794,"type":228,"excerpt":2795,"year":63,"authors":2796,"tags":2800,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Upper Bounds for Adversaries’ Utility in Attack Trees","Proceedings of the Third International Conference, Gamesec 2012. LNCS 7638, pp 98-117. Springer 2012.",[2797,2798],{"author":845},{"author":2799},"Stepanenko, R. ",[],{"title":2802,"type":228,"excerpt":2803,"year":63,"authors":2804,"tags":2808,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Profiling in Deeply Embedded Systems","In: Proceedings of the 13th Biennial Baltic Electronic Conference: 2012 13th Biennial Baltic Electronics Conference (BEC2012), Tallinn, Estonia, October 3-5, 2012. IEEE, 2012, 127 – 130.",[2805,2806],{"author":1078},{"author":2807},"Jervan, G. ",[],{"title":2810,"type":228,"excerpt":2811,"year":63,"authors":2812,"tags":2817,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":2818},"Buoy Collision Detection"," In: Proceedings ELMAR-2012: 54th International Symposium ELMAR-2012, 12-14 September 2012, Zadar, Croatia. (Toim.) Jelena Bozek, Mislav Grgic. Zagreb, Coratia: Croatian Society Electronics in Marine, 2012, 109 – 112.",[2813,2815],{"author":2814},"Moorits, E. ",{"author":2816},"Usk, A.",[],{"tag":10,"width":10,"height":10,"text":2819},"@INPROCEEDINGS{6338483,\n  author={Moorits, Erkki and Usk, Aivar},\n  booktitle={Proceedings ELMAR-2012}, \n  title={Buoy collision detection}, \n  year={2012},\n  volume={},\n  number={},\n  pages={109-112},\n  doi={}}",{"title":2821,"type":228,"excerpt":2822,"year":63,"authors":2823,"tags":2826,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Securing the Future — an Information Flow Analysis of a Distributed OO Language","In: Proceedings: SOFSEM 2012: 38th International Conference on Current Trends in Theory and Practice of Computer Science,Špindlerův Mlýn, Czech Rep., January 21-27, 2012. (Toim.) Gottlob, Georg; Turán, György; Bieliková, Mária; Katzenbeisser, Stefan; Friedrich, Gerhard. Springer, 2012, (Lecture Notes in Computer Science; 7147), 576 – 587.",[2824,2825],{"author":217},{"author":219},[],{"title":2828,"type":228,"excerpt":2829,"year":95,"authors":2830,"tags":2832,"pdfFile":10,"pdfUrl":2833,"extendedUrl":10,"bibTeX":2834},"Designing a Governmental Backbone"," In proceedings of Nordsec 2011, 16th Nordic Conference in Secure IT Systems (LNCS 7161), Tallinn, Estonia, October 26-28, 2011, pp 1-3. Springer-Verlag.\nIn: Laud, P. (eds) Information Security Technology for Applications. NordSec 2011. Lecture Notes in Computer Science, vol 7161. Springer, Berlin, Heidelberg.",[2831],{"author":981},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-29615-4_1",{"tag":10,"width":10,"height":10,"text":2835},"@InProceedings{10.1007\u002F978-3-642-29615-4_1,\nauthor=\"Ansper, Arne\",\neditor=\"Laud, Peeter\",\ntitle=\"Designing a Governmental Backbone\",\nbooktitle=\"Information Security Technology for Applications\",\nyear=\"2012\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"1--3\",\nabstract=\"The presentation is about the design of the backbone of the Estonian governmental information systems - X-Road. The system is already ten years old and has proven to be useful and reliable. The presentation describes the vision of the system, the requirements analysis process and the technical design decisions. The vision was to create a web-services based unified access to all governmental registries. The requirements analysis was guided by the existing legislation and organizational setup of the government. The technical design was pragmatic and based on some unorthodox solutions.\",\nisbn=\"978-3-642-29615-4\"\n}\n",{"title":2837,"type":228,"excerpt":2838,"year":95,"authors":2839,"tags":2842,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Simpl: a Toolkit for Rapid DSL Implementation","12th Symposium on Programming Languages and Software Tools. October 5-7, 2011, Tallinn, Estonia.",[2840,2841],{"author":879},{"author":1232},[],{"title":905,"type":228,"excerpt":2844,"year":95,"authors":2845,"tags":2849,"pdfFile":10,"pdfUrl":2850,"extendedUrl":10,"bibTeX":2851}," In Proceedings of the 2011 ACM Symposium on Applied Computing (SAC 2011).",[2846,2848],{"author":2847},"Gonzalez, M.",{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1982185.1982508",{"tag":10,"width":10,"height":10,"text":2852},"@inproceedings{10.1145\u002F1982185.1982508,\nauthor = {Gonz\\'{a}lez Mu\\~{n}iz, Madeline and Laud, Peeter},\ntitle = {On the (Im)Possibility of Perennial Message Recognition Protocols without Public-Key Cryptography},\nyear = {2011},\nisbn = {9781450301138},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F1982185.1982508},\ndoi = {10.1145\u002F1982185.1982508},\nabstract = {A message recognition protocol (MRP) aims to exchange authenticated information in an insecure channel. During the initialization session of the protocol, the parties exchange some authenticated information which the adversary can passively observe. Then, one party wants to send authenticated messages to the other party over an insecure channel. Such security requirements are often found in wireless sensor networks.A perennial MRP is one that is able to recover from the adversarial interference, no matter how long the adversary has been active before it stops. MRPs based on hash chains are not perennial because after fixing the length of the hash chain in the initialization phase, authentic communication is not possible if the adversary interferes until all elements of the hash chain have been consumed.Perennial MRPs can be trivially built from public-key primitives. In this paper we present very strong evidence that they cannot be constructed from \"cheap\" primitives. Namely, we show in the symbolic model of cryptography, perennial MRPs cannot be built using just hash functions and XORing. The result also covers other symmetric primitives, e.g. encryption. The result explains why all previous attempts to construct perennial MRPs from those primitives have failed. The result also has interesting implications regarding authentication protocols in general, and the gap between formal and computational models of cryptography.},\nbooktitle = {Proceedings of the 2011 ACM Symposium on Applied Computing},\npages = {1510–1515},\nnumpages = {6},\nkeywords = {message recognition, symmetric cryptography, Dolev-Yao model},\nlocation = {TaiChung, Taiwan},\nseries = {SAC '11}\n}",{"title":2854,"type":228,"excerpt":2855,"year":95,"authors":2856,"tags":2860,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security of message authentication codes in the presence of key-dependent messages"," In Designs, Codes and Cryptography, pp. 1-9, Springer Netherlands 2011.",[2857,2858],{"author":2847},{"author":2859},"Steinwandt, R.",[],{"title":2862,"type":228,"excerpt":2863,"year":95,"authors":2864,"tags":2869,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"The Application of I-voting for Estonian Parliamentary Elections of 2011","In: Postproceedings: 3rd international conference on e-voting and identity, Tallinn, Sep 29th-30th, 2011. (Toim.) Kiyaias, Aggelos; Lipmaa, Helger. Springer-Verlag, 2012, (Lecture Notes in Computer Science; 7187).",[2865,2866,2867],{"author":984},{"author":219},{"author":2868}," Villemson, J.",[],{"title":2871,"type":228,"excerpt":2872,"year":95,"authors":2873,"tags":2880,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Secure Mobile Access to Homecare Patients’ Data"," In: Proceedings: 5th International Conference on Theory and Practice of Electronic Governance (ICEGOV2011), Tallinn, Sep 26th-28th, 2011. (Toim.) Estevez, Elsa; Janssen, Marijn. ACM, 2011, 363 – 364.",[2874,2875,2876,2878],{"author":984},{"author":219},{"author":2877},"Masson, S.",{"author":2879},"Larsen, C.P.",[],{"title":2882,"type":228,"excerpt":2883,"year":95,"authors":2884,"tags":2886,"pdfFile":10,"pdfUrl":2887,"extendedUrl":10,"bibTeX":2888},"Implementing Cryptographic Primitives in the Symbolic Model","3rd NASA Formal Methods Symposium, Pasadena, CA, April 18th-20th 2011. (Toim.) Bobaru, Mihaela; Havelund, Klaus; Holzmann, Gerard; Joshi, Rajeev. Springer Verlag, 2011, (Lecture Notes in Computer Science; 6617), 267 – 281.",[2885],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-20398-5_20",{"tag":10,"width":10,"height":10,"text":2889},"@InProceedings{10.1007\u002F978-3-642-20398-5_20,\nauthor=\"Laud, Peeter\",\neditor=\"Bobaru, Mihaela\nand Havelund, Klaus\nand Holzmann, Gerard J.\nand Joshi, Rajeev\",\ntitle=\"Implementing Cryptographic Primitives in the Symbolic Model\",\nbooktitle=\"NASA Formal Methods\",\nyear=\"2011\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"267--281\",\nabstract=\"When discussing protocol properties in the symbolic (Dolev-Yao; term-based) model of cryptography, the set of cryptographic primitives is defined by the constructors of the term algebra and by the equational theory on top of it. The set of considered primitives is not easily modifiable during the discussion. In particular, it is unclear what it means to define a new primitive from the existing ones, or why a primitive in the considered set may be unnecessary because it can be modeled using other primitives. This is in stark contrast to the computational model of cryptography where the constructions and relationships between primitives are at the very foundation of the theory. In this paper, we explore how a primitive may be constructed from other primitives in the symbolic model, such that no protocol breaks if an atomic primitive is replaced by the construction. As an example, we show the construction of (symbolic) ``randomized'' symmetric encryption from (symbolic) one-way functions and exclusive or.\",\nisbn=\"978-3-642-20398-5\"\n}",{"title":2891,"type":228,"excerpt":2892,"year":95,"authors":2893,"tags":2898,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Wave Height Measurement as a Secondary Function of Navigational Buoys","OCEANS ’11 MTS\u002FIEEE KONA, Hilton Waikoloa Village, Kona, Hawai‘i, USA, September 19-22 2011. IEEE, 2011.",[2894,2895,2896],{"author":1078},{"author":2816},{"author":2897},"Kõuts, T.",[],{"title":2900,"type":228,"excerpt":2901,"year":95,"authors":2902,"tags":2908,"pdfFile":10,"pdfUrl":2508,"extendedUrl":10,"bibTeX":2909},"Krüptograafiliste algoritmide kasutusvaldkondade ja elutsükli uuring. ","Uuring Riigi Infosüsteemi Ametile 2011.",[2903,2904,2905,2906],{"author":141},{"author":2018},{"author":1164},{"author":2907},"Laur, M.",[],{"tag":10,"width":10,"height":10,"text":2910},"@techreport{CYBER:R2011,\n  author      = \"Willemson, J. Laud, P. Jürgenson, A. Laur, M.\",\n  title       = \"Krüptograafiliste algoritmide kasutusvaldkondade ja elutsükli uuring. \",\n  institution = \"Cybernetica AS\",\n  year        = \"2011\",\n number = \"\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":2912,"type":228,"excerpt":2913,"year":132,"authors":2914,"tags":2917,"pdfFile":10,"pdfUrl":2918,"extendedUrl":10,"bibTeX":2919},"Optimally tight security proofs for hash-then-publish time-stamping","In: Steinfeld, R., Hawkes, P. (Eds.): ACISP 2010. LNCS 6168, pp.318-335, Springer-Verlag 2010.",[2915,2916],{"author":845},{"author":137},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-14081-5_20",{"tag":10,"width":10,"height":10,"text":2920},"@InProceedings{10.1007\u002F978-3-642-14081-5_20,\nauthor=\"Buldas, Ahto\nand Niitsoo, Margus\",\neditor=\"Steinfeld, Ron\nand Hawkes, Philip\",\ntitle=\"Optimally Tight Security Proofs for Hash-Then-Publish Time-Stamping\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"318--335\",\nabstract=\"We study the security of hash-then-publish time-stamping schemes and concentrate on the tightness of security reductions from the collision-resistance of the underlying hash functions. While the previous security reductions create a quadratic loss in the security in terms of time-success ratio of the adversary being protected against, this paper achieves a notably smaller loss of power 1.5. This is significant for two reasons. Firstly, the reduction is asymptotically optimally tight, as the lower bound of 1.5 on the power was proven recently by the authors in ACISP 2009 and this is the first application for which optimality in this sense can be demonstrated. Secondly, the new reduction is the first one efficient enough to allow meaningful security guarantees to be given for a global-scale time-stamping service based on 256 bit hash functions, which considerably increases the efficiency of possible practical solutions.\",\nisbn=\"978-3-642-14081-5\"\n}",{"title":2922,"type":228,"excerpt":2923,"year":132,"authors":2924,"tags":2931,"pdfFile":10,"pdfUrl":2932,"extendedUrl":10,"bibTeX":2933},"Additive combinatorics and discrete logarithm based range protocols","In: Hawkes, P., Steinfeld, R. (Eds.): ACISP 2010, LNCS 6168, pp. 336-351, Springer-Verlag 2010.",[2925,2927,2929],{"author":2926},"Chaabouni, R",{"author":2928},"Lipmaa, H.",{"author":2930},"Shelat, A.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-14081-5_21",{"tag":10,"width":10,"height":10,"text":2934},"@InProceedings{10.1007\u002F978-3-642-14081-5_21,\nauthor=\"Chaabouni, Rafik\nand Lipmaa, Helger\nand Shelat, Abhi\",\neditor=\"Steinfeld, Ron\nand Hawkes, Philip\",\ntitle=\"Additive Combinatorics and Discrete Logarithm Based Range Protocols\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"336--351\",\nabstract=\"We show how to express an arbitrary integer interval {\\$}{\\backslash}mathcal{\\{}I{\\}} = [0, H]{\\$}as a sumset {\\$}{\\backslash}mathcal{\\{}I{\\}} = {\\backslash}sum{\\_}{\\{}i=1{\\}}^{\\backslash}ell G{\\_}i * [0, u - 1] + [0, H']{\\$}of smaller integer intervals for some small values ℓ, u, and H{\\textasciiacutex}{\\thinspace}\u003C{\\thinspace}u{\\thinspace}−{\\thinspace}1, where b * A{\\thinspace}={\\thinspace}{\\{}ba : a{\\thinspace}∈{\\thinspace}A{\\}} and {\\$}A + B = {\\backslash}{\\{}a + b : a {\\backslash}in A {\\backslash}land b {\\backslash}in B{\\backslash}{\\}}{\\$}. We show how to derive such expression of {\\$}{\\backslash}mathcal{\\{}I{\\}}{\\$}as a sumset for any value of 1{\\thinspace}\u003C{\\thinspace}u{\\thinspace}\u003C{\\thinspace}H, and in particular, how the coefficients Gican be found by using a nontrivial but efficient algorithm. This result may be interesting by itself in the context of additive combinatorics. Given the sumset-representation of {\\$}{\\backslash}mathcal{\\{}I{\\}}{\\$}, we show how to decrease both the communication complexity and the computational complexity of the recent pairing-based range proof of Camenisch, Chaabouni and shelat from ASIACRYPT 2008 by a factor of 2. Our results are important in applications like e-voting where a voting server has to verify thousands of proofs of e-vote correctness per hour. Therefore, our new result in additive combinatorics has direct relevance in practice.\",\nisbn=\"978-3-642-14081-5\"\n}",{"title":2936,"type":228,"excerpt":2937,"year":132,"authors":2938,"tags":2940,"pdfFile":10,"pdfUrl":2941,"extendedUrl":10,"bibTeX":2942},"Domain-Specific Languages in a Customs Information System","IEEE Software, vol. 27, no. 2, pp. 65-71, March-April 2010.",[2939],{"author":879},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FMS.2010.41",{"tag":10,"width":10,"height":10,"text":2943},"@ARTICLE{5420799,\n  author={Freudenthal, Margus},\n  journal={IEEE Software}, \n  title={Domain-Specific Languages in a Customs Information System}, \n  year={2010},\n  volume={27},\n  number={2},\n  pages={65-71},\n  doi={10.1109\u002FMS.2010.41}}\n",{"title":2945,"type":228,"excerpt":2946,"year":132,"authors":2947,"tags":2949,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Using DSLs for Developing Enterprise Systems","Language Descriptions Tools and Applications, Paphos, Cyprus. March 27-28, 2010.",[2948],{"author":879},[],{"title":2951,"type":228,"excerpt":2952,"year":132,"authors":2953,"tags":2956,"pdfFile":10,"pdfUrl":2957,"extendedUrl":10,"bibTeX":2958},"Cryptanalysis of a message recognition protocol by Mashatan and Stinson","In: Lee, D., Hong, S. (Eds.): ICISC 2009, LNCS 5984, pp. 362-373, Springer-Verlag 2010.",[2954,2955],{"author":2847},{"author":2859},[],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.5555\u002F1883749.1883782",{"tag":10,"width":10,"height":10,"text":2959},"@inproceedings{10.5555\u002F1883749.1883782,\nauthor = {Mu\\~{n}iz, Madeline Gonz\\'{a}lez and Steinwandt, Rainer},\ntitle = {Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson},\nyear = {2009},\nisbn = {3642144225},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nabstract = {At CANS 2008, Mashatan and Stinson suggested a message recognition protocol for ad hoc pervasive networks. The protocol provides a procedure to resynchronize in case of a (possibly adversarial) disruption of communication. We show that this resynchronization process does not provide the functionality intended and in fact enables an adversary to create selective forgeries. The computational effort for the attack is negligible and allows the insertion of arbitrary messages.},\nbooktitle = {Proceedings of the 12th International Conference on Information Security and Cryptology},\npages = {362–373},\nnumpages = {12},\nkeywords = {message recognition, ad hoc network, cryptanalysis},\nlocation = {Seoul, Korea},\nseries = {ICISC'09}\n}",{"title":2961,"type":228,"excerpt":2962,"year":132,"authors":2963,"tags":2968,"pdfFile":10,"pdfUrl":2969,"extendedUrl":10,"bibTeX":2970},"Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate","In Phong Q. Nguyen and David Pointcheval, editors, PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 107–123, Paris, France, May 26–28, 2010. Springer-Verlag.",[2964,2966,2967],{"author":2965},"Groth, J.",{"author":2092},{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-13013-7_7",{"tag":10,"width":10,"height":10,"text":2971},"@InProceedings{10.1007\u002F978-3-642-13013-7_7,\nauthor=\"Groth, Jens\nand Kiayias, Aggelos\nand Lipmaa, Helger\",\neditor=\"Nguyen, Phong Q.\nand Pointcheval, David\",\ntitle=\"Multi-query Computationally-Private Information Retrieval with Constant Communication Rate\",\nbooktitle=\"Public Key Cryptography -- PKC 2010\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"107--123\",\nabstract=\"A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains oblivious to the index of the record retrieved while the overall communication between the two parties is smaller than the database size. This problem has been extensively studied and is known as computationally private information retrieval (CPIR). In this work we consider a natural extension of this problem: a multi-query CPIR protocol allows a client to extract m records of a database containing n ℓ-bit records. We give an information-theoretic lower bound on the communication of any multi-query information retrieval protocol. We then design an efficient non-trivial multi-query CPIR protocol that matches this lower bound. This means we settle the multi-query CPIR problem optimally up to a constant factor.\",\nisbn=\"978-3-642-13013-7\"\n}\n",{"title":2973,"type":228,"excerpt":2974,"year":132,"authors":2975,"tags":2977,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Internet Voting – the Estonian Experience","In: Information Security Summit, From Technology to Management: Information Security Summit, 11th International Conference, Prague, 26.03 – 27.03 2010. Praha: Tate International, S.R.O., 2010, 133 – 138.",[2976],{"author":984},[],{"title":2979,"type":228,"excerpt":2980,"year":132,"authors":2981,"tags":2986,"pdfFile":10,"pdfUrl":2987,"extendedUrl":10,"bibTeX":2988},"On e-vote integrity in the case of malicious voter computers","In: Gritzalis, D., Preneel, B., Theoharidou, M. (Eds.): ESORICS 2010, LNCS 6345, pp. 373-388, Springer-Verlag 2010.",[2982,2983,2984],{"author":984},{"author":2928},{"author":2985},"van Laenen, F. ",[],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.5555\u002F1888881.1888911",{"tag":10,"width":10,"height":10,"text":2989},"@inproceedings{10.5555\u002F1888881.1888911,\nauthor = {Heiberg, Sven and Lipmaa, Helger and Van Laenen, Filip},\ntitle = {On E-Vote Integrity in the Case of Malicious Voter Computers},\nyear = {2010},\nisbn = {3642154964},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nabstract = {Norway has started to implement e-voting (over the Internet, and by using voters' own computers) within the next few years. The vulnerability of voter's computers was identified as a serious threat to e-voting. In this paper, we study the vote integrity of e-voting when the voter computers cannot be trusted. First, we make a number of assumptions about the available infrastructure. In particular, we assume the existence of two out-of-band channels that do not depend on the voter computers. The first channel is used to transmit integrity check codes to the voters prior the election, and the second channel is used to transmit a check code, that corresponds to her vote, back to a voter just after his or her e-vote vast cast. For this we also introduce a new cryptographic protocol.We present the new protocol with enough details to facilitate an implementation, and also present the timings of an actual implementation.},\nbooktitle = {Proceedings of the 15th European Conference on Research in Computer Security},\npages = {373–388},\nnumpages = {16},\nkeywords = {integrity, zero-knowledge proofs, implementation, nationwide e-voting, malicious voter computers, proxy oblivious transfer},\nlocation = {Athens, Greece},\nseries = {ESORICS'10}\n}",{"title":2991,"type":228,"excerpt":2992,"year":132,"authors":2993,"tags":2996,"pdfFile":10,"pdfUrl":2997,"extendedUrl":10,"bibTeX":2998},"On fast and approximate attack tree computations","In: Kwak, J. et al. (Eds.): ISPEC 2010, LNCS 6047, pp. 56-66, Springer-Verlag 2010.",[2994,2995],{"author":1164},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-12827-1_5",{"tag":10,"width":10,"height":10,"text":2999},"@InProceedings{10.1007\u002F978-3-642-12827-1_5,\nauthor=\"J{\\\"u}rgenson, Aivo\nand Willemson, Jan\",\neditor=\"Kwak, Jin\nand Deng, Robert H.\nand Won, Yoojae\nand Wang, Guilin\",\ntitle=\"On Fast and Approximate Attack Tree Computations\",\nbooktitle=\"Information Security, Practice and Experience\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"56--66\",\nabstract=\"In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algorithm for fast approximate computations. Our experiments show that for attack trees having less than 30 leaves, the confidence level of 89{\\%} can be achieved within 2 seconds using this algorithm. The approximation scales very well and attack trees of practical size (up to 100 leaves) can be analyzed within a few minutes.\",\nisbn=\"978-3-642-12827-1\"\n}\n",{"title":3001,"type":228,"excerpt":3002,"year":132,"authors":3003,"tags":3007,"pdfFile":10,"pdfUrl":3008,"extendedUrl":10,"bibTeX":3009},"Two new efficient PIR-writing protocols","In: Zhou, J., Yung, M. (eds) Applied Cryptography and Network Security. ACNS 2010. Lecture Notes in Computer Science, vol 6123. Springer, Berlin, Heidelberg.",[3004,3005],{"author":2928},{"author":3006},"Zhang, B. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-13708-2_26",{"tag":10,"width":10,"height":10,"text":3010},"@InProceedings{10.1007\u002F978-3-642-13708-2_26,\nauthor=\"Lipmaa, Helger\nand Zhang, Bingsheng\",\neditor=\"Zhou, Jianying\nand Yung, Moti\",\ntitle=\"Two New Efficient PIR-Writing Protocols\",\nbooktitle=\"Applied Cryptography and Network Security\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"438--455\",\nabstract=\"Assume that a client outsources his database to a remote storage-provider (the server), so that for privacy reasons, the client's database is encrypted by his secret key. During a PIR-writing protocol, the client updates one element of the encrypted database without revealing to the semi-honest server which element was updated and, of course, to which value. The best previous PIR-writing protocols had square-root communication complexity. In this paper, we propose two new PIR-writing protocols. The first one can be based on (say) the Damg{\\aa}rd-Jurik additively homomorphic public-key cryptosystem, and it has (amortized) polylogarithmic communication for a limited number of updates. The second one is based on a fully-homomorphic public-key cryptosystem, a much stronger primitive, but it achieves optimal logarithmic communication.\",\nisbn=\"978-3-642-13708-2\"\n}\n",{"title":3012,"type":228,"excerpt":3013,"year":132,"authors":3014,"tags":3018,"pdfFile":10,"pdfUrl":3019,"extendedUrl":10,"bibTeX":3020},"On the feasibility of consistent computations","In: Nguyen, P.Q., Pointcheval, D. (Eds.): PKC 2010, LNCS 6056, pp. 88-106, Springer-Verlag 2010.",[3015,3016],{"author":236},{"author":3017},"Lipmaa, H. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-13013-7_6",{"tag":10,"width":10,"height":10,"text":3021},"@InProceedings{10.1007\u002F978-3-642-13013-7_6,\nauthor=\"Laur, Sven\nand Lipmaa, Helger\",\neditor=\"Nguyen, Phong Q.\nand Pointcheval, David\",\ntitle=\"On the Feasibility of Consistent Computations\",\nbooktitle=\"Public Key Cryptography -- PKC 2010\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"88--106\",\nabstract=\"In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to formalize this type of corruption. In the current paper, we refine their model to get stronger security guarantees. Namely, we show how to construct protocols, where malicious participants cannot learn anything beyond their intended outputs and honest participants can detect malicious behavior that alters their outputs. As this construction does not protect honest parties from selective protocol failures, a valid corruption complaint can leak a single bit of information about the inputs of honest parties. Importantly, it is often up to the honest party to decide whether to complain or not. This potential leakage is often compensated by gains in efficiency---many standard zero-knowledge proof steps can be omitted. As a concrete practical contribution, we show how to implement consistent versions of several important cryptographic protocols such as oblivious transfer, conditional disclosure of secrets and private inference control.\",\nisbn=\"978-3-642-13013-7\"\n}",{"title":3023,"type":228,"excerpt":3024,"year":132,"authors":3025,"tags":3027,"pdfFile":10,"pdfUrl":3028,"extendedUrl":10,"bibTeX":3029},"On the CCA1-Security of Elgamal and Damgård’s Elgamal","In Xuejia Lai, Moti Yung and Dongdai Lin, editors, Inscrypt 2010, volume 6584 of Lecture Notes in Computer Science, pages 18–35, Shanghai, China, October 20–23, 2010. Springer-Verlag.",[3026],{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-21518-6_2",{"tag":10,"width":10,"height":10,"text":3030},"@InProceedings{10.1007\u002F978-3-642-21518-6_2,\nauthor=\"Lipmaa, Helger\",\neditor=\"Lai, Xuejia\nand Yung, Moti\nand Lin, Dongdai\",\ntitle=\"On the CCA1-Security of Elgamal and Damg{\\aa}rd's Elgamal\",\nbooktitle=\"Information Security and Cryptology\",\nyear=\"2011\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"18--35\",\nabstract=\"It is known that there exists a reduction from the CCA1-security of Damg{\\aa}rd's Elgamal (DEG) cryptosystem to what we call the {\\$}{\\backslash}textrm{\\{}ddh{\\}}^{\\{}{\\backslash}textrm{\\{}dsdh{\\}}{\\}}{\\$}assumption. We show that {\\$}{\\backslash}textrm{\\{}ddh{\\}}^{\\{}{\\backslash}textrm{\\{}dsdh{\\}}{\\}}{\\$}is unnecessary for DEG-CCA1, while DDH is insufficient for DEG-CCA1. We also show that CCA1-security of the Elgamal cryptosystem is equivalent to another assumption {\\$}{\\backslash}textrm{\\{}ddh{\\}}^{\\{}{\\backslash}textrm{\\{}csdh{\\}}{\\}}{\\$}, while we show that {\\$}{\\backslash}textrm{\\{}ddh{\\}}^{\\{}{\\backslash}textrm{\\{}dsdh{\\}}{\\}}{\\$}is insufficient for Elgamal's CCA1-security. Finally, we prove a generic-group model lower bound {\\$}{\\backslash}Omega ({\\backslash}sqrt[3]{\\{}q{\\}}){\\$}for the hardest considered assumption {\\$}{\\backslash}textrm{\\{}ddh{\\}}^{\\{}{\\backslash}textrm{\\{}csdh{\\}}{\\}}{\\$}, where q is the largest prime factor of the group order.\",\nisbn=\"978-3-642-21518-6\"\n}\n",{"title":3032,"type":228,"excerpt":3033,"year":132,"authors":3034,"tags":3048,"pdfFile":10,"pdfUrl":3049,"extendedUrl":10,"bibTeX":3050},"Digital Time Stamping System Based on Open Source Technologies","IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 57(3), 721 – 727, 2010.",[3035,3037,3039,3041,3043,3045,3046],{"author":3036},"Miškinis, R.",{"author":3038},"Smirnov, D.",{"author":3040},"Urba, E.",{"author":3042},"Burokas, A.",{"author":3044},"Malyško, B.",{"author":219},{"author":3047},"Zuliani, F. ",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FFREQ.2009.5168274",{"tag":10,"width":10,"height":10,"text":3051},"@INPROCEEDINGS{5168274,\n  author={Miskinis, R. and Smirnov, D. and Urba, E. and Burokas, A. and Malysko, B. and Laud, P. and Zuliani, F.},\n  booktitle={2009 IEEE International Frequency Control Symposium Joint with the 22nd European Frequency and Time forum}, \n  title={Digital time stamping system based on open source technologies}, \n  year={2009},\n  volume={},\n  number={},\n  pages={700-705},\n  doi={10.1109\u002FFREQ.2009.5168274}}\n",{"title":3053,"type":228,"excerpt":3054,"year":132,"authors":3055,"tags":3058,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"A Numerically Efficient Method for Calculation of the Angle of Heel of a Navigational Buoy","In: Proceedings of the 12th Biennial Baltic Electronic Conference BEC2010: Tallinn: TTU Press, 2010, 357 – 360.",[3056,3057],{"author":1078},{"author":2816},[],{"title":3060,"type":228,"excerpt":3061,"year":132,"authors":3062,"tags":3065,"pdfFile":10,"pdfUrl":3066,"extendedUrl":10,"bibTeX":3067},"Low Resource Demanding FOTA Method For Remote AtoN Site Equipment","OCEANS 2010 MTS\u002FIEEE Seattle, Seattle, Washington, USA September 20-23, 2010. IEEE, 2010.",[3063,3064],{"author":1078},{"author":2807},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FOCEANS.2010.5664107",{"tag":10,"width":10,"height":10,"text":3068},"@INPROCEEDINGS{5664107,\n  author={Moorits, Erkki and Jervan, Gert},\n  booktitle={OCEANS 2010 MTS\u002FIEEE SEATTLE}, \n  title={Low resource demanding FOTA method for remote AtoN site equipment}, \n  year={2010},\n  volume={},\n  number={},\n  pages={1-5},\n  doi={10.1109\u002FOCEANS.2010.5664107}}\n",{"title":3070,"type":228,"excerpt":3071,"year":132,"authors":3072,"tags":3074,"pdfFile":10,"pdfUrl":3075,"extendedUrl":10,"bibTeX":3076},"Optimal Adversary Behavior for the Serial Model of Financial Attack Trees","In: IWSEC 2010: IWSEC 2010, 22-24. Nov. Kobe, Jaapan. (Toim.) Echizen, I., Kunihiro. Springer, 2010, (LNCS).",[3073],{"author":2706},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-16825-3_24",{"tag":10,"width":10,"height":10,"text":3077},"@InProceedings{10.1007\u002F978-3-642-16825-3_24,\nauthor=\"Niitsoo, Margus\",\neditor=\"Echizen, Isao\nand Kunihiro, Noboru\nand Sasaki, Ryoichi\",\ntitle=\"Optimal Adversary Behavior for the Serial Model of Financial Attack Trees\",\nbooktitle=\"Advances in Information and Computer Security\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"354--370\",\nabstract=\"Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the expected gains of an adversary based on both the cost and likelihood of the subthreats. Such a multi-parameter analysis is considerably more complicated than separate probability or skill level estimation, requiring exponential time in general. However, this paper shows that under reasonable assumptions a completely different type of optimal substructure exists which can be harnessed into a linear-time algorithm for optimal gains estimation. More concretely, we use a decision-theoretic framework in which a rational adversary sequentially considers and performs the available attacks. The assumption of rationality serves as an upper bound as any irrational behavior will just hurt the end result of the adversary himself. We show that if the attacker considers the attacks in a goal-oriented way, his optimal expected gains can be computed in linear time. Our model places the least restrictions on adversarial behavior of all known attack tree models that analyze economic viability of an attack and, as such, provides for the best efficiently computable estimate for the potential reward.\",\nisbn=\"978-3-642-16825-3\"\n}",{"title":3079,"type":228,"excerpt":3080,"year":132,"authors":3081,"tags":3083,"pdfFile":10,"pdfUrl":3084,"extendedUrl":10,"bibTeX":3085},"Extending the Gordon Loeb model for information security investment","In: ARES 2010. IEEE Computer Society Press, pp. 258-261, 2010.",[3082],{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FARES.2010.37",{"tag":10,"width":10,"height":10,"text":3086},"@INPROCEEDINGS{5438086,\n  author={Willemson, Jan},\n  booktitle={2010 International Conference on Availability, Reliability and Security}, \n  title={Extending the Gordon and Loeb Model for Information Security Investment}, \n  year={2010},\n  volume={},\n  number={},\n  pages={258-261},\n  doi={10.1109\u002FARES.2010.37}}\n",{"title":3088,"type":228,"excerpt":3089,"year":151,"authors":3090,"tags":3098,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security and trust for the Norwegian e-voting pilot project E-valg 2011","In: Jøsang, A., Maseng, T., Knapskog, S.J. (Eds.): NordSec 2009, LNCS 5838, pp. 207-222, 4th Nordic Conference on Secure IT Systems, NordSec 2009, Springer-Verlag 2009.",[3091,3092,3093,3094,3096],{"author":981},{"author":984},{"author":2928},{"author":3095},"Øverland, T.A.",{"author":3097},"van Laenen, F.",[],{"title":3100,"type":228,"excerpt":3101,"year":151,"authors":3102,"tags":3106,"pdfFile":10,"pdfUrl":3107,"extendedUrl":10,"bibTeX":3108},"Efficiency bounds for adversary constructions in black-box reductions","In C. Boyd, J. González Nieto, eds., Proc. of 14th Australasian Conf. on Information Security and Privacy, ACISP 2009 (Brisbane, July 2009), v. 5594 of Lect. Notes in Comput. Sci., pp. 264-275. Springer, 2009.",[3103,3104,3105],{"author":845},{"author":1164},{"author":137},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-02620-1_19",{"tag":10,"width":10,"height":10,"text":3109},"@InProceedings{10.1007\u002F978-3-642-02620-1_19,\nauthor=\"Buldas, Ahto\nand J{\\\"u}rgenson, Aivo\nand Niitsoo, Margus\",\neditor=\"Boyd, Colin\nand Gonz{\\'a}lez Nieto, Juan\",\ntitle=\"Efficiency Bounds for Adversary Constructions in Black-Box Reductions\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2009\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"264--275\",\nabstract=\"We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been studied for about ten years, the main focus has been the efficiency of the construction mostly measured by the number of calls to the basic primitive by the constructed primitive. Our work focuses on the efficiency of the wrapper construction that builds an adversary for the basic primitive and has black-box access to an adversary for the constructed primitive. We present and prove a general upper bound theorem for the efficiency of black-box reductions. We also provide an example about upper bound for reductions between two security notions of cryptographic hash functions, which gives a negative answer to the open question about the existence of linear-preserving reductions from the so-called hash-then-publish time-stamping schemes to the collision resistance of the underlying hash function.\",\nisbn=\"978-3-642-02620-1\"\n}\n\n",{"title":3111,"type":228,"excerpt":3112,"year":151,"authors":3113,"tags":3117,"pdfFile":10,"pdfUrl":3118,"extendedUrl":10,"bibTeX":3119},"Oracle separation in the non-uniform model","In Proc. of 3rd Int. Conf. on Provable Security, ProvSec 2009. November 11-13, 2009, Guangzhou, China. LNCS 5848, pp. 230-244, 2009.",[3114,3115,3116],{"author":845},{"author":137},{"author":236},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-04642-1_19",{"tag":10,"width":10,"height":10,"text":3120},"@InProceedings{10.1007\u002F978-3-642-04642-1_19,\nauthor=\"Buldas, Ahto\nand Laur, Sven\nand Niitsoo, Margus\",\neditor=\"Pieprzyk, Josef\nand Zhang, Fangguo\",\ntitle=\"Oracle Separation in the Non-uniform Model\",\nbooktitle=\"Provable Security\",\nyear=\"2009\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"230--244\",\nabstract=\"Oracle separation methods are used in cryptography to rule out black-box reductions between cryptographic primitives. It is sufficient to find an oracle relative to which the base primitive exists but there are no secure instances of the constructed primitive. In practice, it is beyond our current reach to construct a fixed oracle with such properties for most of the reductions because it is difficult to guarantee the existence of secure base primitives. For example, to show that there exist no black-box reductions from collision-free functions to one-way permutations we have to show that secure one-way permutations exist relative to the oracle. However, no deterministic constructions for unconditionally secure one-way permutations are known yet. To overcome this gap, randomized oracles are used to create random base primitives that are secure on average. After that, a fixed oracle with the desired properties is extracted from the probability distribution by using non-constructive combinatorial arguments such as the first Borel-Cantelli lemma. This oracle extraction argument only applies to uniform reductions because it uses the countability of the set of all uniform Turing machines. In this work, we show how to adapt oracle separation results to the non-uniform security model. We consider the known separation techniques that are capable of ruling out the so-called fully black-box reductions and show that they can be extended to the non-uniform model with only minor modifications. As almost all separation results known to date fit into our separation framework, we conclude that they imply non-existence of fully black-box reductions in the non-uniform model. We also generalize our approach to a certain strong form of semi-black-box reductions. However, it stays an open question whether it is possible to adapt our technique to the weaker notions of black-box reductions in the non-uniform model.\",\nisbn=\"978-3-642-04642-1\"\n}\n\n",{"title":944,"type":228,"excerpt":3122,"year":151,"authors":3123,"tags":3126,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"In D. Lee and S. Hong (Eds.): ICISC 2009, Lecture Notes in Computer Science, volume 5984, pp. 118-128, Springer 2010.",[3124,3125],{"author":1164},{"author":141},[],{"title":3128,"type":228,"excerpt":3129,"year":151,"authors":3130,"tags":3133,"pdfFile":10,"pdfUrl":3134,"extendedUrl":10,"bibTeX":3135},"Formal Analysis of the Estonian Mobile-ID protocol","In proceedings of Nordsec 2009, 14th Nordic Workshop on Secure IT Systems (LNCS 5838), Oslo, Norway, October 15-16, 2009, pp. 271-286. Springer-Verlag.",[3131,3132],{"author":219},{"author":1369},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-04766-4_19",{"tag":10,"width":10,"height":10,"text":3136},"@InProceedings{10.1007\u002F978-3-642-04766-4_19,\nauthor=\"Laud, Peeter\nand Roos, Meelis\",\neditor=\"J{\\o}sang, Audun\nand Maseng, Torleiv\nand Knapskog, Svein Johan\",\ntitle=\"Formal Analysis of the Estonian Mobile-ID Protocol\",\nbooktitle=\"Identity and Privacy in the Internet Age\",\nyear=\"2009\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"271--286\",\nabstract=\"In this paper, we report the results of the formal analysis performed on the Estonian Mobile-ID protocol (deployed since 2008), allowing citizens and permanent residents of Estonia to authenticate themselves and issue digital signatures with the help of a signature-capable SIM-card inside their mobile phone. We analyze the resiliency of the protocol to network attacks under various threat models (compromised infrastructure, client application, etc., confusing user interface) and give suggestions for improvement.\",\nisbn=\"978-3-642-04766-4\"\n}",{"title":3138,"type":228,"excerpt":3139,"year":151,"authors":3140,"tags":3144,"pdfFile":10,"pdfUrl":3145,"extendedUrl":10,"bibTeX":3146},"A user interface for a game-based protocol verification tool"," In: Degano, P., Guttman, J.D. (eds) Formal Aspects in Security and Trust. FAST 2009. Lecture Notes in Computer Science, vol 5983. Springer, Berlin, Heidelberg.",[3141,3142],{"author":219},{"author":3143},"Tšahhirov, I.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-12459-4_19",{"tag":10,"width":10,"height":10,"text":3147},"@InProceedings{10.1007\u002F978-3-642-12459-4_19,\nauthor=\"Laud, Peeter\nand T{\\v{s}}ahhirov, Ilja\",\neditor=\"Degano, Pierpaolo\nand Guttman, Joshua D.\",\ntitle=\"A User Interface for a Game-Based Protocol Verification Tool\",\nbooktitle=\"Formal Aspects in Security and Trust\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"263--278\",\nabstract=\"We present a platform that allows a protocol researcher to specify the sequence of games from an initial protocol to a protocol where the security property under consideration can be shown to hold using ``conventional'' means. Our tool represents the protocol in the form of a program dependency graph. A step in the sequence corresponds to replacing a local fragment in the current graph. The researcher interacts with the tool by pointing out the location of this fragment and choosing the applied transformation from a list. The tool guarantees the error-freeness of the sequence. By our knowledge, this is the first time where the aspects of user interaction have been seriously considered for a sequence-of-games-based protocol analyzer.\",\nisbn=\"978-3-642-12459-4\"\n}\n",{"title":3149,"type":228,"excerpt":3150,"year":151,"authors":3151,"tags":3155,"pdfFile":10,"pdfUrl":3156,"extendedUrl":10,"bibTeX":3157},"Efficient generalized selective private function evaluation with applications in biometric authentication","In: Bao, F., Young, M. (Eds.): Inscrypt 2009, LNCS 6151, pp.154-163, Inscrypt 2009, Springer-Verlag 2009.",[3152,3153],{"author":2928},{"author":3154},"Zhang, B.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-16342-5_12",{"tag":10,"width":10,"height":10,"text":3158},"@InProceedings{10.1007\u002F978-3-642-16342-5_12,\nauthor=\"Lipmaa, Helger\nand Zhang, Bingsheng\",\neditor=\"Bao, Feng\nand Yung, Moti\nand Lin, Dongdai\nand Jing, Jiwu\",\ntitle=\"Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication\",\nbooktitle=\"Information Security and Cryptology\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"154--163\",\nabstract=\"In a selective private function evaluation (SPFE) protocol, the client privately computes some predefined function on his own input and on m out of server's n database elements. We propose two new generalized SPFE protocols that are based on the new cryptocomputing protocol by Ishai and Paskin and an efficient CPIR. The first protocol works only for constant values of m, but has 2 messages, and is most efficient when m= 1. The second SPFE protocol works for any m, has 4 messages, and is efficient for a large class of functionalities. We then propose an efficient protocol for private similarity test, where one can compute how similar client's input is to a specific element in server's database, without revealing any information to the server. The latter protocol has applications in biometric authentication.\",\nisbn=\"978-3-642-16342-5\"\n}\n\n",{"title":3160,"type":228,"excerpt":3161,"year":151,"authors":3162,"tags":3164,"pdfFile":10,"pdfUrl":3165,"extendedUrl":10,"bibTeX":3166},"First CPIR Protocol with Data-Dependent Computation","In Donghoon Lee and Seokhie Hong, editors, ICISC 2009, volume 5984 of Lecture Notes in Computer Science, pages 193–210, Seoul, Korea, December 2–4, 2009. Springer-Verlag.",[3163],{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-14423-3_14",{"tag":10,"width":10,"height":10,"text":3167},"@InProceedings{10.1007\u002F978-3-642-14423-3_14,\nauthor=\"Lipmaa, Helger\",\neditor=\"Lee, Donghoon\nand Hong, Seokhie\",\ntitle=\"First CPIR Protocol with Data-Dependent Computation\",\nbooktitle=\"Information, Security and Cryptology -- ICISC 2009\",\nyear=\"2010\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"193--210\",\nabstract=\"We design a new (n, 1)-CPIR protocol BddCpir for ℓ-bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communication-efficient (2, 1)-CPIR). BddCpir is the first CPIR protocol where server's online computation depends substantially on the concrete database. We then show that (a) for reasonably small values of ℓ, BddCpir is guaranteed to have simultaneously log-squared communication and sublinear online computation, and (b) BddCpir can handle huge but sparse matrices, common in data-mining applications, significantly more efficiently compared to all previous protocols. The security of BddCpir can be based on the well-known Decisional Composite Residuosity assumption.\",\nisbn=\"978-3-642-14423-3\"\n}",{"title":3169,"type":228,"excerpt":3170,"year":151,"authors":3171,"tags":3179,"pdfFile":10,"pdfUrl":3180,"extendedUrl":10,"bibTeX":3181},"Linear (hull) and algebraic cryptanalysis of the block cipher PRESENT","In: Garay, J.A., Miyaji, A., Otsuka, A. (Eds.): CANS 2009, LNCS 5888, pp. 58-75, Springer-Verlag 2009.",[3172,3174,3176,3177],{"author":3173},"Nakahara, J. Jr.",{"author":3175}," Seperhdad, P.",{"author":3154},{"author":3178},"Wang, M.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-10433-6_5",{"tag":10,"width":10,"height":10,"text":3182},"@InProceedings{10.1007\u002F978-3-642-10433-6_5,\nauthor=\"Nakahara, Jorge\nand Sepehrdad, Pouyan\nand Zhang, Bingsheng\nand Wang, Meiqin\",\neditor=\"Garay, Juan A.\nand Miyaji, Atsuko\nand Otsuka, Akira\",\ntitle=\"Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT\",\nbooktitle=\"Cryptology and Network Security\",\nyear=\"2009\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"58--75\",\nabstract=\"The contributions of this paper include the first linear hull and a revisit of the algebraic cryptanalysis of reduced-round variants of the block cipher PRESENT, under known-plaintext and ciphertext-only settings. We introduce a pure algebraic cryptanalysis of 5-round PRESENT and in one of our attacks we recover half of the bits of the key in less than three minutes using an ordinary desktop PC. The PRESENT block cipher is a design by Bogdanov et al., announced in CHES 2007 and aimed at RFID tags and sensor networks. For our linear attacks, we can attack 25-round PRESENT with the whole code book, 296.68 25-round PRESENT encryptions, 240 blocks of memory and 0.61 success rate. Further we can extend the linear attack to 26-round with small success rate. As a further contribution of this paper we computed linear hulls in practice for the original PRESENT cipher, which corroborated and even improved on the predicted bias (and the corresponding attack complexities) of conventional linear relations based on a single linear trail.\",\nisbn=\"978-3-642-10433-6\"\n}",{"title":3184,"type":228,"excerpt":3185,"year":151,"authors":3186,"tags":3190,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"A new generation of aids to navigation with indirect illumination in Norwegian coastal waters","IALA Bulletin 2009\u002F2, p.38-40",[3187,3189],{"author":3188},"Ose P.E.",{"author":2816},[],{"title":3192,"type":228,"excerpt":3193,"year":164,"authors":3194,"tags":3197,"pdfFile":10,"pdfUrl":3198,"extendedUrl":10,"bibTeX":3199},"Can we Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?","In: Baek, J., Bao, F., Chen, K., Lai, X. (eds) Provable Security. ProvSec 2008. Lecture Notes in Computer Science, vol 5324. Springer, Berlin, Heidelberg.",[3195,3196],{"author":845},{"author":137},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-88733-1_18",{"tag":10,"width":10,"height":10,"text":3200},"@InProceedings{10.1007\u002F978-3-540-88733-1_18,\nauthor=\"Buldas, Ahto\nand Niitsoo, Margus\",\neditor=\"Baek, Joonsang\nand Bao, Feng\nand Chen, Kefei\nand Lai, Xuejia\",\ntitle=\"Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?\",\nbooktitle=\"Provable Security\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"254--267\",\nabstract=\"It has been known for quite some time that collision-resistance of hash functions does not seem to give any actual security guarantees for unbounded hash-tree time-stamping, where the size of the hash-tree created by the time-stamping service is not explicitly restricted. We focus on the possibility of showing that there exist no black-box reductions of unbounded time-stamping schemes to collision-free hash functions. We propose an oracle that is probably suitable for such a separation and give strong evidence in support of that. However, the existence of a separation still remains open. We introduce the problem and give a construction of the oracle relative to which there seem to be no secure time-stamping schemes but there still exist collision-free hash function families. Although we rule out many useful collision-finding strategies (relative to the oracle) and the conjecture seems quite probable after that, there still remains a possibility that the oracle can be abused by some very smartly constructed wrappers. We also argue why it is probably very hard to give a correct proof for our conjecture.\",\nisbn=\"978-3-540-88733-1\"\n}",{"title":3202,"type":228,"excerpt":3203,"year":164,"authors":3204,"tags":3208,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Succinct NP Proofs from An Extractability Assumption","In Arnold Beckmann, Costas Dimitracopoulos and Benedikt Löwe, editors, Computability in Europe, volume 5028 of Lecture Notes in Computer Science, pages 175–185, Athens, Greece, June 15–20, 2008. Springer-Verlag.",[3205,3207],{"author":3206},"Crescenzo, G.",{"author":2928},[],{"title":3210,"type":228,"excerpt":3211,"year":164,"authors":3212,"tags":3215,"pdfFile":10,"pdfUrl":3216,"extendedUrl":10,"bibTeX":3217},"3-Message NP Arguments in The BPK Model with Optimal Soundness And Zero-Knowledge","In Seok-Hee Hong, Hiroshi Nagamochi and Takuro Fukunaga, editors, The 19th International Symposium on Algorithm and Computation, ISAAC 2008, volume 5369 of Lecture Notes in Computer Science, pages 616–628, Gold Coast, Australia, December 15–17, 2008. Springer-Verlag.",[3213,3214],{"author":3206},{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-92182-0_55",{"tag":10,"width":10,"height":10,"text":3218},"@InProceedings{10.1007\u002F978-3-540-92182-0_55,\nauthor=\"Di Crescenzo, Giovanni\nand Lipmaa, Helger\",\neditor=\"Hong, Seok-Hee\nand Nagamochi, Hiroshi\nand Fukunaga, Takuro\",\ntitle=\"3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge\",\nbooktitle=\"Algorithms and Computation\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"615--627\",\nabstract=\"Under sub-exponential time hardness assumptions, we show that any language in NP has a 3-message argument system in the bare public key (BPK) model, that satisfies resettable zero-knowledge (i.e., it reveals no information to any cheating verifier that can even reset provers) and bounded-resettable soundness (i.e., a verifier cannot be convinced of a false theorem, even if the cheating prover resets the verifier up to a fixed polynomial number of sessions). Our protocol has essentially optimal soundness among 3-message protocols (in that all stronger known soundness notions cannot be achieved with only 3 messages) and zero-knowledge (in that it achieves the strongest known zero-knowledge notion). We also show an extension of this protocol so that it achieves polylogarithmic communication complexity, although under very strong assumptions.\",\nisbn=\"978-3-540-92182-0\"\n}",{"title":3220,"type":228,"excerpt":3221,"year":164,"authors":3222,"tags":3225,"pdfFile":10,"pdfUrl":3226,"extendedUrl":10,"bibTeX":3227},"Application of Dependency Graphs to Security Protocol Analysis","In: Barthe, G., Fournet, C. (eds) Trustworthy Global Computing. TGC 2007. Lecture Notes in Computer Science, vol 4912. Springer, Berlin, Heidelberg.",[3223,3224],{"author":3143},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-78663-4_20",{"tag":10,"width":10,"height":10,"text":3228},"@InProceedings{10.1007\u002F978-3-540-78663-4_20,\nauthor=\"T{\\v{s}}ahhirov, Ilja\nand Laud, Peeter\",\neditor=\"Barthe, Gilles\nand Fournet, C{\\'e}dric\",\ntitle=\"Application of Dependency Graphs to Security Protocol Analysis\",\nbooktitle=\"Trustworthy Global Computing\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"294--311\",\nabstract=\"We present a computationally sound technique of static analysis for confidentiality in cryptographic protocols. The technique is a combination of the dependency flow graphs presented by Beck and Pingali and our earlier works -- we start with the protocol representation as a dependency graph indicating possible flows of data in all possible runs of the protocol and replace the cryptographic operations with constructions which are ``obviously secure''. Transformations are made in such a way that the semantics of the resulting graph remains computationally indistinguishable from the semantics of the original graph. The transformed graphs are analysed again; the transformations are applied until no more transformations are possible. A protocol is deemed secure if its transformed version is secure; the transformed versions are amenable to a very simple security analysis. The framework is well-suited for producing fully automated (with zero user input) proofs for protocol security.\",\nisbn=\"978-3-540-78663-4\"\n}\n",{"title":3230,"type":228,"excerpt":3231,"year":164,"authors":3232,"tags":3236,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Typing Computationally Secure Information Flow in Jif","In NordSec 2008.",[3233,3235],{"author":3234},"Haav, L.",{"author":1856},[],{"title":3238,"type":228,"excerpt":3239,"year":164,"authors":3240,"tags":3247,"pdfFile":10,"pdfUrl":3248,"extendedUrl":10,"bibTeX":3249},"Maritime Surveillance Information Availability in Estonia","Shahbasian, Elisa; Rogova, Galina; J. de Weert, Michael (Toim.). Harbour Protection Through Data Fusion Technologies (53 – 60), 2008. Springer.",[3241,3243,3245],{"author":3242},"Haavel, R.",{"author":3244},"Oit, M",{"author":3246},"Usk, A. ",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-4020-8883-4_10",{"tag":10,"width":10,"height":10,"text":3250},"@InProceedings{10.1007\u002F978-1-4020-8883-4_10,\nauthor=\"Haavel, Rein\nand Oit, Monika\nand Usk, Aivar\",\neditor=\"Shahbazian, Elisa\nand Rogova, Galina\nand DeWeert, Michael J.\",\ntitle=\"Maritime Surveillance Information Availability in Estonia\",\nbooktitle=\"Harbour Protection Through Data Fusion Technologies\",\nyear=\"2009\",\npublisher=\"Springer Netherlands\",\naddress=\"Dordrecht\",\npages=\"53--60\",\nabstract=\"This paper addresses the problem of the development of maritime surveillance information acquisition, analysis, and dissemination systems in Estonia. Coastal radar and radio (AIS, VHF) surveillance systems for air and marine vessel traffic monitoring have been set up or are currently in the process of being set up by Estonian national authorities. As a result, fragments of more or less recognized maritime surface situational picture of different track quality, reliability and extent of coverage are at the disposal of several governmental organizations. All relevant organizations would benefit from commonly contributing, correlating, fusing (where reasonable) and sharing this information with each other, but such mechanisms of common tactical depository and inter-organizational secure surveillance information exchange do not yet exist.\",\nisbn=\"978-1-4020-8883-4\"\n}",{"title":3252,"type":228,"excerpt":3253,"year":164,"authors":3254,"tags":3257,"pdfFile":10,"pdfUrl":3258,"extendedUrl":10,"bibTeX":3259},"Computing exact outcomes of multi-parameter attack trees","Jong Hyuk Park, Bart Preneel, Ravi Sandhu, André Zúquete (Toim.). Proc. of 3rd Int. Symp. on Information Security, IS 2008 (1036 – 1051).Springer",[3255,3256],{"author":1164},{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-88873-4_8",{"tag":10,"width":10,"height":10,"text":3260},"@InProceedings{10.1007\u002F978-3-540-88873-4_8,\nauthor=\"J{\\\"u}rgenson, Aivo\nand Willemson, Jan\",\neditor=\"Meersman, Robert\nand Tari, Zahir\",\ntitle=\"Computing Exact Outcomes of Multi-parameter Attack Trees\",\nbooktitle=\"On the Move to Meaningful Internet Systems: OTM 2008\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"1036--1051\",\nabstract=\"In this paper we introduce a set of computation rules to determine the attacker's exact expected outcome based on a multi-parameter attack tree. We compare these rules to a previously proposed computational semantics by Buldas et al. and prove that our new semantics always provides at least the same outcome. A serious drawback of our proposed computations is the exponential complexity. Hence, implementation becomes an important issue. We propose several possible optimisations and evaluate the result experimentally. Finally, we also prove the consistency of our computations in the framework of Mauw and Oostdijk and discuss the need to extend the framework.\",\nisbn=\"978-3-540-88873-4\"\n}\n",{"title":3262,"type":228,"excerpt":3263,"year":164,"authors":3264,"tags":3266,"pdfFile":10,"pdfUrl":3267,"extendedUrl":10,"bibTeX":3268},"On the computational soundness of cryptographically masked flows","In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2008), 10.-12.01.2008, San Francisco, CA, USA. (Toim.) George C. Necula, Philip Wadler. ACM, 2008, lk. 337 – 348.",[3265],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1328897.1328479",{"tag":10,"width":10,"height":10,"text":3269},"@article{10.1145\u002F1328897.1328479,\nauthor = {Laud, Peeter},\ntitle = {On the Computational Soundness of Cryptographically Masked Flows},\nyear = {2008},\nissue_date = {January 2008},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nvolume = {43},\nnumber = {1},\nissn = {0362-1340},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F1328897.1328479},\ndoi = {10.1145\u002F1328897.1328479},\nabstract = {To speak about the security of information flow in programs employing cryptographic operations, definitions based on computational indistinguish ability of distributions over program states have to be used. These definitions, as well as the accompanying analysis tools, are complex and error-prone to argue about. Cryptographically masked flows, proposed by Askarov, Hedin and Sabelfeld, are an abstract execution model and security definition that attempt to abstract away the details of computational security. This abstract model is useful because analysis of programs can be conducted using the usual techniques for enforcing non-interference.In this paper we investigate under which conditions this abstract model is computationally sound, i.e. when does the security of a program in their model imply the computational security of this program. This paper spells out a reasonable set of conditions and then proposes a simpler abstract model that is nevertheless no more restrictive than the cryptographically masked flows together with these conditions for soundness.},\njournal = {SIGPLAN Not.},\nmonth = {jan},\npages = {337–348},\nnumpages = {12},\nkeywords = {computational soundness, encryption, secure information flow, cryptographically masked flows}\n}\n\n@inproceedings{10.1145\u002F1328438.1328479,\nauthor = {Laud, Peeter},\ntitle = {On the Computational Soundness of Cryptographically Masked Flows},\nyear = {2008},\nisbn = {9781595936899},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F1328438.1328479},\ndoi = {10.1145\u002F1328438.1328479},\nabstract = {To speak about the security of information flow in programs employing cryptographic operations, definitions based on computational indistinguish ability of distributions over program states have to be used. These definitions, as well as the accompanying analysis tools, are complex and error-prone to argue about. Cryptographically masked flows, proposed by Askarov, Hedin and Sabelfeld, are an abstract execution model and security definition that attempt to abstract away the details of computational security. This abstract model is useful because analysis of programs can be conducted using the usual techniques for enforcing non-interference.In this paper we investigate under which conditions this abstract model is computationally sound, i.e. when does the security of a program in their model imply the computational security of this program. This paper spells out a reasonable set of conditions and then proposes a simpler abstract model that is nevertheless no more restrictive than the cryptographically masked flows together with these conditions for soundness.},\nbooktitle = {Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},\npages = {337–348},\nnumpages = {12},\nkeywords = {secure information flow, cryptographically masked flows, encryption, computational soundness},\nlocation = {San Francisco, California, USA},\nseries = {POPL '08}\n}\n\n",{"title":3271,"type":228,"excerpt":3272,"year":164,"authors":3273,"tags":3277,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library","In ProvSec 2008.",[3274,3275],{"author":219},{"author":3276},"Ngo, L. ",[],{"title":3279,"type":228,"excerpt":3280,"year":164,"authors":3281,"tags":3283,"pdfFile":10,"pdfUrl":3284,"extendedUrl":10,"bibTeX":3285},"New Communication-Efficient Oblivious Transfer Protocols Based on Pairings","In Tzong-Chen Wu and Chin-Laung Lei, editors, 11th Information Security Conference, ISC 2008, volume 5222 of Lecture Notes in Computer Science, pages 441–454, Taipei, Taiwan, September 15–18, 2008. Springer-Verlag.",[3282],{"author":3017},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-85886-7_30",{"tag":10,"width":10,"height":10,"text":3286},"@InProceedings{10.1007\u002F978-3-540-85886-7_30,\nauthor=\"Lipmaa, Helger\",\neditor=\"Wu, Tzong-Chen\nand Lei, Chin-Laung\nand Rijmen, Vincent\nand Lee, Der-Tsai\",\ntitle=\"New Communication-Efficient Oblivious Transfer Protocols Based on Pairings\",\nbooktitle=\"Information Security\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"441--454\",\nabstract=\"We construct two simple families of two-message (n,1)-oblivious transfer protocols based on degree-t homomorphic cryptosystems with the communication of respectively 1{\\thinspace}+{\\thinspace}⌈n\u002Ft⌉ and 3{\\thinspace}+{\\thinspace}⌈n\u002F(t{\\thinspace}+{\\thinspace}1)⌉ ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols; the way this is done may be of independent interest. The currently most interesting case t{\\thinspace}={\\thinspace}2 can be based on the Boneh-Goh-Nissim cryptosystem. As an important application, we show how to reduce the communication of virtually any existing oblivious transfer protocols by proposing a new related communication-efficient generic transformation from computationally-private information retrieval protocols to oblivious transfer protocols.\",\nisbn=\"978-3-540-85886-7\"\n}\n",{"title":3288,"type":228,"excerpt":3289,"year":164,"authors":3290,"tags":3292,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security from the practioners point of view","E.Kranakis, E.Haroutunian and E.Shahbasian (Toim.). Aspects of Network and Information Security (110 – 118) 2008. Holland: IOS Press",[3291],{"author":986},[],{"title":3294,"type":228,"excerpt":3295,"year":164,"authors":3296,"tags":3300,"pdfFile":10,"pdfUrl":3301,"extendedUrl":10,"bibTeX":3302},"Implementing a Knowledge-Driven Hierarchical Context Model in a Medical Laboratory Information System","In: Proceedings of The Third International Multi-Conference on Computing in the Global Information Technology (ICCGI 2008): Third International Multi-Conference on Computing in the Global Information Technology (ICCGI 2008). IEEE, 2008, 62 – 67.",[3297,3299],{"author":3298},"Pruulmann, J.",{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FICCGI.2008.19",{"tag":10,"width":10,"height":10,"text":3303},"@inproceedings{10.1109\u002FICCGI.2008.19,\nauthor = {Pruulmann, Jaan and Willemson, Jan},\ntitle = {Implementing a Knowledge-Driven Hierarchical Context Model in a Medical Laboratory Information System},\nyear = {2008},\nisbn = {9780769532752},\npublisher = {IEEE Computer Society},\naddress = {USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1109\u002FICCGI.2008.19},\ndoi = {10.1109\u002FICCGI.2008.19},\nabstract = {This paper discusses a context model developed for medical laboratory information system of Tartu University Hospital laboratories (in Tartu, Estonia). Due to the size, structure and complex history of the laboratory infrastructure, managing user communications and even achieving a common vocabulary has become a serious task. Most of the concepts used by the laboratory personnel depend on the particular cultural, organizational or other types of context, thus reducing the problem of user communications to context management. In this paper we present a cross-linked hierarchical approach to building a context management engine that uses open context space and a flexible attribute value delegation mechanism. We discuss development objectives of the laboratory information system together with the design decisions made and summarize the first user experience. Even though the context engine is currently implemented for use in laboratory environment, its architecture is general enough to support a considerably larger variety of application domains.},\nbooktitle = {Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (Iccgi 2008)},\npages = {62–67},\nnumpages = {6},\nkeywords = {context hierarchy, self-management, information systems},\nseries = {ICCGI '08}\n}",{"title":3305,"type":228,"excerpt":3306,"year":164,"authors":3307,"tags":3310,"pdfFile":10,"pdfUrl":3311,"extendedUrl":10,"bibTeX":10},"A Secure and Scalable Infrastructure for Inter-Organizational Data Exchange and eGovernment Applications","2008 Third International Conference on Availability, Reliability and Security, Barcelona, Spain, 2008, pp. 572-577",[3308,3309],{"author":141},{"author":981},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FARES.2008.90",{"title":3313,"type":228,"excerpt":3314,"year":178,"authors":3315,"tags":3318,"pdfFile":10,"pdfUrl":3319,"extendedUrl":10,"bibTeX":3320},"Does secure time-stamping imply collision-free hash functions?","In W. Susilo, J. K. Liu, Y. Mu, eds., Proc. of 1st Int. Conf. on Provable Security, ProvSec 2007 (Wollongong, Oct\u002FNov. 2007), v. 4784 of Lect. Notes in Comput. Sci., pp. 138-150. Springer, 2007.",[3316,3317],{"author":845},{"author":1164},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-75670-5_9",{"tag":10,"width":10,"height":10,"text":3321},"@InProceedings{10.1007\u002F978-3-540-75670-5_9,\nauthor=\"Buldas, Ahto\nand J{\\\"u}rgenson, Aivo\",\neditor=\"Susilo, Willy\nand Liu, Joseph K.\nand Mu, Yi\",\ntitle=\"Does Secure Time-Stamping Imply Collision-Free Hash Functions?\",\nbooktitle=\"Provable Security\",\nyear=\"2007\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"138--150\",\nabstract=\"We prove that there are no black-box reductions from Collision-Free Hash Functions to secure time-stamping schemes, which means that in principle secure time-stamping schemes may exist even if there exist no collision-resistant hash functions. We show that there is an oracle relative to which there exist secure time-stamping schemes but no hash function is collision-free. The oracle we use is not new --- a similar idea was already used by Simon in 1998 to show that collision-free hash functions cannot be constructed from one-way permutations in a black-box way. Our oracle contains a random hash function family f and a universal collision-finder A. We show that hash-tree time-stamping schemes that use f as a hash function remain secure even in the presence of A. From more practical view, our result is an implicit confirmation that collision-finding attacks against hash functions will tell us quite little about the security of hash-tree time-stamping schemes and that we need more dedicated research about back-dating attacks against practical hash functions.\",\nisbn=\"978-3-540-75670-5\"\n}",{"title":3323,"type":228,"excerpt":3324,"year":178,"authors":3325,"tags":3328,"pdfFile":10,"pdfUrl":3329,"extendedUrl":10,"bibTeX":3330},"Knowledge-binding commitments with applications in time-stamping"," In T. Okamoto, X. Wang, eds., Proc. of 10th Int. Conf. on Practice and Theory in Public-Key Cryptography, PKC 2007 (Beijing, Apr. 2007), v. 4450 of Lect. Notes in Comput. Sci., pp. 150-165. Springer, 2007.",[3326,3327],{"author":845},{"author":236},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-71677-8_11",{"tag":10,"width":10,"height":10,"text":3331},"@InProceedings{10.1007\u002F978-3-540-71677-8_11,\nauthor=\"Buldas, Ahto\nand Laur, Sven\",\neditor=\"Okamoto, Tatsuaki\nand Wang, Xiaoyun\",\ntitle=\"Knowledge-Binding Commitments with Applications in Time-Stamping\",\nbooktitle=\"Public Key Cryptography -- PKC 2007\",\nyear=\"2007\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"150--165\",\nabstract=\"We prove in a non-black-box way that every bounded list and set commitment scheme is knowledge-binding. This is a new and rather strong security condition, which makes the security definitions for time-stamping much more natural compared to the previous definitions, which assume unpredictability of adversaries. As a direct consequence, list and set commitment schemes with partial opening property are sufficient for secure time-stamping if the number of elements has an explicit upper bound N. On the other hand, white-box reductions are in a sense strictly weaker than black-box reductions. Therefore, we also extend and generalize the previously known reductions. The corresponding new reductions are {\\$}{\\backslash}Theta({\\backslash}sqrt{\\{}N{\\}}){\\$}times more efficient, which is important for global-scale time-stamping schemes where N is very large.\",\nisbn=\"978-3-540-71677-8\"\n}\n",{"title":3333,"type":228,"excerpt":3334,"year":178,"authors":3335,"tags":3339,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Practical analysis of e-voting systems","In A. Miyaji, H. Kikuchi, K. Rannenberg, eds., Proc. of 2nd Int. Wksh. on Security, IWSEC 2007 (Nara, Oct. 2007), v. 4752 of Lect. Notes in Comput. Sci., pp. 320-335. Springer, 2007.",[3336,3337],{"author":845},{"author":3338},"Mägi, T.",[],{"title":3341,"type":228,"excerpt":3342,"year":178,"authors":3343,"tags":3349,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation","Discr. Math. and Theor. Comput. Sci., v. 9, n. 1, pp. 247-274, 2007.",[3344,3346,3347],{"author":3345},"Dumas, P.",{"author":2928},{"author":3348},"Wallén, J.",[],{"title":3351,"type":228,"excerpt":3352,"year":178,"authors":3353,"tags":3356,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Processing multi-parameter attacktrees with estimated parameter values","In A. Miyaji, H. Kikuchi, K. Rannenberg, eds., Proc. of 2nd Int. Wksh. on Security, IWSEC 2007 (Nara, Oct. 2007), v. 4752 of Lect. Notes in Comput. Sci., pp. 308-319. Springer, 2007.",[3354,3355],{"author":1164},{"author":141},[],{"title":3358,"type":228,"excerpt":3359,"year":178,"authors":3360,"tags":3363,"pdfFile":10,"pdfUrl":3364,"extendedUrl":10,"bibTeX":3365},"Enforcing policies and guidelines in web portals: a case study","In M. Weske, M.-S. Hacid, C. Godart, eds., Proc. of Web Information Systems Engineering, WISE 2007, Int.\\ Wkshs. (Nancy, Dec. 2007), v. 4832 of Lect. Notes in Comput. Sci., pp. 154-165. Springer, 2007.",[3361,3362],{"author":1256},{"author":1524},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-77010-7_16",{"tag":10,"width":10,"height":10,"text":3366},"@InProceedings{10.1007\u002F978-3-540-77010-7_16,\nauthor=\"Karus, Siim\nand Dumas, Marlon\",\neditor=\"Weske, Mathias\nand Hacid, Mohand-Sa{\\\"i}d\nand Godart, Claude\",\ntitle=\"Enforcing Policies and Guidelines in Web Portals: A Case Study\",\nbooktitle=\"Web Information Systems Engineering -- WISE 2007 Workshops\",\nyear=\"2007\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"154--165\",\nabstract=\"Customizability is generally considered a desirable feature of web portals. However, if left uncontrolled, customizability may come at the price of lack of uniformity or lack of maintainability. Indeed, as the portal content and services evolve, they can break assumptions made in the definition of customized views. Also, uncontrolled customization may lead to certain content considered important by the web portal owners (e.g. advertisements), to not be displayed to end users. Thus, web portal customization is hindered by the need to enforce customization policies and guidelines with minimal overhead. This paper presents a case study where a combination of techniques was employed to semi-automatically enforce policies and guidelines on community-built presentation components in a web portal. The study shows that a combination of automated verification and semantics extraction techniques can reduce the amount of manual checks required to enforce these policies and guidelines.\",\nisbn=\"978-3-540-77010-7\"\n}\n",{"title":3368,"type":228,"excerpt":3369,"year":178,"authors":3370,"tags":3373,"pdfFile":10,"pdfUrl":3374,"extendedUrl":10,"bibTeX":3375},"A new protocol for conditional disclosure of secrets and its applications","In J. Katz, M. Yung, eds., Proc. of 5th Int. Conf. on Applied Cryptography and Network Security, ACNS 2007 (Zhuhai, June 2007), v. 4521 of Lect. Notes in Comput. Sci., pp. 207-225. Springer, 2007.",[3371,3372],{"author":236},{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-72738-5_14",{"tag":10,"width":10,"height":10,"text":3376},"@InProceedings{10.1007\u002F978-3-540-72738-5_14,\nauthor=\"Laur, Sven\nand Lipmaa, Helger\",\neditor=\"Katz, Jonathan\nand Yung, Moti\",\ntitle=\"A New Protocol for Conditional Disclosure of Secrets and Its Applications\",\nbooktitle=\"Applied Cryptography and Network Security\",\nyear=\"2007\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"207--225\",\nabstract=\"Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}. Conditional disclosure of secrets (CDS) helps to overcome this restriction. In a CDS protocol for a set {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}, the client obtains server's secret if and only if the client's inputs belong to {\\$}{\\backslash}mathcal{\\{}S{\\}}{\\$}and thus the server can guard itself against malformed queries. We extend the existing CDS protocols to work over additively homomorphic cryptosystems for every set from NP\u002Fpoly. The new construction is modular and easy to apply. As an example, we derive a new oblivious transfer protocol with log-squared communication and a millionaire's protocol with logarithmic communication. We also implement private, universally verifiable and robust multi-candidate electronic voting so that all voters only transmit an encryption of their vote. The only hardness assumption in all these protocols is that the underlying public-key cryptosystem is IND-CPA secure and the plaintext order does not have small factors.\",\nisbn=\"978-3-540-72738-5\"\n}\n",{"title":3378,"type":228,"excerpt":3379,"year":178,"authors":3380,"tags":3391,"pdfFile":10,"pdfUrl":3392,"extendedUrl":10,"bibTeX":3393},"Integrating rule-based and input-based approaches for better error diagnosis in expression manipulation tasks.","In S. Li, D. Wang, J.-Z. Zhang, eds., Symbolic Computation and Education, pp. 174-191. World Scientific, 2007.",[3381,3383,3385,3387,3389],{"author":3382},"Prank, R.",{"author":3384},"Issakova, M.",{"author":3386},"Lepp, D.",{"author":3388},"Tõnisson, E.",{"author":3390},"Vaiksaar, V. ",[],"https:\u002F\u002Fwww.researchgate.net\u002Fpublication\u002F279409132_Integrating_rule-based_and_input-based_approaches_for_better_error_diagnosis_in_expression_manipulation_tasks",{"tag":10,"width":10,"height":10,"text":3394},"@inbook{inbook,\nauthor = {Prank, Rein and Lepp, Marina and LEPP, DMITRI and Tonisson, Eno and VAIKSAAR, VAHUR},\nyear = {2007},\nmonth = {10},\npages = {174-191},\ntitle = {Integrating rule-based and input-based approaches for better error diagnosis in expression manipulation tasks},\nisbn = {978-981-277-599-3},\ndoi = {10.1142\u002F9789812776006_0010}\n}",{"title":3396,"type":228,"excerpt":3397,"year":967,"authors":3398,"tags":3404,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"SLC: Efficient Authenticated Encryption for Short Packets","In Jana Dittmann, editor, Sicherheit 2006: Sicherheit – Schutz und Zuverlässigkeit, Beiträge der 3. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.v. (GI), volume 77 of Lecture Notes in Informatics, pages 270-278, Magdeburg, Germany, February 20–22, 2006. Gesellschaft für Informatik e.v.",[3399,3401,3403],{"author":3400},"Alkassar, A.",{"author":3402},"Andreeva, E.",{"author":2928},[],{"title":3406,"type":228,"excerpt":3407,"year":967,"authors":3408,"tags":3412,"pdfFile":10,"pdfUrl":3413,"extendedUrl":10,"bibTeX":3414},"Computationally Sound Secrecy Proofs by Mechanized Flow Analysis","In 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA, pages 370-379, October 30th – November 3rd, 2006.",[3409,3411],{"author":3410},"Backes, M.",{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1180405.1180450",{"tag":10,"width":10,"height":10,"text":3415},"@inproceedings{10.1145\u002F1180405.1180450,\nauthor = {Backes, Michael and Laud, Peeter},\ntitle = {Computationally Sound Secrecy Proofs by Mechanized Flow Analysis},\nyear = {2006},\nisbn = {1595935185},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F1180405.1180450},\ndoi = {10.1145\u002F1180405.1180450},\nabstract = {We present a novel approach for proving secrecy properties of security protocols by mechanized flow analysis. In contrast to existing tools for proving secrecy by abstract interpretation, our tool enjoys cryptographic soundness in the strong sense of blackbox reactive simulatability\u002FUC which entails that secrecy properties proven by our tool are automatically guaranteed to hold for secure cryptographic implementations of the analyzed protocol, with respect to the more fine-grained cryptographic secrecy definitions and adversary models.Our tool is capable of reasoning about a comprehensive language for expressing protocols, in particular handling symmetric encryption and asymmetric encryption, and it produces proofs for an unbounded number of sessions in the presence of an active adversary. We have implemented the tool and applied it to a number of common protocols from the literature.},\nbooktitle = {Proceedings of the 13th ACM Conference on Computer and Communications Security},\npages = {370–379},\nnumpages = {10},\nkeywords = {data flow analysis, simulatability},\nlocation = {Alexandria, Virginia, USA},\nseries = {CCS '06}\n}",{"title":3406,"type":228,"excerpt":3417,"year":967,"authors":3418,"tags":3421,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"In 2nd workshop on Formal and Computational Cryptography, pages 1-6, July 9th, 2006, Venice, Italy.",[3419,3420],{"author":3410},{"author":219},[],{"title":3423,"type":228,"excerpt":3424,"year":967,"authors":3425,"tags":3428,"pdfFile":10,"pdfUrl":3429,"extendedUrl":10,"bibTeX":3430},"Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?","In Jianying Zhou, Moti Yung, Feng Bao, editors, 4th International Conference on Applied Cryptography and Network Security – ACNS’06, volume 3989 of Lecture Notes in Computer Science, pages 50–65, Singapore, 2006. Springer-Verlag.",[3426,3427],{"author":845},{"author":236},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11767480_4",{"tag":10,"width":10,"height":10,"text":3431},"@InProceedings{10.1007\u002F11767480_4,\nauthor=\"Buldas, Ahto\nand Laur, Sven\",\neditor=\"Zhou, Jianying\nand Yung, Moti\nand Bao, Feng\",\ntitle=\"Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?\",\nbooktitle=\"Applied Cryptography and Network Security\",\nyear=\"2006\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"50--65\",\nabstract=\"We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents before sending them to time-stamping servers and server-side hash functions used for establishing one way causal relations between time stamps. We derive necessary and sufficient conditions for client side hash functions and show by using explicit separation techniques that neither collision-resistance nor 2nd preimage resistance is necessary for secure time-stamping. Moreover, we show that server side hash functions can even be not one-way. Hence, it is impossible by using black-box techniques to transform collision-finders into wrappers that break the corresponding time-stamping schemes. Each such wrapper should analyze the structure of the hash function. However, these separations do not necessarily hold for more specific classes of hash functions. Considering this, we take a more detailed look at the structure of practical hash functions by studying the Merkle-Damg{\\aa}rd (MD) hash functions. We show that attacks, which are able to find collisions for MD hash functions with respect to randomly chosen initial states, also violate the necessary security conditions for client-side hash functions. This does not contradict the black-box separations results because the MD structure is already a deviation from the black-box setting. As a practical consequence, MD5, SHA-0, and RIPEMD are no more recommended to use as client-side hash functions in time-stamping. However, there is still no evidence against using MD5 (or even MD4) as server-side hash functions.\",\nisbn=\"978-3-540-34704-0\"\n}\n\n",{"title":3433,"type":228,"excerpt":3434,"year":967,"authors":3435,"tags":3442,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Rational Choice of Security Measures via Multi-Parameter Attack Trees","In 1st International Workshop on Critical Information Infrastructures Security (CRITIS’06), August 30 – September 2, 2006, Samos Island, Greece.",[3436,3438,3439,3440,3441],{"author":3437},"Buldas, A",{"author":219},{"author":1706},{"author":2118},{"author":141},[],{"title":3444,"type":228,"excerpt":3445,"year":967,"authors":3446,"tags":3452,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Type Systems Equivalent to Data-Flow Analyses of Imperative Languages","Theoretical Computer Science, vol 364, no. 3, pages 292-310, 2006.",[3447,3448,3450],{"author":219},{"author":3449},"Uustalu, T.",{"author":3451},"Vene, V.",[],{"title":3454,"type":228,"excerpt":3455,"year":967,"authors":3456,"tags":3461,"pdfFile":10,"pdfUrl":3462,"extendedUrl":10,"bibTeX":3463},"Cryptographically Private Support Vector Machines","In Mark Craven and Dimitrios Gunopulos, editors, The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, Philadelphia, USA, August 20-23, 2006. ACM.",[3457,3458,3459],{"author":236},{"author":2928},{"author":3460}," Mielikäinen, T.",[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F1150402.1150477",{"tag":10,"width":10,"height":10,"text":3464},"@inproceedings{10.1145\u002F1150402.1150477,\nauthor = {Laur, Sven and Lipmaa, Helger and Mielik\\\"{a}inen, Taneli},\ntitle = {Cryptographically Private Support Vector Machines},\nyear = {2006},\nisbn = {1595933395},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F1150402.1150477},\ndoi = {10.1145\u002F1150402.1150477},\nabstract = {We propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning algorithms, give private classification protocols and private polynomial kernel computation protocols. The new protocols return their outputs - either the kernel value, the classifier or the classifications - in encrypted form so that they can be decrypted only by a common agreement by the protocol participants. We show how to use the encrypted classifications to privately estimate many properties of the data and the classifier. The new SVM classifiers are the first to be proven private according to the standard cryptographic definitions.},\nbooktitle = {Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},\npages = {618–624},\nnumpages = {7},\nkeywords = {privacy preserving data mining, kernel methods},\nlocation = {Philadelphia, PA, USA},\nseries = {KDD '06}\n}",{"title":3466,"type":228,"excerpt":3467,"year":967,"authors":3468,"tags":3475,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Using Action-Object-Input Scheme for Better Error Diagnosis and Assessment in Expression Manipulation Tasks","Maths, Stats and OR Network. Maths CAA Series: March 2006.",[3469,3470,3472,3473],{"author":3382},{"author":3471}," Issakova, M.",{"author":3386},{"author":3474},"Vaiksaar, V.",[],{"title":3477,"type":228,"excerpt":3478,"year":967,"authors":3479,"tags":3484,"pdfFile":10,"pdfUrl":3485,"extendedUrl":10,"bibTeX":3486},"Designing Next-Generation Training and Testing Environment for Expression Manipulation","V.N. Alexandrov et al. (Eds.): ICCS 2006, Part I, LNCS 3991, pp. 928-931, Springer-Verlag Berlin Heidelberg 2006.",[3480,3481,3482,3483],{"author":3382},{"author":3384},{"author":3386},{"author":3474},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11758501_140",{"tag":10,"width":10,"height":10,"text":3487},"@InProceedings{10.1007\u002F11758501_140,\nauthor=\"Prank, Rein\nand Issakova, Marina\nand Lepp, Dmitri\nand Vaiksaar, Vahur\",\neditor=\"Alexandrov, Vassil N.\nand van Albada, Geert Dick\nand Sloot, Peter M. A.\nand Dongarra, Jack\",\ntitle=\"Designing Next-Generation Training and Testing Environment for Expression Manipulation\",\nbooktitle=\"Computational Science -- ICCS 2006\",\nyear=\"2006\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"928--931\",\nabstract=\"T-algebra is a project for creating an interactive learning environment for basic school algebra. Our main didactical principle has been that all the necessary decisions and calculations at each solution step should be made by the student, and the program should be able to understand the mistakes. This paper describes the design of our Action-Object-Input dialogue and different input modes as an instrument to communicate three natural attributes of the step: choice of conversion rule, operands and result.\",\nisbn=\"978-3-540-34380-6\"\n}",{"title":3489,"type":228,"excerpt":3490,"year":967,"authors":3491,"tags":3495,"pdfFile":10,"pdfUrl":3496,"extendedUrl":10,"bibTeX":3497},"Algorithmic Generation of Path Fragment Covers for Mobile Robot Path Planning","Accepted to 3rd IEEE Conference on Intelligent Systems, 4-6 September 2006, University of Westminster, London, UK.",[3492,3493],{"author":141},{"author":3494},"Kruusmaa, M.",[],"http:\u002F\u002Fdx.doi.org\u002F10.1109\u002FIS.2006.348500",{"tag":10,"width":10,"height":10,"text":3498},"@INPROCEEDINGS{4155507,\n  author={Willemson, Jan and Kruusmaa, Maarja},\n  booktitle={2006 3rd International IEEE Conference Intelligent Systems}, \n  title={Algorithrnic Generation of Path Fragrnent Covers for Mobile Robot Path Planning}, \n  year={2006},\n  volume={},\n  number={},\n  pages={673-678},\n  doi={10.1109\u002FIS.2006.348500}}",{"title":3500,"type":228,"excerpt":3501,"year":967,"authors":3502,"tags":3504,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"On the Gordon and Loeb Model for Information Security Investment","Accepted to The Fifth Workshop on the Economics of Information Security (WEIS 2006), University of Cambridge, England, UK, 26-28 June 2006.",[3503],{"author":141},[],{"title":3506,"type":228,"excerpt":3507,"year":3508,"authors":3509,"tags":3514,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Universally Compisable Time-Stamping Schemes with Audit","In Jianying Zhou and Javier Lopez, editors, The 8th Information Security Conference (ISC’05), volume 3650 of Lecture Notes in Computer Science, pages 359-373, Singapore, September 20-23, 2005. Springer-Verlag.",2005,[3510,3511,3512,3513],{"author":845},{"author":219},{"author":2118},{"author":141},[],{"title":3516,"type":228,"excerpt":3517,"year":3508,"authors":3518,"tags":3522,"pdfFile":10,"pdfUrl":3523,"extendedUrl":10,"bibTeX":3524},"Hybrid Voting Protocols and Hardness of Manipulation","In Xiaotie Deng and Dingzhu Du, editors, The 16th Annual International Symposium on Algorithms and Computation, ISAAC 2005, volume 3827 of Lecture Notes in Computer Science, pages 206-215, Sanya, Hainan, China, December 19-21, 2005. Springer-Verlag.",[3519,3521],{"author":3520},"Elkind, E.",{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11602613_22",{"tag":10,"width":10,"height":10,"text":3525},"@InProceedings{10.1007\u002F11602613_22,\nauthor=\"Elkind, Edith\nand Lipmaa, Helger\",\neditor=\"Deng, Xiaotie\nand Du, Ding-Zhu\",\ntitle=\"Hybrid Voting Protocols and Hardness of Manipulation\",\nbooktitle=\"Algorithms and Computation\",\nyear=\"2005\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"206--215\",\nabstract=\"This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more base protocols, and study the resulting class of (vote-once) hybrid voting protocols, which also includes most previously known manipulation-resistant protocols. We show that for many choices of underlying base protocols, including some that are easily manipulable, their hybrids are NP-hard to manipulate, and demonstrate that this method can be used to produce manipulation-resistant protocols with unique combinations of useful features.\",\nisbn=\"978-3-540-32426-3\"\n}\n",{"title":3527,"type":228,"excerpt":3528,"year":3508,"authors":3529,"tags":3532,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Small Coalitions Cannot Manipulate Voting","In Andrew Patrick and Moti Yung, editors, Financial Cryptography and Data Security — Ninth International Conference, volume 3570 of Lecture Notes in Computer Science, pages 285–297, Roseau, The Commonwealth Of Dominica, February 28-March 3, 2005. Springer-Verlag.",[3530,3531],{"author":3520},{"author":2928},[],{"title":3534,"type":228,"excerpt":3535,"year":3508,"authors":3536,"tags":3542,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"On the Utility of Exploration on Time-Critical Mobile Robot Missions","In Proc. of the 2nd European Conference on Mobile Robots (ECMR05), Sept. 7-10, 2005, Ancona, Italy, pp. 152-157.",[3537,3539,3541],{"author":3538},"Heero, K.",{"author":3540},"Aabloo, A.",{"author":3494},[],{"title":3544,"type":228,"excerpt":3545,"year":3508,"authors":3546,"tags":3551,"pdfFile":10,"pdfUrl":3552,"extendedUrl":10,"bibTeX":3553},"Learning Innovative Routes for Mobile Robots in Dynamic Partially Unknown Environments","Int. Journal of Robots and Autonomous Systems, pp. 209 – 222, Vol. 2, No.3, (2005).",[3547,3548,3549],{"author":3538},{"author":3540},{"author":3550},"Kruusmaa, M. ",[],"https:\u002F\u002Fdoi.org\u002F10.5772\u002F5787",{"tag":10,"width":10,"height":10,"text":3554},"@article{doi:10.5772\u002F5787,\nauthor = {Kristo Heero and Alvo Aabloo and Maarja Kruusmaa},\ntitle ={Learning Innovative Routes for Mobile Robots in Dynamic Partially Unknown Environments},\njournal = {International Journal of Advanced Robotic Systems},\nvolume = {2},\nnumber = {3},\npages = {21},\nyear = {2005},\ndoi = {10.5772\u002F5787},\n\nURL = { \n        https:\u002F\u002Fdoi.org\u002F10.5772\u002F5787\n    \n},\neprint = { \n        https:\u002F\u002Fdoi.org\u002F10.5772\u002F5787\n    \n}}",{"title":3556,"type":228,"excerpt":3557,"year":3508,"authors":3558,"tags":3561,"pdfFile":10,"pdfUrl":3562,"extendedUrl":10,"bibTeX":3563},"A Type System for Computationally Secure Information Flow","In Maciej Liskiewicz, Rüdiger Reischuk, editors, Fundamentals of Computation Theory: 15th International Symposium, FCT 2005, volume 3623 of Lecture Notes in Computer Science, pages 365-377. Lübeck, Germany, August 17-20, 2005. Springer-Verlag",[3559,3560],{"author":219},{"author":3451},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11537311_32",{"tag":10,"width":10,"height":10,"text":3564},"@InProceedings{10.1007\u002F11537311_32,\nauthor=\"Laud, Peeter\nand Vene, Varmo\",\neditor=\"Li{\\'{s}}kiewicz, Maciej\nand Reischuk, R{\\\"u}diger\",\ntitle=\"A Type System for Computationally Secure Information Flow\",\nbooktitle=\"Fundamentals of Computation Theory\",\nyear=\"2005\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"365--377\",\nabstract=\"The paper presents a novel type system for checking the security of information flow in programs containing operations of symmetric encryption. The type system is correct with respect to the complexity-theoretic security definitions of the encryption primitive.\",\nisbn=\"978-3-540-31873-6\"\n}",{"title":3566,"type":228,"excerpt":3567,"year":3508,"authors":3568,"tags":3570,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Secrecy Types for a Simulatable Cryptographic Library","In Vijay Aluri, Catherine Meadows and Ari Juels, editors, proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, pages 26-35, Alexandria, VA, USA, November 7-11, 2005. ACM.",[3569],{"author":1856},[],{"title":3572,"type":228,"excerpt":3573,"year":3508,"authors":3574,"tags":3578,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Type Systems Equivalent to Data-Flow Analyses of Imperative Languages (Extended Abstract)","In Martin Hofmann, editor, In proceedings of the Third Workshop on Applied Semantics (APPSEM05), Frauenchiemsee, Germany, Septermber 12-15, 2005.",[3575,3576,3577],{"author":219},{"author":3449},{"author":3451},[],{"title":3580,"type":228,"excerpt":3581,"year":3508,"authors":3582,"tags":3587,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Private Itemset Support Counting","In Sihan Qing, Wenbo Mao, Javier Lopez and Guilin Wang, editors, Information and Communications Security: 7th International Conference, ICICS 2005, volume 3783 of Lecture Notes in Computer Science, pages 97-111, Beijing, China, December 10-13, 2005. Springer-Verlag.",[3583,3584,3585],{"author":236},{"author":2928},{"author":3586},"Mielikäinen, T.",[],{"title":3589,"type":228,"excerpt":3590,"year":3508,"authors":3591,"tags":3597,"pdfFile":10,"pdfUrl":3598,"extendedUrl":10,"bibTeX":3599},"On Delegatability of Four Designated Verifier Signatures","In Sihan Qing, Wenbo Mao, Javier Lopez and Guilin Wang, editors, Information and Communications Security: 7th International Conference, ICICS 2005, volume 3783 of Lecture Notes in Computer Science, pages 61-71, Beijing, China, December 10-13, 2005. Springer-Verlag.",[3592,3594,3595],{"author":3593},"Li, Y.",{"author":2928},{"author":3596},"Pei, D.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11602897_6",{"tag":10,"width":10,"height":10,"text":3600},"@InProceedings{10.1007\u002F11602897_6,\nauthor=\"Li, Yong\nand Lipmaa, Helger\nand Pei, Dingyi\",\neditor=\"Qing, Sihan\nand Mao, Wenbo\nand L{\\'o}pez, Javier\nand Wang, Guilin\",\ntitle=\"On Delegatability of Four Designated Verifier Signatures\",\nbooktitle=\"Information and Communications Security\",\nyear=\"2005\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"61--71\",\nabstract=\"In a paper recently published in ICALP 2005, Lipmaa, Wang and Bao identified a new essential security property, non-delegatability, of designated verifier signature (DVS) schemes. Briefly, in a non-delegatable DVS scheme, neither a signer nor a designated verifier can delegate the signing rights to any third party T without revealing their secret keys. We show that the Susilo-Zhang-Mu identity-based strong DVS scheme, Ng-Susilo-Mu universal designated multi verifier signature scheme, the Laguillaumie-Vergnaud multi-DVS scheme and the Zhang-Furukawa-Imai universal DVS scheme are delegatable. Together with the results of Lipmaa, Wang and Bao, our results show that most of the previously proposed DVS schemes are delegatable. However, the Laguillaumie-Vergnaud and Zhang-Furukawa-Imai schemes may still be secure in practice, since there the only party who can delegate signing is the designated verifier, who may not have motivation to do so. We finish the paper with some discussion on whether the non-delegatability notion of Lipmaa, Wang and Bao is appropriate.\",\nisbn=\"978-3-540-32099-9\"\n}",{"title":3602,"type":228,"excerpt":3603,"year":3508,"authors":3604,"tags":3606,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Secure Electronic Voting Protocols","Chapter in The Handbook of Information Security, Hossein Bidgoli, Editor-in-Chief. John Wiley & Sons, Inc., 2005.",[3605],{"author":2928},[],{"title":3608,"type":228,"excerpt":3609,"year":3508,"authors":3610,"tags":3612,"pdfFile":10,"pdfUrl":3613,"extendedUrl":10,"bibTeX":3614},"An Oblivious Transfer Protocol with Log-Squared Communication","In Jianying Zhou and Javier Lopez, editors, The 8th Information Security Conference (ISC’05), volume 3650 of Lecture Notes in Computer Science, pages 314-328, Singapore, September 20-23, 2005. Springer-Verlag.",[3611],{"author":2928},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11556992_23",{"tag":10,"width":10,"height":10,"text":3615},"@InProceedings{10.1007\u002F11556992_23,\nauthor=\"Lipmaa, Helger\",\neditor=\"Zhou, Jianying\nand Lopez, Javier\nand Deng, Robert H.\nand Bao, Feng\",\ntitle=\"An Oblivious Transfer Protocol with Log-Squared Communication\",\nbooktitle=\"Information Security\",\nyear=\"2005\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"314--328\",\nabstract=\"We propose a one-round 1-out-of-n computationally-private information retrieval protocol for ℓ-bit strings with low-degree polylogarithmic receiver-computation, linear sender-computation and communication $\\Theta$(klog2n+ℓlogn), where k is a possibly non-constant security parameter. The new protocol is receiver-private if the underlying length-flexible additively homomorphic public-key cryptosystem is IND-CPA secure. It can be transformed to a one-round computationally receiver-private and information-theoretically sender-private 1-out-of-n oblivious-transfer protocol for ℓ-bit strings, that has the same asymptotic communication and is private in the standard complexity-theoretic model.\",\nisbn=\"978-3-540-31930-6\"\n}\n",{"title":3617,"type":228,"excerpt":3618,"year":3508,"authors":3619,"tags":3625,"pdfFile":10,"pdfUrl":3626,"extendedUrl":10,"bibTeX":3627},"Designated Verifier Signature Schemes: Attacks, New Security Notions and A New Construction","In Moti Yung, editor, The 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 459–471, Lisboa, Portugal, July 11-15, 2005. Springer-Verlag. Accepted (Track C).",[3620,3621,3623],{"author":2928},{"author":3622},"Wang, G.",{"author":3624},"Bao, F.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F11523468_38",{"tag":10,"width":10,"height":10,"text":3628},"@InProceedings{10.1007\u002F11523468_38,\nauthor=\"Lipmaa, Helger\nand Wang, Guilin\nand Bao, Feng\",\neditor=\"Caires, Lu{\\'i}s\nand Italiano, Giuseppe F.\nand Monteiro, Lu{\\'i}s\nand Palamidessi, Catuscia\nand Yung, Moti\",\ntitle=\"Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction\",\nbooktitle=\"Automata, Languages and Programming\",\nyear=\"2005\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"459--471\",\nabstract=\"We show that the signer can abuse the disavowal protocol in the Jakobsson-Sako-Impagliazzo designated-verifier signature scheme. In addition, we identify a new security property---non-delegatability---that is essential for designated-verifier signatures, and show that several previously proposed designated-verifier schemes are delegatable. We give a rigorous formalisation of the security for designated-verifier signature schemes, and propose a new and efficient designated-verifier signature scheme that is provably unforgeable under a tight reduction to the Decisional Diffie-Hellman problem in the non-programmable random oracle model, and non-delegatable under a loose reduction in the programmable random oracle model. As a direct corollary, we also get a new efficient conventional signature scheme that is provably unforgeable under a tight reduction to the Decisional Diffie-Hellman problem in the non-programmable random oracle plus common reference string model.\",\nisbn=\"978-3-540-31691-6\"\n}",{"title":3630,"type":228,"excerpt":3631,"year":3508,"authors":3632,"tags":3635,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Digital Signature in Automatic Analyses for Confidentiality against Active Adversaries","In Helger Lipmaa and Dieter Gollmann, editors, proceedings of Nordsec 2005, 10th Nordic Workshop on Secure IT Systems, pages 29-41, Tartu, Estonia, October 20-21, 2005.",[3633,3634],{"author":3143},{"author":219},[],{"title":3637,"type":228,"excerpt":3638,"year":3508,"authors":3639,"tags":3641,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Setting up a Computer Clobber Tournament at Tartu University","In IC Journal, Vol. 28, No. 1, pp 51-54.",[3640],{"author":141},[],{"title":3643,"type":228,"excerpt":3644,"year":3645,"authors":3646,"tags":3651,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Robots Find a Better Way: A Learning Method for Mobile Robot Navigation in Partially Unknown Environemnts","In F.Groen, N. Amoto, A. Bonarini, E. Yoshida and B. Kröse, editors, Proceedings of the 8th Conference on Intelligent Autonomous Systems (IAS8), Amsterdam, The Netherlands, 2004. IOS Press.",2004,[3647,3648,3649,3650],{"author":3540},{"author":3538},{"author":3494},{"author":1766},[],{"title":3653,"type":228,"excerpt":3654,"year":3645,"authors":3655,"tags":3658,"pdfFile":10,"pdfUrl":3659,"extendedUrl":10,"bibTeX":3660},"On Provably Secure Time-Stamping Schemes","In Pil Joong Lee (Ed.): Advances in Cryptology – ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004, Proceedings (LNCS 3329), pp 500-514, 2004.",[3656,3657],{"author":845},{"author":2118},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-30539-2_35",{"tag":10,"width":10,"height":10,"text":3661},"@InProceedings{10.1007\u002F978-3-540-30539-2_35,\nauthor=\"Buldas, Ahto\nand Saarepera, M{\\\"a}rt\",\neditor=\"Lee, Pil Joong\",\ntitle=\"On Provably Secure Time-Stamping Schemes\",\nbooktitle=\"Advances in Cryptology - ASIACRYPT 2004\",\nyear=\"2004\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"500--514\",\nabstract=\"It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collision-resistant but still no rigorous proofs have been published. We try to establish such proof and conclude that the existing security conditions are improper because they ignore precomputations by adversaries.After analyzing a simplistic patent filing scenario, we suggest a new security condition for time-stamping schemes that leads to a new security property of hash functions -- chain-resistance. We observe that if the variety of possible shapes of hash-chains is polynomial (and the verification procedure is suitably improved), then the time-stamping scheme becomes provably secure, assuming that the underlying hash function is collision-resistant. Finally, we show that in some sense, the restrictions in the security definition are necessary -- conventional black-box techniques are unable to prove that chain-resistance follows from collision-resistance.\",\nisbn=\"978-3-540-30539-2\"\n}\n",{"title":3663,"type":228,"excerpt":3664,"year":3645,"authors":3665,"tags":3669,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Ülevaade VRP ja TSP ülesannete lahendusmeetoditest","Tartu Ülikooli Tehnoloogiainstituut, august 2004.",[3666,3668],{"author":3667},"Jaeger, J.",{"author":141},[],{"title":3671,"type":228,"excerpt":3672,"year":3645,"authors":3673,"tags":3677,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Sound Computational Interpretation of Formal Encryption with Composed Keys","In Information Security and Cryptology – ICISC 2003, 6th International Conference, Seoul, Korea, November 2003, Revised Papers (LNCS 2971), pages 55-66, 2004.",[3674,3675],{"author":219},{"author":3676},"Corin, R.",[],{"title":3679,"type":228,"excerpt":3680,"year":3645,"authors":3681,"tags":3683,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Symmetric encryption in automatic analyses for confidentiality against active adversaries","In proceedings of 2004 IEEE Symposium on Security and Privacy, pages 71-85, Oakland, CA, May 9-12, 2004. IEEE Computer Society.",[3682],{"author":219},[],{"title":3685,"type":228,"excerpt":3686,"year":3645,"authors":3687,"tags":3694,"pdfFile":10,"pdfUrl":3695,"extendedUrl":10,"bibTeX":3696},"Analyzing Pair-Programmer’s Satisfaction with the Method, the Result, and the Partner","In Jutta Eckstein, Hubert Baumeister (Eds.): Extreme Programming and Agile Processes in Software Engineering, 5th International Conference, XP 2004, Garmisch-Partenkirchen, Germany, June 6-10, 2004, Proceedings (LNCS 3092), pages 246-249, 2004.",[3688,3689,3691,3693],{"author":1313},{"author":3690},"Seeba, A.",{"author":3692}," Salumaa, P.",{"author":984},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-24853-8_33",{"tag":10,"width":10,"height":10,"text":3697},"@InProceedings{10.1007\u002F978-3-540-24853-8_33,\nauthor=\"Puus, Uuno\nand Seeba, Asko\nand Salumaa, Priit\nand Heiberg, Sven\",\neditor=\"Eckstein, Jutta\nand Baumeister, Hubert\",\ntitle=\"Analyzing Pair-Programmer's Satisfaction with the Method, the Result, and the Partner\",\nbooktitle=\"Extreme Programming and Agile Processes in Software Engineering\",\nyear=\"2004\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"246--249\",\nabstract=\"This paper gives an overview of a programmer satisfaction survey in pair-programming experiment. The experiment took place at Institute of Computer Science, University of Tartu (UT), Estonia. The paper includes the problem statement, description of the questionnaire, and the survey results.\",\nisbn=\"978-3-540-24853-8\"\n}",{"title":3699,"type":228,"excerpt":3700,"year":3645,"authors":3701,"tags":3705,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Six wins hex tournament","In ICGA Journal, Vol. 27, No. 3, September 2004, pg 180.",[3702,3703],{"author":141},{"author":3704},"Björnsson, Y.",[],{"title":3707,"type":228,"excerpt":3708,"year":3709,"authors":3710,"tags":3715,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Scalable and Efficient PKI for Inter-Organizational Communication.","19th Annual Computer Security Applications Conference ACSAC 2003, Las Vegas, USA, December 8-12, 2003. Proceedings, pages 308-318, 2003.",2003,[3711,3712,3713,3714],{"author":981},{"author":845},{"author":879},{"author":1766},[],{"title":3717,"type":228,"excerpt":3718,"year":3709,"authors":3719,"tags":3722,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Electronic Signature System with Small Number of Private Keys","In proceedings of the 2nd Annual PKI Research Workshop.",[3720,3721],{"author":845},{"author":2118},[],{"title":3724,"type":228,"excerpt":3725,"year":3709,"authors":3726,"tags":3733,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Pair-Programming Effect on Developers Productivity","In “Extreme Programming and Agile Processes in Software Engineering, 4th International Conference, XP 2003, Genova, Italy, May 2003, Proceedings” (LNCS 2675), pages 215-224, 2003.",[3727,3728,3729,3731],{"author":984},{"author":1313},{"author":3730},"Salumaa, P.",{"author":3732}," Seeba, A.",[],{"title":3735,"type":228,"excerpt":3736,"year":3709,"authors":3737,"tags":3742,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Path Selection for Mobile Robots in Dynamic Environments","ECMR’03 Proceedings of the 1st European Conference on Mobile Robots, September 4-6, 2003, Radziejowice, Poland",[3738,3739,3740],{"author":3494},{"author":141},{"author":3741},"Heero, K. ",[],{"title":3744,"type":228,"excerpt":3745,"year":3709,"authors":3746,"tags":3749,"pdfFile":10,"pdfUrl":3750,"extendedUrl":10,"bibTeX":3751},"Covering the Path Space: A Casebase Analysis for Mobile Robot Path Planning","In Knowledge Based Systems, Volume 16, Issues 5-6, Pages 235-242 (July 2003), Elsevier.",[3747,3748],{"author":3494},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-4471-0651-7_1",{"tag":10,"width":10,"height":10,"text":3752},"@InProceedings{10.1007\u002F978-1-4471-0651-7_1,\nauthor=\"Kruusmaa, Maarja A.\nand Willemson, Jan\",\neditor=\"Bramer, Max\nand Preece, Alun\nand Coenen, Frans\",\ntitle=\"Covering the Path Space: A Casebase Analysis for Mobile Robot Path Planning\",\nbooktitle=\"Research and Development in Intelligent Systems XIX\",\nyear=\"2003\",\npublisher=\"Springer London\",\naddress=\"London\",\npages=\"3--16\",\nabstract=\"This paper presents a theoretical analysis of a casebase used for mobile robot path planning in dynamic environments. Unlike other case-based path planning approaches, we use a grid map to represent the environment that permits the robot to operate in unstructured environments. The objective of the mobile robot is to learn to choose paths that are less risky to follow. Our experiments with real robots have shown the efficiency of our concept. In this paper, we replace a heuristic path planning algorithm of the mobile robot with a seed casebase and prove the upper and lower bounds for the cardinality of the casebase. The proofs indicate that it is realistic to seed the casebase with some solutions to a path-finding problem so that no possible solution differs too much from some path in the casebase. This guarantees that the robot would theoretically find all paths from start to goal. The proof of the upper bound of the casebase cardinality shows that the casebase would in a long run grow too large and all possible solutions cannot be stored. In order to keep only the most efficient solutions the casebase has to be revised at run-time or some other measure of path difference has to be considered.\",\nisbn=\"978-1-4471-0651-7\"\n}\n",{"title":3754,"type":228,"excerpt":3755,"year":3709,"authors":3756,"tags":3758,"pdfFile":10,"pdfUrl":3759,"extendedUrl":10,"bibTeX":3760},"Handling Encryption in an Analysis for Secure Information Flow","In “Programming Languages and Systems, 12th European Symposium On Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7-11, 2003. Proceedings (LNCS 2618), pages 159-173, 2003.",[3757],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-36575-3_12",{"tag":10,"width":10,"height":10,"text":3761},"@InProceedings{10.1007\u002F3-540-36575-3_12,\nauthor=\"Laud, Peeter\",\neditor=\"Degano, Pierpaolo\",\ntitle=\"Handling Encryption in an Analysis for Secure Information Flow\",\nbooktitle=\"Programming Languages and Systems\",\nyear=\"2003\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"159--173\",\nabstract=\"This paper presents a program analysis for secure information flow. The analysis works on a simple imperative programming language containing a cryptographic primitive---encryption---as a possible operation. The analysis captures the intuitive qualities of the (lack of) information flow from a plaintext to its corresponding ciphertext. The analysis is proved correct with respect to a complexity-theoretical definition of the security of information flow. In contrast to the previous results, the analysis does not put any restrictions on the structure of the program, especially on the ways of how the program uses the encryption keys.\",\nisbn=\"978-3-540-36575-4\"\n}\n",{"title":3763,"type":228,"excerpt":3764,"year":3709,"authors":3765,"tags":3769,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Improving the Gnutella protocol against poisoning","Nordic Workshop on Secure IT Systems NordSec 2003.",[3766,3767,3768],{"author":1369},{"author":141},{"author":1856},[],{"title":3771,"type":228,"excerpt":3772,"year":3709,"authors":3773,"tags":3775,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Development orientations for OSS","UNDP\u002FUNESCO Free and Open Source Software (FOSS) Consultation, UNESCO HQ, Paris, France, November 24-25, 2003.",[3774],{"author":141},[],{"title":3777,"type":228,"excerpt":3778,"year":1287,"authors":3779,"tags":3783,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Eliminating counterevidence with applications to accountable certificate management","Journal of Computer Security 10 (2002), pages 273–296, IOS Press.",[3780,3781,3782],{"author":845},{"author":219},{"author":2928},[],{"title":3785,"type":228,"excerpt":3786,"year":1287,"authors":3787,"tags":3791,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Undeniable replies for database queries","In Proceedings of the Fifth International Baltic Conference on DB and IS, June 2002, Tallinn, Estonia, edited by Hele-Mai Haav and Ahto Kalja, Vol. 2, pp. 215-226.",[3788,3789,3790],{"author":845},{"author":1369},{"author":141},[],{"title":3793,"type":228,"excerpt":3794,"year":1287,"authors":3795,"tags":3799,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":3800},"XML based document management in Estonian legislative system","Presented in Fifth International Baltic Conference on DB and IS, June 2002, Tallinn, Estonia. Proceedings of the Fifth International Baltic Conference, BalticDB&IS 2002. Edited by Hele-Mai Haav and Ahto Kalja.",[3796,3797,3798],{"author":3538},{"author":1313},{"author":141},[],{"tag":10,"width":10,"height":10,"text":3801},"@inproceedings{10.5555\u002F648170.750809,\nauthor = {Willemson, Jan and Heero, Kristo and Puus, Uuno},\ntitle = {XML Based Document Management in Estonian Legislative System},\nyear = {2002},\nisbn = {9985894391},\npublisher = {Institute of Cybernetics at Tallin Technical University},\nbooktitle = {Proceedings of the Baltic Conference, BalticDB&IS 2002 - Volume 1},\npages = {321–330},\nnumpages = {10}\n}\n",{"title":3803,"type":228,"excerpt":3804,"year":1287,"authors":3805,"tags":3807,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Encryption Cycles and Two Views of Cryptography","In NORDSEC 2002 – Proceedings of the 7th Nordic Workshop on Secure IT Systems (Karlstad University Studies 2002:31), pages 85-100, Karlstad, Sweden, November 7-8, 2002.",[3806],{"author":1856},[],{"title":3809,"type":228,"excerpt":3810,"year":1287,"authors":3811,"tags":3814,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Pseudorandom permutations and equivalence of formal expressions(abstract)","In the 14th Nordic Workshop on Programming Theory, NWPT’02, pages 63-65, Tallinn, Estonia, November 20-22.",[3812,3813],{"author":219},{"author":10},[],{"title":3816,"type":228,"excerpt":3817,"year":978,"authors":3818,"tags":3822,"pdfFile":10,"pdfUrl":3823,"extendedUrl":10,"bibTeX":3824},"Improving the availability of time-stamping services","ACISP 2001, 11.-13. July 2001, Sydney, Australia.",[3819,3820,3821],{"author":981},{"author":845},{"author":2118},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-47719-5_29",{"tag":10,"width":10,"height":10,"text":3825},"@InProceedings{10.1007\u002F3-540-47719-5_29,\nauthor=\"Ansper, Arne\nand Buldas, Ahto\nand Saarepera, M{\\\"a}rt\nand Willemson, Jan\",\neditor=\"Varadharajan, Vijay\nand Mu, Yi\",\ntitle=\"Improving the Availability of Time-Stamping Services\",\nbooktitle=\"Information Security and Privacy\",\nyear=\"2001\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"360--375\",\nabstract=\"We discuss the availability questions that arise when digital time stamps are used for preserving the evidentiary value of electronic documents. We analyze the time-stamping protocols known to date and point out some weaknesses that have not been addressed so far in scientific literature. Without addressing and solving them, any advantage of the linkage-based protocols over the hash-and-sign time-stamping would be questionable. We present several new techniques and protocols for improving the availability of both the hash-and-sign and the linkage-based time-stamping services. We introduce fault-tolerant linking as a new concept to neutralize fault-sensitivity as the main weakness of linkage-based time-stamping.\",\nisbn=\"978-3-540-47719-8\"\n}",{"title":3827,"type":228,"excerpt":3828,"year":978,"authors":3829,"tags":3834,"pdfFile":10,"pdfUrl":3835,"extendedUrl":10,"bibTeX":3836},"Efficient long-term validation of digital signatures","Advances in Cryptology – PKC 2001, Springer-Verlag, LNCS 1992, pp 402-415, presented on PKC 2001, February 2001, Cheju Island, Korea.",[3830,3831,3832,3833],{"author":981},{"author":845},{"author":1369},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-44586-2_29",{"tag":10,"width":10,"height":10,"text":3837},"@InProceedings{10.1007\u002F3-540-44586-2_29,\nauthor=\"Ansper, Arne\nand Buldas, Ahto\nand Roos, Meelis\nand Willemson, Jan\",\neditor=\"Kim, Kwangjo\",\ntitle=\"Efficient Long-Term Validation of Digital Signatures\",\nbooktitle=\"Public Key Cryptography\",\nyear=\"2001\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"402--415\",\nabstract=\"Digitally signed documents (e.g. contracts) would quickly lose their validity if the signing keys were revoked or the signature scheme was broken. The conventional validation techniques have been designed just for ephemeral use of signatures and are impractical for long-term validation. We present a new scheme that: (1)pro vides fast revocation while giving no extra power to on-line service providers; (2)supports long-term validation; (3)is lightweight and scalable. All authors were supported by the Estonian SF, grant no. 4150\",\nisbn=\"978-3-540-44586-9\"\n}\n\n",{"title":3839,"type":228,"excerpt":3840,"year":3841,"authors":3842,"tags":3846,"pdfFile":10,"pdfUrl":3847,"extendedUrl":10,"bibTeX":3848},"Certificate Management using Undeniable Attestations","7th ACM Conference on Computer and Communications Security, pages 9-18, Athens, Greece, November 1-4, 2000.",2000,[3843,3844,3845],{"author":845},{"author":219},{"author":3017},[],"https:\u002F\u002Feprint.iacr.org\u002F2000\u002F027",{"tag":10,"width":10,"height":10,"text":3849},"@misc{cryptoeprint:2000\u002F027,\n      author = {Ahto Buldas and Peeter Laud and Helger Lipmaa},\n      title = {Accountable Certificate Management using Undeniable Attestations},\n      howpublished = {Cryptology ePrint Archive, Paper 2000\u002F027},\n      year = {2000},\n      note = {\\url{https:\u002F\u002Feprint.iacr.org\u002F2000\u002F027}},\n      url = {https:\u002F\u002Feprint.iacr.org\u002F2000\u002F027}\n}",{"title":3851,"type":228,"excerpt":3852,"year":3841,"authors":3853,"tags":3859,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Long-Term Validation of E-Documents","International Conference “Information Technologies and Telecommunications in the Baltic States – Baltic IT&T ‘2000”, April 6-7, Radisson SAS Daugava Hotel, Riga, Latvia.",[3854,3855,3857,3858],{"author":845},{"author":3856},"Praust, V.",{"author":1369},{"author":1766},[],{"title":3861,"type":228,"excerpt":3862,"year":3841,"authors":3863,"tags":3868,"pdfFile":10,"pdfUrl":3869,"extendedUrl":10,"bibTeX":3870},"Optimally Efficient Accountable Time-Stamping","In Yuliang Zheng and Hideki Imai, editors, Public Key Cryptography ‘2000, volume 1751 of Lecture Notes in Computer Science, pages 293-305, Melbourne, Australia, 18-20 January 2000. Springer Verlag.",[3864,3865,3866],{"author":845},{"author":2928},{"author":3867},"Schoenmakers, B.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-46588-1_20",{"tag":10,"width":10,"height":10,"text":3871},"@InProceedings{10.1007\u002F978-3-540-46588-1_20,\nauthor=\"Buldas, Ahto\nand Lipmaa, Helger\nand Schoenmakers, Berry\",\neditor=\"Imai, Hideki\nand Zheng, Yuliang\",\ntitle=\"Optimally Efficient Accountable Time-Stamping\",\nbooktitle=\"Public Key Cryptography\",\nyear=\"2000\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"293--305\",\nabstract=\"Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable if if it makes the TSA and other authorities accountable for their actions by enabling a principal to detect and later prove to a judge any frauds, including attempts to reorder time-stamps from the same round. We investigate the paradigm of time-stamping services based on simply connected graphs, and propose a simple, yet optimal, accountable time-stamping service, using what we call threaded tree schemes. We improve upon the previously best scheme by Buldas and Laud by reducing the size of a time stamp by a factor of about 3.786 and show that our construction is optimal in a strict sense. The new protocols also increase the trustworthiness of the publication process, which takes place at the end of each round.\",\nisbn=\"978-3-540-46588-1\"\n}\n\n",{"title":3873,"type":228,"excerpt":3874,"year":3841,"authors":3875,"tags":3880,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security Environment on Palm PDA","Annual Computer Security Applications Conference, 11-15 Dec 2000, Sheraton New Orleans, Louisiana, USA.",[3876,3878,3879],{"author":3877},"v",{"author":984},{"author":141},[],{"title":3882,"type":228,"excerpt":3883,"year":978,"authors":3884,"tags":3886,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Semantics and Program Analysis of Computationally Secure Information Flow.","In “Programming Languages and Systems, 10th European Symposium On Programming, ESOP 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genoa, Italy, April 2-6, 2001 Proceedings” (LNCS 2028), pages 77-91, 2001.",[3885],{"author":219},[],{"title":3888,"type":228,"excerpt":3889,"year":978,"authors":3890,"tags":3892,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Analysis for Object Inlining in Java","In JOSES: Java Optimization Strategies for Embedded Systems, Genoa, Italy, April 1, 2001.",[3891],{"author":219},[],{"title":3894,"type":228,"excerpt":3895,"year":1349,"authors":3896,"tags":3901,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Data Security in State Registers: Theory and Practice","International Conference and Exhibition “Information Technologies and Telecommunications in the Baltic States”, Riga, April 28-30 1999, p.69-72.",[3897,3898,3899],{"author":845},{"author":986},{"author":3900},"Sarv, M.",[],{"title":3903,"type":228,"excerpt":3904,"year":1376,"authors":3905,"tags":3908,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Digital Signatures, Timestamps and the corresponding Infrastructure","Küberneetika AS, Technical Report 1998-21, Jan 1998, 7 pages.\n",[3906,3907],{"author":845},{"author":2928},[],{"title":3910,"type":228,"excerpt":3911,"year":1376,"authors":3912,"tags":3915,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"New linking schemes for digital time-stamping","In The 1st International Conference on Information Security and Cryptology, pages 3-14, Seoul, Korea, 18-19 December 1998. © by Korea Institute of Information Security and Cryptology.",[3913,3914],{"author":845},{"author":1856},[],{"title":3917,"type":228,"excerpt":3918,"year":1376,"authors":3919,"tags":3924,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Time-Stamping with Binary Linking Schemes","In Hugo Krawczyk, editor, Advances in Cryptology – CRYPTO ’98, volume 1462 of Lecture Notes in Computer Science, pages 486-501. Springer-Verlag, 1998.",[3920,3921,3922,3923],{"author":845},{"author":219},{"author":2928},{"author":141},[],{"title":3926,"type":228,"excerpt":3927,"year":1349,"authors":3928,"tags":3933,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Notarizing Digital Signatures – Elimination of Certificate Revocation Lists","Cybernetica, Technical Report DO-UA-X-22-1299.",[3929,3930,3931],{"author":845},{"author":1369},{"author":3932},"Willemson, J",[],{"title":3935,"type":228,"excerpt":3936,"year":1349,"authors":3937,"tags":3939,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Automata accepting coupled-context-free languages","Research Report CS 102\u002F99. Institute of Cybernetics of Tallinn Technical University . Tartu. 15 pages. 1999.",[3938],{"author":219},[],{"title":3941,"type":228,"excerpt":3942,"year":1349,"authors":3943,"tags":3945,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Ogden’s lemma for coupled-context-free languages; the set of Lyndon words is not coupled-context-free","Research Report CS 103\u002F99. Institute of Cybernetics of Tallinn Technical University . Tartu. 15 pages. 1999.",[3944],{"author":219},[],{"title":3947,"type":46,"excerpt":3948,"year":1349,"authors":3949,"tags":3951,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"AES Candidates: A Survey of Implementations","Technical Report. 8 pages, 1999.",[3950],{"author":2928},[],{"title":3953,"type":228,"excerpt":3954,"year":1349,"authors":3955,"tags":3957,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Security in On-Line Governance","Survey prepared under UNESCO project “Developing Telematics and Information Networks for On-Line Governance”, June 1999.",[3956],{"author":2928},[],{"title":3959,"type":228,"excerpt":3960,"year":1376,"authors":3961,"tags":3963,"pdfFile":10,"pdfUrl":3964,"extendedUrl":10,"bibTeX":3965},"IDEA: A cipher for multimedia architectures?","In Stafford Tavares and Henk Meijer, editors, Selected Areas in Cryptography ’98, volume 1556 of Lecture Notes in Computer Science, pages 248-263, Kingston, Canada, 17–18 August 1998. Springer-Verlag.",[3962],{"author":3017},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-48892-8_20",{"tag":10,"width":10,"height":10,"text":3966},"@InProceedings{10.1007\u002F3-540-48892-8_20,\nauthor=\"Lipmaa, Helger\",\neditor=\"Tavares, Stafford\nand Meijer, Henk\",\ntitle=\"IDEA: A Cipher for Multimedia Architectures?\",\nbooktitle=\"Selected Areas in Cryptography\",\nyear=\"1999\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"248--263\",\nabstract=\"MMX is a new technology to accelerate multimedia applications on Pentium processors. We report an implementation of IDEA on a Pentium MMX that is 1:65 times faster than any previously known implementation on the Pentium. By parallelizing four IDEA's we reach an unprecedented 78 Mbits\u002Fs throughput per output block on a 166MHz MMX. In the light of rapidly increasing popularity of multimedia applications, causing more dedicated hardware to be built, and observing that most of the current block ciphers do not benefit from MMX, we raise the problem of designing block ciphers (and encryption modes) fully utilizing the basic operations of multimedia.\",\nisbn=\"978-3-540-48892-7\"\n}",{"title":3968,"type":228,"excerpt":3969,"year":1349,"authors":3970,"tags":3972,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Kvantarvutid","Eesti Füüsika Seltsi 9. aastaraamat, 1999. Pp. 102-125 [“Quantum Computing”, Ninth Annual of the Estonian Physical Society]",[3971],{"author":2928},[],{"title":3974,"type":228,"excerpt":3975,"year":1349,"authors":3976,"tags":3978,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Revocation Paradigms","April 15, 1999.",[3977],{"author":141},[],{"title":3980,"type":228,"excerpt":3981,"year":1391,"authors":3982,"tags":3986,"pdfFile":3987,"pdfUrl":3989,"extendedUrl":10,"bibTeX":3990},"Foundations of Programmable Secure Computation","Cryptography 5, no. 3: 22.",[3983,3984],{"author":236},{"author":3985},"Pullonen-Raudvere, P.",[],{"url":3988},"\u002Fuploads\u002Fcryptography_05_00022_v2_1d5eba2195.pdf","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fcryptography5030022",{"tag":10,"width":10,"height":10,"text":3991},"@Article{cryptography5030022,\nAUTHOR = {Laur, Sven and Pullonen-Raudvere, Pille},\nTITLE = {Foundations of Programmable Secure Computation},\nJOURNAL = {Cryptography},\nVOLUME = {5},\nYEAR = {2021},\nNUMBER = {3},\nARTICLE-NUMBER = {22},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F5\u002F3\u002F22},\nISSN = {2410-387X},\nABSTRACT = {This paper formalises the security of programmable secure computation focusing on simplifying security proofs of new algorithms for existing computation frameworks. Security of the frameworks is usually well established but the security proofs of the algorithms are often more intuitive than rigorous. This work specifies a transformation from the usual hybrid execution model to an abstract model that is closer to the intuition. We establish various preconditions that are satisfied by natural secure computation frameworks and protocols, thus showing that mostly the intuitive proofs suffice. More elaborate protocols might still need additional proof details.},\nDOI = {10.3390\u002Fcryptography5030022}\n}",{"title":3993,"type":228,"excerpt":3994,"year":1391,"authors":3995,"tags":4007,"pdfFile":10,"pdfUrl":4008,"extendedUrl":10,"bibTeX":4009},"Multi-level privacy analysis of business processes: the PLEAK toolset","International Journal on Software Tools for Technology Transfer. ",[3996,3997,3998,4000,4001,4002,4003,4004,4005,4006],{"author":1524},{"author":1975},{"author":3999},"Jääger, J.",{"author":1856},{"author":1959},{"author":355},{"author":217},{"author":3985},{"author":1961},{"author":1970},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10009-021-00636-w",{"tag":10,"width":10,"height":10,"text":4010},"@INPROCEEDINGS{pleak2021,  author={Dumas, Marlon and García-Bañuelos, Luciano and Jääger, Joosep and Laud, Peeter and Matulevičius, Raimundas and Pankova, Alisa and Pettai, Martin and Pullonen-Raudvere, Pille and Toots, Aivo and Tuuling, Reedik and Yerokhin, Maksym},  booktitle={International Journal on Software Tools for Technology Transfer},   title={Multi-level privacy analysis of business processes: the Pleak toolset},   year={2022},  volume={24},  number={2},  pages={183-203},  doi={10.1007\u002Fs10009-021-00636-w}}",{"title":4012,"type":228,"excerpt":4013,"year":1391,"authors":4014,"tags":4034,"pdfFile":4035,"pdfUrl":4037,"extendedUrl":10,"bibTeX":4038},"Toward a Common Performance and Effectiveness Terminology for Digital Proximity Tracing Applications. ","Frontiers in Digital Health.\n",[4015,4017,4019,4020,4022,4024,4026,4028,4030,4032],{"author":4016},"Lueks, W.",{"author":4018},"Benzler, J.",{"author":2194},{"author":4021},"Kirchner, G.",{"author":4023},"Lucas, R.",{"author":4025},"Oliveira, R.",{"author":4027},"Preneel, B.",{"author":4029},"Salathé, M.",{"author":4031},"Troncoso, C.",{"author":4033},"von Wyl, V.",[],{"url":4036},"\u002Fuploads\u002Ffdgth_03_677929_af4aa95347.pdf","https:\u002F\u002Fdoi.org\u002F10.3389\u002Ffdgth.2021.677929",{"tag":10,"width":10,"height":10,"text":4039},"@ARTICLE{10.3389\u002Ffdgth.2021.677929,\n  \nAUTHOR={Lueks, Wouter and Benzler, Justus and Bogdanov, Dan and Kirchner, Göran and Lucas, Raquel and Oliveira, Rui and Preneel, Bart and Salathé, Marcel and Troncoso, Carmela and von Wyl, Viktor},   \n\t \nTITLE={Toward a Common Performance and Effectiveness Terminology for Digital Proximity Tracing Applications},      \n\t\nJOURNAL={Frontiers in Digital Health},      \n\t\nVOLUME={3},           \n\t\nYEAR={2021},      \n\t  \nURL={https:\u002F\u002Fwww.frontiersin.org\u002Farticles\u002F10.3389\u002Ffdgth.2021.677929},       \n\t\nDOI={10.3389\u002Ffdgth.2021.677929},      \n\t\nISSN={2673-253X},   \n   \nABSTRACT={Digital proximity tracing (DPT) for Sars-CoV-2 pandemic mitigation is a complex intervention with the primary goal to notify app users about possible risk exposures to infected persons. DPT not only relies on the technical functioning of the proximity tracing application and its backend server, but also on seamless integration of health system processes such as laboratory testing, communication of results (and their validation), generation of notification codes, manual contact tracing, and management of app-notified users. Policymakers and DPT operators need to know whether their system works as expected in terms of speed or yield (performance) and whether DPT is making an effective contribution to pandemic mitigation (also in comparison to and beyond established mitigation measures, particularly manual contact tracing). Thereby, performance and effectiveness are not to be confused. Not only are there conceptual differences but also diverse data requirements. For example, comparative effectiveness measures may require information generated outside the DPT system, e.g., from manual contact tracing. This article describes differences between performance and effectiveness measures and attempts to develop a terminology and classification system for DPT evaluation. We discuss key aspects for critical assessments of whether the integration of additional data measurements into DPT apps may facilitate understanding of performance and effectiveness of planned and deployed DPT apps. Therefore, the terminology and a classification system may offer some guidance to DPT system operators regarding which measurements to prioritize. DPT developers and operators may also make conscious decisions to integrate measures for epidemic monitoring but should be aware that this introduces a secondary purpose to DPT. Ultimately, the integration of further information (e.g., regarding exact exposure time) into DPT involves a trade-off between data granularity and linkage on the one hand, and privacy on the other. More data may lead to better epidemiological information but may also increase the privacy risks associated with the system, and thus decrease public DPT acceptance. Decision-makers should be aware of the trade-off and take it into account when planning and developing DPT systems or intending to assess the added value of DPT relative to the existing contact tracing systems.}\n}",{"title":4041,"type":228,"excerpt":4042,"year":1391,"authors":4043,"tags":4051,"pdfFile":4052,"pdfUrl":4054,"extendedUrl":10,"bibTeX":10},"Privacy-Preserving Analytics, Processing and Data Management.","In: Caj Södergård, Tomas Mildorf, Ephrem Habyarimana, Arne J. Berre, Jose A. Fernandes, Christian Zinke-Wehlmann (Ed.). \nBig Data in Bioeconomy (157−168). Cham: Springer. DOI: 10.1007\u002F978-3-030-71069-9_12.\n",[4044,4046,4047,4049],{"author":4045},"Keerup, K.",{"author":135},{"author":4048},"Kubo, B",{"author":4050},"Auran, P. G.",[],{"url":4053},"\u002Fuploads\u002FKeerup2021_Chapter_Privacy_Preserving_Analytics_Pro_8a1ab42f59.pdf","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007%2F978-3-030-71069-9_12",{"title":4056,"type":228,"excerpt":4057,"year":1391,"authors":4058,"tags":4065,"pdfFile":4066,"pdfUrl":4068,"extendedUrl":10,"bibTeX":4069},"DiLizium: A Two-Party Lattice-Based Signature Scheme.","Entropy 2021, 23(8), 989.",[4059,4061,4063,4064],{"author":4060},"Vakarjuk, J.",{"author":4062},"Snetkov, N.",{"author":1766},{"author":10},[],{"url":4067},"\u002Fuploads\u002Fentropy_23_00989_v2_3e7c6d248e.pdf","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fe23080989",{"tag":10,"width":10,"height":10,"text":4070},"@Article{e23080989,\nAUTHOR = {Vakarjuk, Jelizaveta and Snetkov, Nikita and Willemson, Jan},\nTITLE = {DiLizium: A Two-Party Lattice-Based Signature Scheme},\nJOURNAL = {Entropy},\nVOLUME = {23},\nYEAR = {2021},\nNUMBER = {8},\nARTICLE-NUMBER = {989},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F1099-4300\u002F23\u002F8\u002F989},\nPubMedID = {34441129},\nISSN = {1099-4300},\nABSTRACT = {In this paper, we propose DiLizium: a new lattice-based two-party signature scheme. Our scheme is constructed from a variant of the Crystals-Dilithium post-quantum signature scheme. This allows for more efficient two-party implementation compared with the original but still derives its post-quantum security directly from the Module Learning With Errors and Module Short Integer Solution problems. We discuss our design rationale, describe the protocol in full detail, and provide performance estimates and a comparison with previous schemes. We also provide a security proof for the two-party signature computation protocol against a classical adversary. Extending this proof to a quantum adversary is subject to future studies. However, our scheme is secure against a quantum attacker who has access to just the public key and not the two-party signature creation protocol.},\nDOI = {10.3390\u002Fe23080989}\n}",{"title":4072,"type":228,"excerpt":4073,"year":1391,"authors":4074,"tags":4079,"pdfFile":10,"pdfUrl":4080,"extendedUrl":10,"bibTeX":4081},"Vote Secrecy and Voter Feedback in Remote Voting – Can We Have Both?","International Joint Conference on Electronic Voting E-Vote-ID 2021: Electronic Voting pp 140-154",[4075,4076,4078],{"author":141},{"author":4077},"Koitmäe, A.",{"author":2297},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-86942-7_10",{"tag":10,"width":10,"height":10,"text":4082},"@InProceedings{10.1007\u002F978-3-030-86942-7_10,\nauthor=\"Koitm{\\\"a}e, Arne\nand Willemson, Jan\nand Vinkel, Priit\",\neditor=\"Krimmer, Robert\nand Volkamer, Melanie\nand Duenas-Cid, David\nand Kulyk, Oksana\nand R{\\o}nne, Peter\nand Solvak, Mihkel\nand Germann, Micha\",\ntitle=\"Vote Secrecy and Voter Feedback in Remote Voting -- Can We Have Both?\",\nbooktitle=\"Electronic Voting\",\nyear=\"2021\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"140--154\",\nabstract=\"The principle of secrecy is one of the most important tools to guarantee a voting process without undue influence to the voter. However, the concepts of the secret ballot and secret vote have strong ties to voting in a controlled environment in the polling station, and remote voting methods like postal voting or Internet voting need to employ special measures and approaches to achieve similar results. At the same time, limited options of observing the tallying process remotely potentially undermines the trust in remote voting. This paper looks at possible ways of giving the voter some feedback and assurance in the integrity of their vote, at the same time adhering to the freedom of voting principle. The Estonian Internet voting system is used as a model case for evaluation of a possible feedback channel architecture.\",\nisbn=\"978-3-030-86942-7\"\n}",{"title":4084,"type":228,"excerpt":4085,"year":1391,"authors":4086,"tags":4090,"pdfFile":10,"pdfUrl":4091,"extendedUrl":10,"bibTeX":4092},"Mobile Voting - Still Too Risky? ","6th Workshop on Advances in Secure Electronic Voting, A Workshop Associated with Financial Crypto 2021.",[4087,4088,4089],{"author":984},{"author":1421},{"author":1766},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-63958-0_23",{"tag":10,"width":10,"height":10,"text":4093},"@InProceedings{10.1007\u002F978-3-662-63958-0_23,\nauthor=\"Heiberg, Sven\nand Krips, Kristjan\nand Willemson, Jan\",\neditor=\"Bernhard, Matthew\nand Bracciali, Andrea\nand Gudgeon, Lewis\nand Haines, Thomas\nand Klages-Mundt, Ariah\nand Matsuo, Shin'ichiro\nand Perez, Daniel\nand Sala, Massimiliano\nand Werner, Sam\",\ntitle=\"Mobile Voting -- Still Too Risky?\",\nbooktitle=\"Financial Cryptography and Data Security. FC 2021 International Workshops\",\nyear=\"2021\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"263--278\",\nabstract=\"This paper studies the challenges of creating a mobile device based voting client. We discuss the issues related to standalone and mobile browser based voting applications. In both cases we discuss the problems of vote privacy, integrity and voting channel availability. We conclude that neither of the options can currently achieve the level of security PC-based voting clients can provide, with the attack surface being larger in the case of mobile browser based voting application.\",\nisbn=\"978-3-662-63958-0\"\n}",{"title":4095,"type":228,"excerpt":4096,"year":1391,"authors":4097,"tags":4101,"pdfFile":4102,"pdfUrl":4104,"extendedUrl":10,"bibTeX":4105},"Parallel Privacy-Preserving Shortest Path Algorithms","Cryptography, 5 (4), 27:1−27:29",[4098,4099,4100],{"author":1394},{"author":219},{"author":1396},[],{"url":4103},"\u002Fuploads\u002Fcryptography_05_00027_v2_64491150b3.pdf","https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F5\u002F4\u002F27",{"tag":10,"width":10,"height":10,"text":4106},"@Article{cryptography5040027,\nAUTHOR = {Anagreh, Mohammad and Laud, Peeter and Vainikko, Eero},\nTITLE = {Parallel Privacy-Preserving Shortest Path Algorithms},\nJOURNAL = {Cryptography},\nVOLUME = {5},\nYEAR = {2021},\nNUMBER = {4},\nARTICLE-NUMBER = {27},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F5\u002F4\u002F27},\nISSN = {2410-387X},\nABSTRACT = {In this paper, we propose and present secure multiparty computation (SMC) protocols for single-source shortest distance (SSSD) and all-pairs shortest distance (APSD) in sparse and dense graphs. Our protocols follow the structure of classical algorithms—Bellman–Ford and Dijkstra for SSSD; Johnson, Floyd–Warshall, and transitive closure for APSD. As the computational platforms offered by SMC protocol sets have performance profiles that differ from typical processors, we had to perform extensive changes to the structure (including their control flow and memory accesses) and the details of these algorithms in order to obtain good performance. We implemented our protocols on top of the secret sharing based protocol set offered by the Sharemind SMC platform, using single-instruction-multiple-data (SIMD) operations as much as possible to reduce the round complexity. We benchmarked our protocols under several different parameters for network performance and compared our performance figures against each other and with ones reported previously.},\nDOI = {10.3390\u002Fcryptography5040027}\n}",{"title":4108,"type":228,"excerpt":4109,"year":1391,"authors":4110,"tags":4117,"pdfFile":4118,"pdfUrl":4120,"extendedUrl":10,"bibTeX":4121},"Implementing Privacy-Preserving Genotype Analysis with Consideration for Population Stratification","CRYPTOGRAPHY, 5 (3), ARTN 21.",[4111,4113,4114,4115,4116],{"author":4112},"Ostrak, A.",{"author":381},{"author":238},{"author":236},{"author":234},[],{"url":4119},"\u002Fuploads\u002Fcryptography_05_00021_v2_f16e087259.pdf","https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F5\u002F3\u002F21",{"tag":10,"width":10,"height":10,"text":4122},"\n@Article{cryptography5030021,\nAUTHOR = {Ostrak, Andre and Randmets, Jaak and Sokk, Ville and Laur, Sven and Kamm, Liina},\nTITLE = {Implementing Privacy-Preserving Genotype Analysis with Consideration for Population Stratification},\nJOURNAL = {Cryptography},\nVOLUME = {5},\nYEAR = {2021},\nNUMBER = {3},\nARTICLE-NUMBER = {21},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F5\u002F3\u002F21},\nISSN = {2410-387X},\nABSTRACT = {In bioinformatics, genome-wide association studies (GWAS) are used to detect associations between single-nucleotide polymorphisms (SNPs) and phenotypic traits such as diseases. Significant differences in SNP counts between case and control groups can signal association between variants and phenotypic traits. Most traits are affected by multiple genetic locations. To detect these subtle associations, bioinformaticians need access to more heterogeneous data. Regulatory restrictions in cross-border health data exchange have created a surge in research on privacy-preserving solutions, including secure computing techniques. However, in studies of such scale, one must account for population stratification, as under- and over-representation of sub-populations can lead to spurious associations. We improve on the state of the art of privacy-preserving GWAS methods by showing how to adapt principal component analysis (PCA) with stratification control (EIGENSTRAT), FastPCA, EMMAX and the genomic control algorithm for secure computing. We implement these methods using secure computing techniques—secure multi-party computation (MPC) and trusted execution environments (TEE). Our algorithms are the most complex ones at this scale implemented with MPC. We present performance benchmarks and a security and feasibility trade-off discussion for both techniques.},\nDOI = {10.3390\u002Fcryptography5030021}\n}\n",{"title":4124,"type":46,"excerpt":4125,"year":4126,"authors":4127,"tags":4137,"pdfFile":4138,"pdfUrl":10,"extendedUrl":10,"bibTeX":4140},"Digital Government Interoperability Platform Reference Architecture","Cybernetica research report, D-2-384, 2022.",2022,[4128,4130,4132,4133,4135],{"author":4129},"Toomere, T.",{"author":4131},"Kamalanathan, S.",{"author":879},{"author":4134},"Valdma, S.-M.",{"author":4136},"McBride, K.",[],{"url":4139},"\u002Fuploads\u002FDigital_Government_Interoperability_Platform_Reference_Architecture_4d2b8a83f6.pdf",{"tag":10,"width":10,"height":10,"text":4141},"@techreport{CYBER:R22,\n  author      = \"T. Toomere, S. Kamalanathan, M. Freudenthal, S-M. Valdma\",\n  title       = \"Digital Government Interoperability Platform Reference Architecture\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-384\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4143,"type":46,"excerpt":4144,"year":4126,"authors":4145,"tags":4151,"pdfFile":4152,"pdfUrl":10,"extendedUrl":10,"bibTeX":4154},"Common Criteria certification pathways for threshold signature systems","Cybernetica research report, D-2-385, 2022.",[4146,4148,4149],{"author":4147},"Buckland, M.",{"author":219},{"author":4150},"Valdma, S-M.",[],{"url":4153},"\u002Fuploads\u002FCommon_Criteria_certification_pathways_for_threshold_signature_systems_c71d90a374.pdf",{"tag":10,"width":10,"height":10,"text":4155},"@techreport{CYBER:R23,\n  author      = \"M. Buckland, P. Laud, S-M. Valdma\",\n  title       = \"Common Criteria certification pathways for threshold signature systems\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-385\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4157,"type":46,"excerpt":10,"year":151,"authors":4158,"tags":4165,"pdfFile":4166,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Infosüsteemide turve: I Turvarisk",[4159,4161,4162,4163],{"author":4160},"Hanson, V.",{"author":2907},{"author":986},{"author":4164},"Alliksoo, K.",[],{"url":4167},"\u002Fuploads\u002FInfosusteemide_turve_1_turvarisk_2009a_c9403cf087.pdf",{"title":4169,"type":46,"excerpt":4170,"year":4126,"authors":4171,"tags":4174,"pdfFile":4175,"pdfUrl":10,"extendedUrl":10,"bibTeX":4177},"Cybersecurity Domain Analysis","Cybernetica research report, D-2-391, 2022.",[4172],{"author":4173},"Cybernetica",[],{"url":4176},"\u002Fuploads\u002FCyber_Sec_Domain_Analysis_2_2f75b4512f.pdf",{"tag":4178,"width":10,"height":10,"text":4179},"R23","@techreport{CYBER:R24,\n  author      = \"Cybernetica\",\n  title       = \"Cybersecurity Domain Analysis\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-391\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4181,"type":14,"excerpt":4182,"year":4126,"authors":4183,"tags":4186,"pdfFile":4187,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Privacy and Coercion-Resistance in Voting","PhD thesis. University of Tartu, 2022.",[4184],{"author":4185},"Kristjan Krips",[],{"url":4188},"\u002Fuploads\u002Fkrips_kristjan_53a7cb8a7d.pdf",{"title":4190,"type":14,"excerpt":4191,"year":1391,"authors":4192,"tags":4195,"pdfFile":4196,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Towards Practical Post-Quantum Voting Protocol: Shorter Exact Lattice-Based Proof of a Shuffle","MSc thesis. University of Tartu, 2021.",[4193],{"author":4194},"Valeh Farzaliyev",[],{"url":4197},"\u002Fuploads\u002Ffarzaliyev_computerscience_2021_a97379717c.pdf",{"title":4199,"type":14,"excerpt":4200,"year":4126,"authors":4201,"tags":4204,"pdfFile":4205,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"eID Public Acceptance: Success Factors, Citizen Perception, and Impact of Electronic Identity","PhD thesis. Tallinn University of Technology, 2022.",[4202],{"author":4203},"Tsap, V.",[],{"url":4206},"\u002Fuploads\u002Fa8035cb15152472299338ceb800dd16d_1e4cbbaef3.pdf",{"title":4208,"type":14,"excerpt":4209,"year":1391,"authors":4210,"tags":4213,"pdfFile":4214,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Increasing flexibility in Estonian Tax and Customs Board information systems","MSc thesis. Tallinn University of Technology, 2021.",[4211],{"author":4212},"Toomast, K.",[],{"url":4215},"\u002Fuploads\u002Fa0b9eb5e466949f6b3c875e64a06a50e_2a030daab6.pdf",{"title":4217,"type":14,"excerpt":4218,"year":1391,"authors":4219,"tags":4222,"pdfFile":4223,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"C-language Parser & Analyzer for Hardware Performance Estimations","MSc thesis. Tallinn Univesity of Technology, 2021.",[4220],{"author":4221},"Meinberg, E.",[],{"url":4224},"\u002Fuploads\u002F3282441badd646bd990869122fe4566e_21eb7f2172.pdf",{"title":4226,"type":14,"excerpt":4227,"year":999,"authors":4228,"tags":4231,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Seamless Indoor and Outdoor Localization of Persons with Dementia","MSc thesis, Technical University of Berlin, 2020.",[4229],{"author":4230},"Armin Daniel Kisand",[],{"title":4233,"type":228,"excerpt":4234,"year":1391,"authors":4235,"tags":4240,"pdfFile":4241,"pdfUrl":4243,"extendedUrl":10,"bibTeX":4244},"Facial Recognition for Remote Electronic Voting – Missing Piece of the Puzzle or Yet Another Liability?","Conference Emerging Technologies for Authorization and Authentication. ETAA 2021.",[4236,4237,4238,4239],{"author":984},{"author":1421},{"author":141},{"author":2297},[],{"url":4242},"\u002Fuploads\u002F2021_1143_745403c36a.pdf","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-93747-8_6",{"tag":10,"width":10,"height":10,"text":4245},"@InProceedings{10.1007\u002F978-3-030-93747-8_6,\nauthor=\"Heiberg, Sven\nand Krips, Kristjan\nand Willemson, Jan\nand Vinkel, Priit\",\neditor=\"Saracino, Andrea\nand Mori, Paolo\",\ntitle=\"Facial Recognition for Remote Electronic Voting -- Missing Piece of the Puzzle or Yet Another Liability?\",\nbooktitle=\"Emerging Technologies for Authorization and Authentication\",\nyear=\"2021\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"77--93\",\nabstract=\"Reliable voter identification is one of the key requirements to guarantee eligibility and uniformity of elections. In a remote setting, this task becomes more complicated compared to voter identification at a physical polling station. In case strong cryptographic mechanisms are not available, biometrics is one of the available alternatives to consider. In this paper, we take a closer look at facial recognition as a possible remote voter identification measure. We cover technical aspects of facial recognition relevant to voting, discuss the main architectural decisions, and analyse some of the remaining open problems, including dispute resolution and privacy issues.\",\nisbn=\"978-3-030-93747-8\"\n}\n\n",{"title":4247,"type":228,"excerpt":4248,"year":4126,"authors":4249,"tags":4254,"pdfFile":4255,"pdfUrl":4257,"extendedUrl":10,"bibTeX":4258},"Relations Between Privacy, Verifiability, Accountability and Coercion-Resistance in Voting Protocols","Applied Cryptography and Network Security. 20th International Conference, ACNS 2022, Proceedings: Rome, Italy, June 20–23, 2022.  Ed. Giuseppe Ateniese, Daniele Venturi. Springer, 313−333. (Lecture Notes in Computer Science; 13269). DOI: 10.1007\u002F978-3-031-09234-3_16.",[4250,4252],{"author":4251},"Pankova, Alisa",{"author":4253},"Willemson, Jan",[],{"url":4256},"\u002Fuploads\u002F2021_1501_42f63282d3.pdf","https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-09234-3_16",{"tag":10,"width":10,"height":10,"text":4259},"@InProceedings{10.1007\u002F978-3-031-09234-3_16,\nauthor=\"Pankova, Alisa\nand Willemson, Jan\",\neditor=\"Ateniese, Giuseppe\nand Venturi, Daniele\",\ntitle=\"Relations Between Privacy, Verifiability, Accountability and Coercion-Resistance in Voting Protocols\",\nbooktitle=\"Applied Cryptography  and Network Security\",\nyear=\"2022\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"313--333\",\nabstract=\"This paper studies quantitative relationships between privacy, verifiability, accountability, and coercion-resistance of voting protocols. We adapt existing definitions to make them better comparable with each other and determine which bounds a certain requirement on one property poses on some other property. It turns out that, in terms of proposed definitions, verifiability and accountability do not necessarily put constraints on privacy and coercion-resistance. However, the relations between these notions become more interesting in the context of particular attacks. Depending on the assumptions and the attacker's goal, voter coercion may benefit from a too weak as well as too strong verifiability.\",\nisbn=\"978-3-031-09234-3\"\n}\n",{"title":4261,"type":228,"excerpt":4262,"year":4126,"authors":4263,"tags":4271,"pdfFile":4272,"pdfUrl":4274,"extendedUrl":10,"bibTeX":4275},"Internet voting in Estonia 2005–2019: Evidence from eleven elections","Government Information Quarterly, 39 (4),  101718. DOI: 10.1016\u002Fj.giq.2022.101718.",[4264,4266,4268,4269],{"author":4265},"Ehin, Piret",{"author":4267},"Solvak, Mihkel",{"author":4253},{"author":4270},"Vinkel, Priit",[],{"url":4273},"\u002Fuploads\u002F1_s2_0_S0740624_X2200051_X_main_da07854483.pdf","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0740624X2200051X\u002Fpdfft?md5=45b2d75962ffabec229472aca021e2b5&pid=1-s2.0-S0740624X2200051X-main.pdf",{"tag":10,"width":10,"height":10,"text":4276},"@article{EHIN2022101718,\ntitle = {Internet voting in Estonia 2005–2019: Evidence from eleven elections},\njournal = {Government Information Quarterly},\npages = {101718},\nyear = {2022},\nissn = {0740-624X},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.giq.2022.101718},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0740624X2200051X},\nauthor = {Piret Ehin and Mihkel Solvak and Jan Willemson and Priit Vinkel},\nkeywords = {Internet voting, i-voting, e-voting, Elections, Trust, Technology adoption, Vote verification},\nabstract = {Internet voting is a highly contested topic in electoral studies. This article examines Internet voting in Estonia over 15 years and 11 nation-wide elections. It focuses on the following questions: How is Internet voting organized and used in Estonia? How have the Estonian Internet voting system and its usage evolved over time? What are the preconditions and consequences of large-scale deployment of Internet voting? The results suggest that the rapid uptake and burgeoning usage rates reflect the system's embeddedness in a highly developed digital state and society. Through continuous technological and legal innovation and development, Estonia has built an advanced Internet voting system that complies with normative standards for democratic elections and is widely trusted and used by the voters. Internet voting has not boosted turnout in a setting where voting was already easily accessible. Neither has it created digital divides: Internet voting in Estonia has diffused to the extent that socio-demographic characteristics no longer predict usage. This, combined with massive uptake, reduces incentives for political parties to politicize the novel voting mode.}\n}",{"title":4278,"type":228,"excerpt":4279,"year":1391,"authors":4280,"tags":4286,"pdfFile":10,"pdfUrl":4287,"extendedUrl":10,"bibTeX":4288},"Cybersecurity Test Range for Autonomous Vehicle Shuttles","IEEE European Symposium on Security and Privacy Workshops 2021.",[4281,4283,4285],{"author":4282},"Roberts, A.",{"author":4284},"Maennel, O.",{"author":4062},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FEuroSPW54576.2021.00031",{"tag":10,"width":10,"height":10,"text":4289},"@INPROCEEDINGS{9583716,\n  author={Roberts, Andrew and Maennel, Olaf and Snetkov, Nikita},\n  booktitle={2021 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)}, \n  title={Cybersecurity Test Range for Autonomous Vehicle Shuttles}, \n  year={2021},\n  volume={},\n  number={},\n  pages={239-248},\n  doi={10.1109\u002FEuroSPW54576.2021.00031}}",{"title":4291,"type":228,"excerpt":4292,"year":1391,"authors":4293,"tags":4296,"pdfFile":10,"pdfUrl":4297,"extendedUrl":10,"bibTeX":4298},"PrivaLog: a Privacy-aware Logic Programming Language","Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming, 2021.",[4294,4295],{"author":3999},{"author":355},[],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3479394.3479410",{"tag":10,"width":10,"height":10,"text":4299},"@inproceedings{10.1145\u002F3479394.3479410,\nauthor = {J\\\"{a}\\\"{a}ger, Joosep and Pankova, Alisa},\ntitle = {PrivaLog: a Privacy-aware Logic Programming Language},\nyear = {2021},\nisbn = {9781450386890},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3479394.3479410},\ndoi = {10.1145\u002F3479394.3479410},\nabstract = {Logic Programming (LP) is a subcategory of declarative programming that is considered to be relatively simple for non-programmers. LP developers focus on describing facts and rules of a logical derivation, and do not need to think about the algorithms actually implementing the derivation. Secure multiparty computation (MPC) is a cryptographic technology that allows to perform computation on private data without actually seeing the data. In this paper, we bring together the notions of MPC and LP, allowing users to write privacy-preserving applications in logic programming language.},\nbooktitle = {Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming},\narticleno = {15},\nnumpages = {14},\nkeywords = {logic programming, program transformation, secure multiparty computation},\nlocation = {Tallinn, Estonia},\nseries = {PPDP '21}\n}",{"title":4301,"type":228,"excerpt":4302,"year":1391,"authors":4303,"tags":4307,"pdfFile":10,"pdfUrl":4308,"extendedUrl":10,"bibTeX":4309},"Mine Me but Don’t Single Me Out: Differentially Private Event Logs for Process Mining","2021 3rd International Conference on Process Mining (ICPM).",[4304,4305,4306],{"author":1564},{"author":355},{"author":1524},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FICPM53251.2021.9576852",{"tag":10,"width":10,"height":10,"text":4310},"@INPROCEEDINGS{9576852,\n  author={Elkoumy, Gamal and Pankova, Alisa and Dumas, Marlon},\n  booktitle={2021 3rd International Conference on Process Mining (ICPM)}, \n  title={Mine Me but Don’t Single Me Out: Differentially Private Event Logs for Process Mining}, \n  year={2021},\n  volume={},\n  number={},\n  pages={80-87},\n  doi={10.1109\u002FICPM53251.2021.9576852}}",{"title":4312,"type":228,"excerpt":4313,"year":1391,"authors":4314,"tags":4332,"pdfFile":10,"pdfUrl":4333,"extendedUrl":10,"bibTeX":4334},"Integrating and Validating Maritime Transport Security Services: Initial results from the CS4EU demonstrator","IC3 '21: 2021 Thirteenth International Conference on Contemporary Computing (IC3-2021).",[4315,4317,4319,4321,4323,4325,4327,4329,4331],{"author":4316},"Grigoriadis, C.",{"author":4318},"Papastergiou, S.",{"author":4320},"Kotzanikolaou, P.",{"author":4322},"Douligeris, C.",{"author":4324},"Dionysiou, A.",{"author":4326},"Elias, A.",{"author":4328},"Bernsmed, K.",{"author":4330},"Meland, P. H.",{"author":234},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3474124.3474213",{"tag":10,"width":10,"height":10,"text":4335},"@inproceedings{GPKD21,\nauthor = {Grigoriadis, Christos and Papastergiou, Spyridon and Kotzanikolaou, Panayiotis and Douligeris, Christos and Dionysiou, Antreas and Elias, Athanasopoulos and Bernsmed, Karin and Meland, Per H\\{a}kon and Kamm, Liina},\ntitle = {Integrating and Validating Maritime Transport Security Services: Initial Results from the CS4EU Demonstrator},\nyear = {2021},\nisbn = {9781450389204},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA}, \ndoi = {10.1145\u002F3474124.3474213}, \nbooktitle = {2021 Thirteenth International Conference on Contemporary Computing (IC3-2021)},\npages = {371–377},\nnumpages = {7},\nlocation = {Noida, India},\nseries = {IC3 '21} }",{"title":4337,"type":228,"excerpt":4338,"year":1391,"authors":4339,"tags":4342,"pdfFile":10,"pdfUrl":4343,"extendedUrl":10,"bibTeX":4344},"Attribute-based encryption for named data networking","ICN '21: Proceedings of the 8th ACM Conference on Information-Centric Networking",[4340,4341],{"author":1702},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3460417.3483371",{"tag":10,"width":10,"height":10,"text":4345},"@inproceedings{10.1145\u002F3460417.3483371,\nauthor = {Lenin, Aleksandr and Laud, Peeter},\ntitle = {Attribute-Based Encryption for Named Data Networking},\nyear = {2021},\nisbn = {9781450384605},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3460417.3483371},\ndoi = {10.1145\u002F3460417.3483371},\nabstract = {We compare and discuss the applicability and trade-offs of different attribute-based encryption (ABE) schemes to the possible use-cases of content-centric networking requiring end-to-end encryption of data with fine-grained access control, where the nature of content producers and consumers may vary, as well as the required expressivity of policies. We also report on the choice and implementation of an ABE scheme, as well as the overheads associated with its use.},\nbooktitle = {Proceedings of the 8th ACM Conference on Information-Centric Networking},\npages = {118–120},\nnumpages = {3},\nkeywords = {named data networking, Attribute-based encryption},\nlocation = {Paris, France},\nseries = {ICN '21}\n}",{"title":4347,"type":228,"excerpt":4348,"year":1391,"authors":4349,"tags":4351,"pdfFile":10,"pdfUrl":4352,"extendedUrl":10,"bibTeX":4353},"Efficient Permutation Protocol for MPC in the Head","Security and Trust Management. STM 2021.",[4350],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-91859-0_4",{"tag":10,"width":10,"height":10,"text":4354},"@InProceedings{10.1007\u002F978-3-030-91859-0_4,\nauthor=\"Laud, Peeter\",\neditor=\"Roman, Rodrigo\nand Zhou, Jianying\",\ntitle=\"Efficient Permutation Protocol for MPC in the Head\",\nbooktitle=\"Security and Trust Management\",\nyear=\"2021\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"62--80\",\nabstract=\"The MPC-in-the-head construction (Ishai et al., STOC'07) gives zero-knowledge proofs from secure multiparty computation (MPC) protocols. This paper presents an efficient MPC protocol for permuting a vector of values, making use of the relaxed communication model that can be handled by the MPC-in-the-head transformation. Our construction allows more efficient ZK proofs for relations expressed in the Random Access Machine (RAM) model. We benchmark our construction and compare it against other reasonable constructions of permutations under the MPC-in-the-head transformation and conclude that it significantly improves on efficiency and the range of applicability.\",\nisbn=\"978-3-030-91859-0\"\n}",{"title":4356,"type":228,"excerpt":4357,"year":1391,"authors":4358,"tags":4360,"pdfFile":10,"pdfUrl":4361,"extendedUrl":10,"bibTeX":4362},"Linear-Time Oblivious Permutations for SPDZ","Cryptology and Network Security. CANS 2021.",[4359],{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-92548-2_13",{"tag":10,"width":10,"height":10,"text":4363},"@InProceedings{10.1007\u002F978-3-030-92548-2_13,\nauthor=\"Laud, Peeter\",\neditor=\"Conti, Mauro\nand Stevens, Marc\nand Krenn, Stephan\",\ntitle=\"Linear-Time Oblivious Permutations for SPDZ\",\nbooktitle=\"Cryptology and Network Security\",\nyear=\"2021\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"245--252\",\nabstract=\"In this paper, we present a secure multiparty computation (MPC) subroutine for obliviously permuting elements in a private vector. The subroutine makes use of the private data representations used in the SPDZ protocol set; it can be composed with other privacy-preserving operations in this set and it also provides active security with abort. The online computation and communication complexity of the subroutine is linear in the length of the permuted vector.\",\nisbn=\"978-3-030-92548-2\"\n}",{"title":4365,"type":228,"excerpt":4366,"year":1391,"authors":4367,"tags":4379,"pdfFile":10,"pdfUrl":4380,"extendedUrl":10,"bibTeX":4381},"Decision Support for Sharing Data using Differential Privacy","2021 IEEE Symposium on Visualization for Cyber Security (VizSec).",[4368,4370,4372,4374,4376,4377],{"author":4369},"John, M. F. S.",{"author":4371},"Denker, G.",{"author":4373},"Laud,  P.",{"author":4375},"Martiny,  K.",{"author":355},{"author":4378},"Pavlovic, D.",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FVizSec53666.2021.00008",{"tag":10,"width":10,"height":10,"text":4382},"@INPROCEEDINGS{9629406,\n  author={John, Mark F. St. and Denker, Grit and Laud, Peeter and Martiny, Karsten and Pankova, Alisa and Pavlovic, Dusko},\n  booktitle={2021 IEEE Symposium on Visualization for Cyber Security (VizSec)}, \n  title={Decision Support for Sharing Data using Differential Privacy}, \n  year={2021},\n  volume={},\n  number={},\n  pages={26-35},\n  doi={10.1109\u002FVizSec53666.2021.00008}}\n",{"title":4384,"type":228,"excerpt":4385,"year":4126,"authors":4386,"tags":4390,"pdfFile":10,"pdfUrl":4391,"extendedUrl":10,"bibTeX":4392},"Privacy-Preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity","In Proceedings of the 8th International Conference on Information Systems Security and Privacy - ICISSP, 37-47, 2022",[4387,4388,4389],{"author":1394},{"author":219},{"author":1396},[],"https:\u002F\u002Fdoi.org\u002F10.5220\u002F0010775700003120",{"tag":10,"width":10,"height":10,"text":4393},"@conference{icissp22,\nauthor={Mohammad Anagreh. and Peeter Laud. and Eero Vainikko.},\ntitle={Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity},\nbooktitle={Proceedings of the 8th International Conference on Information Systems Security and Privacy - ICISSP,},\nyear={2022},\npages={37-47},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0010775700003120},\nisbn={978-989-758-553-1},\nissn={2184-4356},\n}",{"title":4395,"type":46,"excerpt":4396,"year":1391,"authors":4397,"tags":4404,"pdfFile":4405,"pdfUrl":2508,"extendedUrl":10,"bibTeX":4407},"Krüptoalgoritmid ning nende tugi teekides ja infosüsteemides","Uuring Riigi Infosüsteemi Ametile 2021.",[4398,4399,4400,4402,4403],{"author":1764},{"author":2142},{"author":4401},"Pruulmann-Vengerfeldt, J.",{"author":1421},{"author":141},[],{"url":4406},"\u002Fuploads\u002Fcryptoreport2021_1c7a89c594.pdf",{"tag":10,"width":10,"height":10,"text":4408}," @report{kryptoreport_2021, url={https:\u002F\u002Fwww.ria.ee\u002Fsites\u002Fdefault\u002Ffiles\u002Fpictures\u002Fcryptoreport2021.pdf}, title={Krüptoalgoritmid ning nende tugi teekides ja infosüsteemides}, institution={Cybernetica AS}, author={Oruaas, Mart and Kalu, Aivo and Pruulmann-Vengerfeldt, Jaak and Krips, Kristjan and Willemson, Jan}, year={2021}} ",{"title":4410,"type":46,"excerpt":4411,"year":1391,"authors":4412,"tags":4417,"pdfFile":4418,"pdfUrl":2508,"extendedUrl":10,"bibTeX":4420},"Biomeetrilise näotuvastusmeetme rakendamine elektroonilisel hääletamisel","Aruanne Riigi Infosüsteemi Ametile 2021.",[4413,4414,4415,4416],{"author":141},{"author":1421},{"author":1537},{"author":984},[],{"url":4419},"\u002Fuploads\u002Fbiomeetria_aruanne_4d16af788d.pdf",{"tag":10,"width":10,"height":10,"text":4421}," @report{biomeetria_2021, url={https:\u002F\u002Fwww.ria.ee\u002Fsites\u002Fdefault\u002Ffiles\u002Fcontent-editors\u002Fpublikatsioonid\u002Fbiomeetria-aruanne.pdf}, title={Biomeetrilise näotuvastusmeetme rakendamine elektroonilisel hääletamisel}, institution={Cybernetica AS}, author={Krips, Kristjan and Willemson, Jan and Siil, Triin and Heiberg, Sven}, year={2021}} ",{"title":4423,"type":228,"excerpt":4424,"year":1391,"authors":4425,"tags":4440,"pdfFile":4441,"pdfUrl":4443,"extendedUrl":10,"bibTeX":4444},"F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes","Sensors 2021, 21(14), 4933.",[4426,4428,4429,4430,4432,4433,4434,4436,4438],{"author":4427},"Attaullah, H.",{"author":1434},{"author":1432},{"author":4431},"Malik, S. U. R.",{"author":1444},{"author":1472},{"author":4435},"Zoha, A.",{"author":4437},"Arshad, K.",{"author":4439},"Imran, M. A.",[],{"url":4442},"\u002Fuploads\u002Fsensors_21_04933_v2_86f6a9a5c8.pdf","https:\u002F\u002Fdoi.org\u002F10.3390\u002Fs21144933",{"tag":10,"width":10,"height":10,"text":4445},"AUTHOR = {Attaullah, Hasina and Anjum, Adeel and Kanwal, Tehsin and Malik, Saif Ur Rehman and Asheralieva, Alia and Malik, Hassan and Zoha, Ahmed and Arshad, Kamran and Imran, Muhammad Ali},\nTITLE = {F-Classify: Fuzzy Rule Based Classification Method for Privacy Preservation of Multiple Sensitive Attributes},\nJOURNAL = {Sensors},\nVOLUME = {21},\nYEAR = {2021},\nNUMBER = {14},\nARTICLE-NUMBER = {4933},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F1424-8220\u002F21\u002F14\u002F4933},\nPubMedID = {34300673},\nISSN = {1424-8220},\nABSTRACT = {With the advent of smart health, smart cities, and smart grids, the amount of data has grown swiftly. When the collected data is published for valuable information mining, privacy turns out to be a key matter due to the presence of sensitive information. Such sensitive information comprises either a single sensitive attribute (an individual has only one sensitive attribute) or multiple sensitive attributes (an individual can have multiple sensitive attributes). Anonymization of data sets with multiple sensitive attributes presents some unique problems due to the correlation among these attributes. Artificial intelligence techniques can help the data publishers in anonymizing such data. To the best of our knowledge, no fuzzy logic-based privacy model has been proposed until now for privacy preservation of multiple sensitive attributes. In this paper, we propose a novel privacy preserving model F-Classify that uses fuzzy logic for the classification of quasi-identifier and multiple sensitive attributes. Classes are defined based on defined rules, and every tuple is assigned to its class according to attribute value. The working of the F-Classify Algorithm is also verified using HLPN. A wide range of experiments on healthcare data sets acknowledged that F-Classify surpasses its counterparts in terms of privacy and utility. Being based on artificial intelligence, it has a lower execution time than other approaches.},\nDOI = {10.3390\u002Fs21144933}\n}\n",{"title":4447,"type":228,"excerpt":4448,"year":1391,"authors":4449,"tags":4460,"pdfFile":4461,"pdfUrl":4463,"extendedUrl":10,"bibTeX":4464},"Dynamic Parameters-Based Reversible Data Transform (RDT) Algorithm in Recommendation System","IEEE Access, vol. 9, pp. 110011-110025, 2021.",[4450,4452,4453,4454,4455,4456,4458],{"author":4451},"Beg, S.",{"author":1434},{"author":1842},{"author":1436},{"author":1472},{"author":4457},"Sharma, N.",{"author":4459},"Waqar, O.",[],{"url":4462},"\u002Fuploads\u002FDynamic_Parameters_Based_Reversible_Data_Transform_RDT_Algorithm_in_Recommendation_System_6fc8a4ff06.pdf","https:\u002F\u002Fdoi.org\u002F10.1109\u002FACCESS.2021.3101150",{"tag":10,"width":10,"height":10,"text":4465},"@ARTICLE{9500237,\n  author={Beg, Saira and Anjum, Adeel and Ahmed, Mansoor and Rehman Malik, Saif Ur and Malik, Hassan and Sharma, Navuday and Waqar, Omer},\n  journal={IEEE Access}, \n  title={Dynamic Parameters-Based Reversible Data Transform (RDT) Algorithm in Recommendation System}, \n  year={2021},\n  volume={9},\n  number={},\n  pages={110011-110025},\n  doi={10.1109\u002FACCESS.2021.3101150}}",{"title":4467,"type":228,"excerpt":4468,"year":4126,"authors":4469,"tags":4476,"pdfFile":4477,"pdfUrl":4479,"extendedUrl":10,"bibTeX":4480},"Probabilistic modelling of deception-based security framework using markov decision process","Computers & Security, Volume 117, June 2022, Pages 102689",[4470,4471,4472,4474],{"author":1609},{"author":1436},{"author":4473},"Mansoori, M.",{"author":4475},"Welch, I.",[],{"url":4478},"\u002Fuploads\u002F1_s2_0_S0167404822000876_main_9409405e1a.pdf","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2021.102599",{"tag":10,"width":10,"height":10,"text":4481},"@article{HASEEB2022102599,\ntitle = {Probabilistic modelling of deception-based security framework using markov decision process},\njournal = {Computers & Security},\nvolume = {115},\npages = {102599},\nyear = {2022},\nissn = {0167-4048},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.cose.2021.102599},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167404821004223},\nauthor = {Junaid Haseeb and Saif Ur Rehman Malik and Masood Mansoori and Ian Welch},\nkeywords = {Deception, Security framework, Probabilistic model checking, IoT attacks, Markov decision process},\nabstract = {Existing studies using deception are ad-hoc attempts and few theoretical models have been designed to plan and integrate deception. We theorise that a pre-planning stage should be a fundamental part to obtain information about the attackers’ behaviours and the attack process by analysing known attacks. This will help plan and take defence actions by actively interacting with the attackers and predicting their actions using a probabilistic approach. This paper proposes a framework that provides a theoretical understanding to plan and integrate deception systematically and strategically. We also present probabilistic modelling to predict attack actions by formalising a real case of attacks captured on simulated Internet of Things devices as an Markov Decision Process (MDP) and verifying related properties using Probabilistic Symbolic Model Checker (PRISM). MDP’s properties verification results reveal that the associated cost for defence actions can be decreased by successfully predicting attackers’ probable actions. Moreover, we identify several quantification metrics (e.g. cost, reward, trust, incentive and penalty) to evaluate the performance of actions performed by attackers and defenders.}\n}",{"title":4483,"type":46,"excerpt":4484,"year":1391,"authors":4485,"tags":4493,"pdfFile":4494,"pdfUrl":4496,"extendedUrl":10,"bibTeX":4497},"A proof-of-concept solution for the secure private processing of longitudinal Mobile Network Operator data in support of official statistics","United Nations Economic Commission for Europe\u002FEurostat Expert Meeting on Statistical Data Confidentiality 2021",[4486,4488,4489,4490,4491],{"author":4487},"Ricciato, F.",{"author":1537},{"author":191},{"author":2230},{"author":4492},"Wirthmann, A.",[],{"url":4495},"\u002Fuploads\u002Funece2021_estat_cybernetica_v6_a03ba175ae.pdf","https:\u002F\u002Fec.europa.eu\u002Feurostat\u002Fcros\u002Fsites\u002Fdefault\u002Ffiles\u002Funece2021_estat_cybernetica_v6.pdf",{"tag":10,"width":10,"height":10,"text":4498},"@techreport{eurostat2021,\n  author      = \"Ricciato, F. and Siil, T. and Talviste, R. and Kubo, B. and Wirthmann, A.\",\n  title       = \"A proof-of-concept solution for the secure private processing of longitudinal Mobile Network Operator data in support of official statistics\",\n  institution = \"Eurostat, Unit A5\",\n  year        = \"2021\",\n}",{"title":4500,"type":14,"excerpt":4501,"year":4126,"authors":4502,"tags":4505,"pdfFile":4506,"pdfUrl":4508,"extendedUrl":10,"bibTeX":4509},"Privacy-Preserving Data Synthesis Using Trusted Execution Environments","MSc thesis. University of Tartu, 2022.",[4503],{"author":4504},"Karl Hannes Veskus",[],{"url":4507},"\u002Fuploads\u002FVeskus_M_Sc_computerscience_2022_fe493c7761.pdf","https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=74950&year=2022",{"tag":10,"width":10,"height":10,"text":4510},"@mastersthesis{MSc:Veskus22,\n  author  = {Karl Hannes Veskus},\n  title   = {{Privacy-Preserving Data Synthesis Using Trusted Execution Environments}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2022},\n  note    = {\\url{https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=74950}}\n} ",{"title":4512,"type":14,"excerpt":4501,"year":4126,"authors":4513,"tags":4516,"pdfFile":4517,"pdfUrl":4519,"extendedUrl":10,"bibTeX":4520},"Parallel and Cloud-Native Secure Multi-Party Computation",[4514],{"author":4515},"Tali, K.",[],{"url":4518},"\u002Fuploads\u002Ftali_computerscience_2022_3b482cbb04.pdf","https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=74954&year=2022",{"tag":10,"width":10,"height":10,"text":4521},"@mastersthesis{MSc:Tali22,\n  author  = {Kert Tali},\n  title   = {{Parallel and Cloud-Native Secure Multi-Party Computation}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2022},\n  note    = {\\url{https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=74954}}\n}",{"title":4523,"type":228,"excerpt":4524,"year":4126,"authors":4525,"tags":4529,"pdfFile":10,"pdfUrl":4530,"extendedUrl":10,"bibTeX":4531},"Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes","IEEE 35th Computer Security Foundations Symposium (CSF): Haifa, Israel, August 7-10, 2022.  IEEE, 96−111. DOI: 10.1109\u002FCSF54842.2022.9919656.",[4526,4527],{"author":4251},{"author":4528},"Laud, Peeter",[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F1911.12777",{"tag":10,"width":10,"height":10,"text":4532},"@INPROCEEDINGS {,\nauthor = {A. Pankova and P. Laud},\nbooktitle = {2022 2022 IEEE 35th Computer Security Foundations Symposium (CSF) (CSF)},\ntitle = {Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes},\nyear = {2022},\nvolume = {},\nissn = {},\npages = {96-111},\nabstract = {Differential privacy is a privacy technique with provable guarantees which is typically achieved by introducing noise to statistics before releasing them. The level of privacy is characterized by a certain numeric parameter e > 0, where smaller e means more privacy. However, there is no common agreement on how small e should be, and the actual likelihood of data leakage for the same e may vary for different released statistics and different datasets. In this paper, we show how to relate e to the increase in the probability of attacker's success in guessing something about the private data. The attacker's goal is stated as a Boolean expression over guessing particular categorical and numerical attributes, where numeric attributes can be guessed with some precision. The paper is built upon the definition of d-privacy, which is a generalization of e-differential privacy.}\nkeywords = {differential privacy;d-privacy;attacker advantage},\ndoi = {10.1109\u002FCSF54842.2022.00007},\nurl = {https:\u002F\u002Fdoi.ieeecomputersociety.org\u002F10.1109\u002FCSF54842.2022.00007},\npublisher = {IEEE Computer Society},\naddress = {Los Alamitos, CA, USA},\nmonth = {aug}\n}",{"title":4534,"type":228,"excerpt":4535,"year":4126,"authors":4536,"tags":4542,"pdfFile":10,"pdfUrl":4543,"extendedUrl":10,"bibTeX":4544},"Privacy-Preserving Parallel Computation of Minimum Spanning Forest","SN COMPUT. SCI. 3, 448 (2022)",[4537,4539,4540],{"author":4538},"Anagreh, Mohammad",{"author":4528},{"author":4541},"Vainikko, Eero",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42979-022-01331-6",{"tag":10,"width":10,"height":10,"text":4545},"TY  - JOUR\nAU  - Anagreh, Mohammad\nAU  - Laud, Peeter\nAU  - Vainikko, Eero\nPY  - 2022\nDA  - 2022\u002F08\u002F17\nTI  - Privacy-Preserving Parallel Computation of Minimum Spanning Forest\nJO  - SN Computer Science\nSP  - 448\nVL  - 3\nIS  - 6\nAB  - This paper proposes the first privacy-preserving computation of a minimum spanning forest (MSF) protocol based on Prim’s algorithm for dense graphs. The proposed protocol is a secret sharing based secure multiparty computation protocol that is perfectly designed to reduce the effects of network latency. We use the single-instruction-multiple-data (SIMD) paradigm to efficiently vectorize the protocol and lower its round complexity. Our protocols are capable of handling graphs with tens of thousands of vertices. We thoroughly benchmark our protocol for various graphs and network environments. This paper is an extended version of [1].\nSN  - 2661-8907\nUR  - https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs42979-022-01331-6\nDO  - 10.1007\u002Fs42979-022-01331-6\nID  - Anagreh2022\nER  - ",{"title":4547,"type":228,"excerpt":4548,"year":4126,"authors":4549,"tags":4555,"pdfFile":10,"pdfUrl":4556,"extendedUrl":10,"bibTeX":4557},"Russian Federal Remote E-Voting Scheme of 2021 – Protocol Description and Analysis","In Proceedings of the 2022 European Interdisciplinary Cybersecurity Conference (EICC '22). Association for Computing Machinery, New York, NY, USA, 29–35.",[4550,4552,4554],{"author":4551},"Vakarjuk, Jelizaveta",{"author":4553},"Snetkov, Nikita",{"author":4253},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3528580.3528586",{"tag":10,"width":10,"height":10,"text":4558},"@inproceedings{10.1145\u002F3528580.3528586,\nauthor = {Vakarjuk, Jelizaveta and Snetkov, Nikita and Willemson, Jan},\ntitle = {Russian Federal Remote E-Voting Scheme of 2021 – Protocol Description and Analysis},\nyear = {2022},\nisbn = {9781450396035},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3528580.3528586},\ndoi = {10.1145\u002F3528580.3528586},\nabstract = {This paper presents the details of one of the two cryptographic remote e-voting protocols used in the Russian parliamentary elections of 2021. As the official full version of the scheme has never been published by the election organisers, our paper aims at putting together as complete picture as possible from various incomplete sources. As all the currently available sources are in Russian, our presentation also aims at serving the international community by making the description available in English for further studies. In the second part of the paper, we provide an initial analysis of the protocol, identifying the potential weaknesses under the assumptions of corruption of the relevant key components. As a result, we conclude that the biggest problems of the system stem from weak voter authentication. In addition, as it was possible to vote from any device with a browser and Internet access, the attack surface was relatively large in general.},\nbooktitle = {Proceedings of the 2022 European Interdisciplinary Cybersecurity Conference},\npages = {29–35},\nnumpages = {7},\nkeywords = {E-voting, authentication, voting privacy and security},\nlocation = {Barcelona, Spain},\nseries = {EICC '22}\n}\n",{"title":4560,"type":10,"excerpt":4561,"year":4126,"authors":4562,"tags":4564,"pdfFile":10,"pdfUrl":4565,"extendedUrl":10,"bibTeX":4566},"Towards Identifying Social Factors behind (In)Efficiency of Voting Security Measures","In eJournal of eDemocracy and Open Government (JeDEM), vol. 14, no. 1 (2022), pages 72-85",[4563],{"author":85},[],"https:\u002F\u002Fdoi.org\u002F10.29379\u002Fjedem.v14i1.673",{"tag":10,"width":10,"height":10,"text":4567},"@article{WillemsonTowards2022,\n    title = {Towards Identifying Social Factors behind (In)Efficiency of Voting Security Measures},\n    journal = {JeDEM eJournal of eDemocracy and Open Government},\n    author = {Jan Willemson},\n    year = {2022},\n    volume = {14},\n    number = {1},\n    pages = {72--85},\n    DOI={https:\u002F\u002Fdoi.org\u002F10.29379\u002Fjedem.v14i1.673}\n        }",{"title":4569,"type":228,"excerpt":4570,"year":4126,"authors":4571,"tags":4573,"pdfFile":10,"pdfUrl":4574,"extendedUrl":10,"bibTeX":4575},"Fifty Shades of Personal Data – Partial Re-identification and GDPR","In:  Privacy Technologies and Policy. (88−96).  Springer. (Lecture Notes in Computer Science; 13279). DOI: 10.1007\u002F978-3-031-07315-1_6.",[4572],{"author":141},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-07315-1_6",{"tag":10,"width":10,"height":10,"text":4576},"@inproceedings{DBLP:conf\u002Fapf\u002FWillemson22,\n  author    = {Jan Willemson},\n  editor    = {Agnieszka Gryszczynska and\n               Przemyslaw Polanski and\n               Nils Gruschka and\n               Kai Rannenberg and\n               Monika Adamczyk},\n  title     = {Fifty Shades of Personal Data - Partial Re-identification and {GDPR}},\n  booktitle = {Privacy Technologies and Policy - 10th Annual Privacy Forum, {APF}\n               2022, Warsaw, Poland, June 23-24, 2022, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13279},\n  pages     = {88--96},\n  publisher = {Springer},\n  year      = {2022},\n  url       = {https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-07315-1\\_6},\n  doi       = {10.1007\u002F978-3-031-07315-1\\_6},\n  timestamp = {Thu, 02 Jun 2022 16:43:23 +0200},\n  biburl    = {https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fapf\u002FWillemson22.bib},\n  bibsource = {dblp computer science bibliography, https:\u002F\u002Fdblp.org}\n}",{"title":4578,"type":46,"excerpt":4579,"year":4126,"authors":4580,"tags":4583,"pdfFile":4584,"pdfUrl":10,"extendedUrl":10,"bibTeX":4586},"Biometrics in SplitKey using fuzzy extraction","Cybernetica research report D-2-456, 2022.",[4581],{"author":4582},"Kirss, J. M.",[],{"url":4585},"\u002Fuploads\u002FTech_Report_Biometrics_and_Fuzzy_Extraction_d9a6053ba0.pdf",{"tag":10,"width":10,"height":10,"text":4587},"@techreport{CYBER:R25,\n  author      = \"Cybernetica\",\n  title       = \"Biometrics in SplitKey using fuzzy extraction\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-456\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4589,"type":46,"excerpt":4590,"year":4126,"authors":4591,"tags":4593,"pdfFile":4594,"pdfUrl":10,"extendedUrl":10,"bibTeX":4596},"Modelling a cryptographic protocol with the purpose of formal verification in Isabelle","Cybernetica research report D-2-457, 2022.",[4592],{"author":4582},[],{"url":4595},"\u002Fuploads\u002FTech_Report_Formal_Verification_Project_0edab316a7.pdf",{"tag":10,"width":10,"height":10,"text":4597},"@techreport{CYBER:R26,\n  author      = \"Cybernetica\",\n  title       = \"Modelling a cryptographic protocol with the purpose of formal verification in Isabelle\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-457\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4599,"type":14,"excerpt":4182,"year":4126,"authors":4600,"tags":4602,"pdfFile":4603,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Diameter two properties in spaces of Lipschitz functions",[4601],{"author":4112},[],{"url":4604},"\u002Fuploads\u002Fostrak_andre_doktoritoeoe_e62468a096.pdf",{"title":4606,"type":14,"excerpt":4607,"year":4126,"authors":4608,"tags":4611,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":4612},"Secure Two-Party Computation for Application Development","MSc thesis. Aarhus University Department of Computer Science, 2022.",[4609],{"author":4610},"Eerikson, Hendrik",[],{"tag":10,"width":10,"height":10,"text":4613},"@mastersthesis{MSc:Eerikson22,\n  author  = {Hendrik Eerikson},\n  title   = {{Secure Two-Party Computation for Application Development}},\n  school  = {Aarhus University Department of Computer Science},\n  year    = {2022}}\n}",{"title":4615,"type":46,"excerpt":4616,"year":4126,"authors":4617,"tags":4620,"pdfFile":4621,"pdfUrl":10,"extendedUrl":10,"bibTeX":4623},"Integrating post-quantum cryptography to UXP","Cybernetica reseach report D-2-499, 2022.",[4618,4619],{"author":4062},{"author":4060},[],{"url":4622},"\u002Fuploads\u002FPQC_UXP_report_8c97d91552.pdf",{"tag":10,"width":10,"height":10,"text":4624},"@techreport{CYBER:R23,\n  author      = \"Snetkov, Nikita; Vakarjuk, Jelizaveta\",\n  title       = \"Integrating post-quantum cryptography to UXP\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-499\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4626,"type":228,"excerpt":4627,"year":4126,"authors":4628,"tags":4633,"pdfFile":4634,"pdfUrl":4636,"extendedUrl":10,"bibTeX":4637},"Improved Lattice-Based Mix-Nets for Electronic Voting","Information Security and Cryptology – ICISC 2021. Revised Selected Papers: The 24th Annual International Conference on Information Security and Cryptology; December 1-3 2021, Seoul, Korea.  Springer, 119−136. (Lecture Notes in Computer Science; 13218). DOI: 10.1007\u002F978-3-031-08896-4_6.",[4629,4630,4631],{"author":1419},{"author":141},{"author":4632},"Kaasik, J. K.",[],{"url":4635},"\u002Fuploads\u002FPQ_Mix_Net_5977c313c0.pdf","https:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-031-08896-4_6",{"tag":10,"width":10,"height":10,"text":4638},"@InProceedings{10.1007\u002F978-3-031-08896-4_6,\nauthor=\"Farzaliyev, Valeh\nand Willemson, Jan\nand Kaasik, Jaan Kristjan\",\neditor=\"Park, Jong Hwan\nand Seo, Seung-Hyun\",\ntitle=\"Improved Lattice-Based Mix-Nets for Electronic Voting\",\nbooktitle=\"Information Security and Cryptology -- ICISC 2021\",\nyear=\"2022\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"119--136\",\n}\nurl = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fabs\u002F10.1049\u002Fise2.12089},\neprint = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fpdf\u002F10.1049\u002Fise2.12089},\n}",{"title":4640,"type":228,"excerpt":4641,"year":4126,"authors":4642,"tags":4648,"pdfFile":10,"pdfUrl":4649,"extendedUrl":10,"bibTeX":4650},"Digital Government Interoperability and Data Exchange Platforms: Insights from a Twenty Country Comparative Study","ACM International Conference Proceeding Series. ACM Digital Library, 90−97.",[4643,4644,4645,4646,4647],{"author":4136},{"author":4131},{"author":4134},{"author":4129},{"author":879},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3560107.3560123",{"tag":10,"width":10,"height":10,"text":4651},"@inproceedings{10.1145\u002F3560107.3560123,\nauthor = {McBride, Keegan and Kamalanathan, Sujani and Valdma, Sandhra-Mirella and Toomere, Taavi and Freudenthal, Margus},\ntitle = {Digital Government Interoperability and Data Exchange Platforms: Insights from a Twenty Country Comparative Study},\nyear = {2022},\nisbn = {9781450396356},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3560107.3560123},\ndoi = {10.1145\u002F3560107.3560123},\nabstract = {To build a digital government, interoperability and data exchange are essential, this is often facilitated by a specific platform - a government interoperability and data exchange platform. However, the research into such platforms, their theorization and conceptualization, structure, and core technical makeup is scant. This paper makes initial contributions to this area of research and creates knew knowledge about these government interoperability and data exchange platforms by conducting a twenty country comparative case study. This paper makes a number of important contributions: it offers a new conceptualization of these platforms; offers new insights into their structure, form, and governance; identifies critical building blocks for the future of these platforms; and highlights a number of important areas for future research.},\nbooktitle = {Proceedings of the 15th International Conference on Theory and Practice of Electronic Governance},\npages = {90–97},\nnumpages = {8},\nkeywords = {Platform, Interoperability, Digital Government, Innovation, Data Exchange, e-Government},\nlocation = {Guimar\\~{a}es, Portugal},\nseries = {ICEGOV '22}\n}",{"title":4653,"type":228,"excerpt":4654,"year":4126,"authors":4655,"tags":4673,"pdfFile":10,"pdfUrl":4674,"extendedUrl":10,"bibTeX":4675},"Deploying decentralized, privacy-preserving proximity tracing","Communications of the ACM, 65 (9), 48−57",[4656,4657,4658,4660,4662,4664,4666,4668,4670,4672],{"author":4031},{"author":135},{"author":4659},"Bugnion, E.",{"author":4661},"Chatel, S.",{"author":4663},"Cremers, C.",{"author":4665},"Gürses, S.",{"author":4667},"Hubaux, J.-P.",{"author":4669},"Jackson, D.",{"author":4671},"Larus, J. R.",{"author":4016},[],"https:\u002F\u002Fdoi.org\u002F10.1145\u002F3524107",{"tag":10,"width":10,"height":10,"text":4676},"@article{10.1145\u002F3524107,\nauthor = {Troncoso, Carmela and Bogdanov, Dan and Bugnion, Edouard and Chatel, Sylvain and Cremers, Cas and G\\\"{u}rses, Seda and Hubaux, Jean-Pierre and Jackson, Dennis and Larus, James R. and Lueks, Wouter and Oliveira, Rui and Payer, Mathias and Preneel, Bart and Pyrgelis, Apostolos and Salath\\'{e}, Marcel and Stadler, Theresa and Veale, Michael},\ntitle = {Deploying Decentralized, Privacy-Preserving Proximity Tracing},\nyear = {2022},\nissue_date = {September 2022},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nvolume = {65},\nnumber = {9},\nissn = {0001-0782},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3524107},\ndoi = {10.1145\u002F3524107},\nabstract = {Lessons from a pandemic.},\njournal = {Commun. ACM},\nmonth = {aug},\npages = {48–57},\nnumpages = {10}\n}",{"title":4678,"type":46,"excerpt":4679,"year":4126,"authors":4680,"tags":4682,"pdfFile":4683,"pdfUrl":10,"extendedUrl":10,"bibTeX":4685},"Actively Secure 2-Party Computation Protocols and Frameworks","Cybernetica research report, D-2-501, 2022.",[4681],{"author":1545},[],{"url":4684},"\u002Fuploads\u002F2022_tech_report_Actively_Secure_2_Party_Computation_Protocols_and_Frameworks_c976b89955_9a3e1d8aeb.pdf",{"tag":10,"width":10,"height":10,"text":4686},"@techreport{CYBER:R28,\n  author      = \"Eerikson, Hendrik\",\n  title       = \"Actively Secure 2 Party Computation Protocols and Frameworks\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-501\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4688,"type":228,"excerpt":4689,"year":4690,"authors":4691,"tags":4699,"pdfFile":10,"pdfUrl":4700,"extendedUrl":10,"bibTeX":4701},"Server-Supported Decryption for Mobile Devices","In: Lenzini, G., Meng, W. (eds) Security and Trust Management. STM 2022. Lecture Notes in Computer Science, vol 13867. Springer, Cham.",2023,[4692,4694,4696,4697],{"author":4693},"Jelizaveta Vakarjuk",{"author":4695},"Nikita Snetkov",{"author":33},{"author":4698},"Johanna Maria Kirss",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-29504-1_4",{"tag":10,"width":10,"height":10,"text":4702},"@InProceedings{10.1007\u002F978-3-031-29504-1_4,\nauthor=\"Kirss, Johanna Maria\nand Laud, Peeter\nand Snetkov, Nikita\nand Vakarjuk, Jelizaveta\",\neditor=\"Lenzini, Gabriele\nand Meng, Weizhi\",\ntitle=\"Server-Supported Decryption for Mobile Devices\",\nbooktitle=\"Security and Trust Management\",\nyear=\"2023\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"71--81\",\nabstract=\"We propose a threshold encryption scheme with two-party decryption, where one of the keyshares may be stored and used in a device that is able to provide only weak security for it. We state the security properties the scheme needs to have to support such use-cases, and construct a scheme with these properties. Our construction is based on the ElGamal cryptosystem, with additional zero-knowledge proofs that can provide IND-CCA security, and resistance to offline guessing attacks.\",\nisbn=\"978-3-031-29504-1\"\n}\n",{"title":4704,"type":228,"excerpt":4705,"year":4690,"authors":4706,"tags":4709,"pdfFile":10,"pdfUrl":4710,"extendedUrl":10,"bibTeX":4711},"A Comparison-Based Methodology for the Security Assurance of Novel Systems","In: Katsikas, S., et al. Computer Security. ESORICS 2022 International Workshops. ESORICS 2022. Lecture Notes in Computer Science, vol 13785. Springer, Cham.",[4707,4708],{"author":4060},{"author":219},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-25460-4_36",{"tag":10,"width":10,"height":10,"text":4712},"@InProceedings{10.1007\u002F978-3-031-25460-4_36,\nauthor=\"Laud, Peeter\nand Vakarjuk, Jelizaveta\",\neditor=\"Katsikas, Sokratis\nand Cuppens, Fr{\\'e}d{\\'e}ric\nand Kalloniatis, Christos\nand Mylopoulos, John\nand Pallas, Frank\nand Pohle, J{\\\"o}rg\nand Sasse, M. Angela\nand Abie, Habtamu\nand Ranise, Silvio\nand Verderame, Luca\nand Cambiaso, Enrico\nand Maestre Vidal, Jorge\nand Sotelo Monge, Marco Antonio\nand Albanese, Massimiliano\nand Katt, Basel\nand Pirbhulal, Sandeep\nand Shukla, Ankur\",\ntitle=\"A Comparison-Based Methodology for the Security Assurance of Novel Systems\",\nbooktitle=\"Computer Security. ESORICS 2022 International Workshops\",\nyear=\"2023\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"625--644\",\nabstract=\"In this paper, we advocate the position that the security certification of one system should make the certification of other similar systems easier, if one can present the evidence that the second system is at least as secure as the first system. We present a development of this idea, stating the components of such comparative evidence. We stretch the idea of propagating the certification to less similar systems, if one can present a sequence of systems from the certified one to the novel one, where each system is evidenced to be at least as secure as the previous one. We apply our methodology to authentication systems, where we show that a system based on threshold cryptography is at least as secure as widely used smartcard-based systems.\",\nisbn=\"978-3-031-25460-4\"\n}",{"title":4714,"type":46,"excerpt":4715,"year":4126,"authors":4716,"tags":4718,"pdfFile":4719,"pdfUrl":10,"extendedUrl":10,"bibTeX":4721},"Integration of Sharemind MPC into Carbyne Stack","Cybernetica research report, D-2-502, 2022",[4717],{"author":4173},[],{"url":4720},"\u002Fuploads\u002FSharemind_MPC_CS_integration_a01ca476a7.pdf",{"tag":10,"width":10,"height":10,"text":4722},"@TECHREPORT{CYBER:M27,\n  author = {Sharemind MPC Team},\n  title = {Integration of Sharemind\nMPC into Carbyne Stack},\n  institution = {Cybernetica AS},\n  year = {2022},\n  number = {D-2-502},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Flibrary}} ",{"title":4724,"type":14,"excerpt":4725,"year":4690,"authors":4726,"tags":4729,"pdfFile":10,"pdfUrl":4730,"extendedUrl":10,"bibTeX":10},"Privacy-Preserving Parallel Computations for Graph Problems","PhD thesis. University of Tartu, 2023.",[4727],{"author":4728},"Mohammad Anagreh",[],"https:\u002F\u002Fdspace.ut.ee\u002Fhandle\u002F10062\u002F89770",{"title":4732,"type":46,"excerpt":4733,"year":4690,"authors":4734,"tags":4737,"pdfFile":4738,"pdfUrl":10,"extendedUrl":10,"bibTeX":4740},"Zero-Knowledge Proofs for mDL Authentication","Cybernetica research report, D-2-525, 2023.",[4735],{"author":4736},"Nestra, Härmel",[],{"url":4739},"\u002Fuploads\u002FZero_Knowledge_Proofs_report_89d6bc5438.pdf",{"tag":10,"width":10,"height":10,"text":4741},"@techreport{CYBER:R29,\n  author      = \"Härmel Nestra\",\n  title       = \"Zero-Knowledge Proofs for mDL Authentication\",\n  institution = \"Cybernetica AS\",\n  year        = \"2023\",\n number = \"D-2-525\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4743,"type":46,"excerpt":4744,"year":4690,"authors":4745,"tags":4747,"pdfFile":4748,"pdfUrl":10,"extendedUrl":10,"bibTeX":4750},"Interoperability Architecture for Digital Government Organization","Cybernetica research report, D-2-522, 2023.",[4746],{"author":4129},[],{"url":4749},"\u002Fuploads\u002FInteroperability_Architecture_for_Digital_Government_Organization_1_0_D_2_522_v1_1_e6b3c2919e.pdf",{"tag":10,"width":10,"height":10,"text":4751},"@techreport{CYBER:R31,\n  author      = \"T. Toomere\",\n  title       = \"Interoperability Architecture for Digital Government Organization\",\n  institution = \"Cybernetica AS\",\n  year        = \"2023\",\n number = \"D-2-384\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4753,"type":228,"excerpt":4754,"year":95,"authors":4755,"tags":4756,"pdfFile":10,"pdfUrl":4757,"extendedUrl":10,"bibTeX":4758},"The Application of I-Voting for Estonian Parliamentary Elections of 2011","International Conference on E-Voting and Identity, Vote-ID 2011: E-Voting and Identity pp 208–223",[],[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-642-32747-6_13",{"tag":10,"width":10,"height":10,"text":4759},"@InProceedings{10.1007\u002F978-3-642-32747-6_13,\nauthor=\"Heiberg, Sven\nand Laud, Peeter\nand Willemson, Jan\",\neditor=\"Kiayias, Aggelos\nand Lipmaa, Helger\",\ntitle=\"The Application of I-Voting for Estonian Parliamentary Elections of 2011\",\nbooktitle=\"E-Voting and Identity\",\nyear=\"2012\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"208--223\",\nabstract=\"Estonia has implemented internet voting as a method to participate in various types of elections since 2005. In Riigikogu (parliament) Elections of 2011, over 140,000 voters used the internet voting method. The share of votes cast over the internet among all votes was 24.3{\\%}. In light of this popularity it is questioned by various stakeholders whether internet voting can be implemented correctly and securely to support electoral principles such as uniformity. This paper gives an overview of the Estonian Internet Voting System and analyzes events that occurred during the Riigikogu Elections of 2011.\",\nisbn=\"978-3-642-32747-6\"\n}\n",{"title":4761,"type":228,"excerpt":4762,"year":4690,"authors":4763,"tags":4772,"pdfFile":10,"pdfUrl":4773,"extendedUrl":10,"bibTeX":10},"CACS: A Cloud Privacy-Preserving Attribute Management System","ARES '23: Proceedings of the 18th International Conference on Availability, Reliability and Security. August 2023. Article No.: 122. Pages 1–9.",[4764,4765,4767,4768,4770,4771],{"author":657},{"author":4766},"Burak Can Kus",{"author":33},{"author":4769},"Kin Long Leung",{"author":4695},{"author":4693},[],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3600160.3605022",{"title":4775,"type":10,"excerpt":4776,"year":4690,"authors":4777,"tags":4787,"pdfFile":10,"pdfUrl":4788,"extendedUrl":10,"bibTeX":4789},"Lattice-Based Threshold Signature Implementation for Constrained Devices","Dobias, P.; Ricci, S.; Dzurenda, P.; Malina, L. and Snetkov, N. (2023). Lattice-Based Threshold Signature Implementation for Constrained Devices. In Proceedings of the 20th International Conference on Security and Cryptography - SECRYPT; ISBN 978-989-758-666-8; ISSN 2184-7711, SciTePress, pages 724-730.",[4778,4779,4781,4783,4785],{"author":4062},{"author":4780},"Malina, L.",{"author":4782},"Dzurenda, P.",{"author":4784},"Ricci, S.",{"author":4786},"Dobias, P.",[],"https:\u002F\u002Fwww.scitepress.org\u002FLink.aspx?doi=10.5220\u002F0012112700003555",{"tag":10,"width":10,"height":10,"text":4790},"@conference{secrypt23,\nauthor={Patrik Dobias. and Sara Ricci. and Petr Dzurenda. and Lukas Malina. and Nikita Snetkov.},\ntitle={Lattice-Based Threshold Signature Implementation for Constrained Devices},\nbooktitle={Proceedings of the 20th International Conference on Security and Cryptography - SECRYPT},\nyear={2023},\npages={724-730},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0012112700003555},\nisbn={978-989-758-666-8},\nissn={2184-7711},\n}",{"title":4792,"type":46,"excerpt":4793,"year":4690,"authors":4794,"tags":4796,"pdfFile":4797,"pdfUrl":10,"extendedUrl":10,"bibTeX":4799},"On Collaborative Artificial Intelligence and Cybersecurity Operations Between Allies","Cybernetica research report, D-2-539, 2023.",[4795],{"author":135},[],{"url":4798},"\u002Fuploads\u002FOn_Collaborative_Artificial_Intelligence_and_Cybersecurity_Operations_Between_Allies_a3d39fbdb8_a0c06d68aa.pdf",{"tag":10,"width":10,"height":10,"text":4800},"@techreport{CYBER:R30,\n  author      = \"Dan Bogdanov\",\n  title       = \"On Collaborative Artificial Intelligence and Cybersecurity Operations Between Allies\",\n  institution = \"Cybernetica AS\",\n  year        = \"2023\",\n number = \"D-2-539\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4802,"type":46,"excerpt":4803,"year":4690,"authors":4804,"tags":4805,"pdfFile":4806,"pdfUrl":10,"extendedUrl":10,"bibTeX":4808},"PEDB Use Cases For Identity Providers","Cybernetica report 2023.",[],[],{"url":4807},"\u002Fuploads\u002Fpedb_use_cases_for_identity_providers_ceab21731a.pdf",{"tag":10,"width":10,"height":10,"text":4809},"@techreport{CYBER:R33,\n  author      = \"Cybernetica reseachers\",\n  title       = \"PEDB Use Cases For Identity Providers\",\n  institution = \"Cybernetica AS\",\n  year        = \"2023\",\n number = \"D-16-380\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4811,"type":46,"excerpt":4812,"year":4690,"authors":4813,"tags":4815,"pdfFile":4816,"pdfUrl":10,"extendedUrl":10,"bibTeX":4818},"Actively Secure 2-Party Computation Protocols and Frameworks v1.1","Cybernetica research report, D-2-501 v1.1 , 2023.",[4814],{"author":1545},[],{"url":4817},"\u002Fuploads\u002F2022_tech_report_Actively_Secure_2_Party_Computation_Protocols_and_Frameworks_c976b89955.pdf",{"tag":10,"width":10,"height":10,"text":4819},"@techreport{CYBER:R28,\n  author      = \"Eerikson, Hendrik\",\n  title       = \"Actively Secure 2 Party Computation Protocols and Frameworks v1.1\",\n  institution = \"Cybernetica AS\",\n  year        = \"2022\",\n number = \"D-2-501\",\n  address = \\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}\n}",{"title":4821,"type":46,"excerpt":4822,"year":4690,"authors":4823,"tags":4825,"pdfFile":4826,"pdfUrl":10,"extendedUrl":10,"bibTeX":4828},"Integration of Sharemind MPC into Carbyne Stack v1.1","Cybernetica technical report, D-2-502, 2023.",[4824],{"author":4173},[],{"url":4827},"\u002Fuploads\u002F2023_tech_report_Integration_of_Sharemind_MPC_into_Carbyne_Stack_D_2_502_v1_2_1_7bd321f9a5.pdf",{"tag":10,"width":10,"height":10,"text":4829},"@TECHREPORT{CYBER:M27,\n  author = {Sharemind MPC Team},\n  title = {Integration of Sharemind MPC into Carbyne Stack v1.1},\n  institution = {Cybernetica AS},\n  year = {2022},\n  number = {D-2-502},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Flibrary}} ",{"title":4831,"type":46,"excerpt":55,"year":1376,"authors":4832,"tags":4840,"pdfFile":4841,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Infosüsteemide turve II. Turbetehnoloogia",[4833,4834,4835,4837,4838],{"author":4160},{"author":845},{"author":4836},"Lippmaa, H.",{"author":981},{"author":4839},"Tulit, V.",[],{"url":4842},"\u002Fuploads\u002FInfosysteemide_turve_2_turbetehnoloogia_2024_64b66dfefa.pdf",{"title":4844,"type":10,"excerpt":4845,"year":48,"authors":4846,"tags":4848,"pdfFile":4849,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Usaldatava täitmiskeskkonna (TEE) kasutamispõhimõtte kirjeldus muinasjututegelastega","Versioon 1.1",[4847],{"author":4173},[],{"url":4850},"\u002Fuploads\u002FTEE_kirjeldus_muinasjututegelastega_Cybernetica_1_1_b8cfd857f8.pdf",{"title":4852,"type":228,"excerpt":4853,"year":48,"authors":4854,"tags":4859,"pdfFile":4860,"pdfUrl":4862,"extendedUrl":10,"bibTeX":4863},"Trust Assumptions in Voting Systems","Conference paper, pp 309–329.",[4855,4856,4857,4858],{"author":4693},{"author":4185},{"author":4695},{"author":1320},[],{"url":4861},"\u002Fuploads\u002Ftrust_45e6543906.pdf","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-031-54129-2_18",{"tag":10,"width":10,"height":10,"text":4864},"@InProceedings{10.1007\u002F978-3-031-54129-2_18,\nauthor=\"Krips, Kristjan\nand Snetkov, Nikita\nand Vakarjuk, Jelizaveta\nand Willemson, Jan\",\neditor=\"Katsikas, Sokratis\nand Abie, Habtamu\nand Ranise, Silvio\nand Verderame, Luca\nand Cambiaso, Enrico\nand Ugarelli, Rita\nand Pra{\\c{c}}a, Isabel\nand Li, Wenjuan\nand Meng, Weizhi\nand Furnell, Steven\nand Katt, Basel\nand Pirbhulal, Sandeep\nand Shukla, Ankur\nand Ianni, Michele\nand Dalla Preda, Mila\nand Choo, Kim-Kwang Raymond\nand Pupo Correia, Miguel\nand Abhishta, Abhishta\nand Sileno, Giovanni\nand Alishahi, Mina\nand Kalutarage, Harsha\nand Yanai, Naoto\",\ntitle=\"Trust Assumptions in Voting Systems\",\nbooktitle=\"Computer Security. ESORICS 2023 International Workshops\",\nyear=\"2024\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"309--329\",\nabstract=\"Assessing and comparing the security level of different voting systems is non-trivial as the technical means provided for and societal assumptions made about various systems differ significantly. However, trust assumptions concerning the involved parties are present for all voting systems and can be used as a basis for comparison. This paper discusses eight concrete voting systems with different properties, 12 types of parties involved, and seven general security goals set for voting. The emerging trust relations are assessed for their criticality, and the result is used for comparison of the considered systems.\",\nisbn=\"978-3-031-54129-2\"\n}\n",{"title":4866,"type":228,"excerpt":4867,"year":48,"authors":4868,"tags":4871,"pdfFile":4872,"pdfUrl":4874,"extendedUrl":10,"bibTeX":10},"Post-quantum trails: an educational board game about post-quantum cryptography","Tartu University Library.",[4869,4870],{"author":4693},{"author":4695},[],{"url":4873},"\u002Fuploads\u002Ftrails_3ea6a12aa0.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002F1e6331fb-6e1c-4374-a2c1-2ef2eab3190a",{"title":4876,"type":10,"excerpt":4877,"year":48,"authors":4878,"tags":4882,"pdfFile":4883,"pdfUrl":4885,"extendedUrl":10,"bibTeX":10},"TOPCOAT: towards practical two-party Crystals-Dilithium","Discov Computing 27, 18 (2024).",[4879,4880,4881],{"author":4695},{"author":4693},{"author":33},[],{"url":4884},"\u002Fuploads\u002Fs10791_024_09449_2_fcb2e88c27.pdf","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10791-024-09449-2",{"title":4887,"type":14,"excerpt":4888,"year":4690,"authors":4889,"tags":4892,"pdfFile":4893,"pdfUrl":4895,"extendedUrl":10,"bibTeX":10},"eMRTD autentimise toe lisamine Web eID projekti","MSc thesis. University of Tartu, 2023.",[4890],{"author":4891},"Silver Maala",[],{"url":4894},"\u002Fuploads\u002FMaala_M_Sc_computer_science_2023_105f0c7a3f.pdf","https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=77633",{"title":4897,"type":14,"excerpt":4888,"year":4690,"authors":4898,"tags":4901,"pdfFile":4902,"pdfUrl":4904,"extendedUrl":10,"bibTeX":10},"Turvatundliku enesehindamise raamistiku projekteerimine",[4899],{"author":4900},"Maria Pibilota Murumaa",[],{"url":4903},"\u002Fuploads\u002Fmurumaa_cybersecurity_2023_55150b310e.pdf","https:\u002F\u002Fcomserv.cs.ut.ee\u002Fati_thesis\u002Fdatasheet.php?id=77886",{"title":4906,"type":228,"excerpt":4907,"year":48,"authors":4908,"tags":4912,"pdfFile":10,"pdfUrl":4913,"extendedUrl":10,"bibTeX":4914},"Comparing security levels of postal and Internet voting","Information Security Journal: A Global Perspective, 1–21",[4909,4910,4911],{"author":4693},{"author":4695},{"author":85},[],"https:\u002F\u002Fwww.tandfonline.com\u002Fdoi\u002Ffull\u002F10.1080\u002F19393555.2024.2410332#d1e313",{"tag":10,"width":10,"height":10,"text":55},{"title":4916,"type":228,"excerpt":4917,"year":48,"authors":4918,"tags":4922,"pdfFile":10,"pdfUrl":4923,"extendedUrl":10,"bibTeX":4924},"Identifying Obstacles of PQC Migration in E-Estonia","16th International Conference on Cyber Conflict: Over the Horizon (CyCon), Tallinn, Estonia, 2024, pp. 63-81",[4919,4920,4921],{"author":4693},{"author":4695},{"author":33},[],"https:\u002F\u002Fieeexplore.ieee.org\u002Fdocument\u002F10685570",{"tag":10,"width":10,"height":10,"text":4925},"@INPROCEEDINGS{10685570,\n  author={Vakarjuk, Jelizaveta and Snetkov, Nikita and Laud, Peeter},\n  booktitle={2024 16th International Conference on Cyber Conflict: Over the Horizon (CyCon)}, \n  title={Identifying Obstacles of PQC Migration in E-Estonia}, \n  year={2024},\n  volume={},\n  number={},\n  pages={63-81},\n  keywords={Systematics;Quantum computing;Ecosystems;Planning;Cryptography;Computer security;Electronic government;post-quantum cryptography;e-governance;migration},\n  doi={10.23919\u002FCyCon62501.2024.10685570}}",{"title":4927,"type":46,"excerpt":4928,"year":48,"authors":4929,"tags":4931,"pdfFile":4932,"pdfUrl":10,"extendedUrl":10,"bibTeX":4934},"Krüptograafiliste turbelahenduste hindamisvõime loomise projekt – I etapp","Project report, 2024.",[4930],{"author":2506},[],{"url":4933},"\u002Fuploads\u002FKrueptograafiliste_turbelahenduste_hindamisvoime_loomise_projekti_I_etapi_aruande_avalik_versioon_c46de79c28.pdf",{"tag":10,"width":10,"height":10,"text":4935},"@TECHREPORT{CYBER:D-31-1,\n  author = {Cybernetica},\n  title = {Krüptograafiliste turbelahenduste hindamisvõime loomise projekt – I etapp},\n  institution = {Cybernetica AS},\n  year = {2024},\n  number = {D-31-1},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Flibrary}} ",{"title":4937,"type":228,"excerpt":4938,"year":4126,"authors":4939,"tags":4952,"pdfFile":10,"pdfUrl":4953,"extendedUrl":10,"bibTeX":4954},"Towards situational aware cyber-physical systems: A security-enhancing use case of blockchain-based digital twins","Computers in Industry, 141,  ARTN 103699. DOI: 10.1016\u002Fj.compind.2022.103699.",[4940,4942,4944,4946,4948,4950],{"author":4941},"Suhail, Sabah",{"author":4943},"Malik, Saif Ur Rehman",{"author":4945},"Jurdak, Raja",{"author":4947},"Hussain, Rasheed",{"author":4949},"Matulevicius, Raimundas",{"author":4951},"Svetinovic, Davor",[],"https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0166361522000963\u002Fpdfft?md5=1dcc24eda20b0911b8469f9fcc7d8136&pid=1-s2.0-S0166361522000963-main.pdf",{"tag":10,"width":10,"height":10,"text":4955},"@article{SUHAIL2022103699,\ntitle = {Towards situational aware cyber-physical systems: A security-enhancing use case of blockchain-based digital twins},\njournal = {Computers in Industry},\nvolume = {141},\npages = {103699},\nyear = {2022},\nissn = {0166-3615},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.compind.2022.103699},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0166361522000963},\nauthor = {Sabah Suhail and Saif Ur Rehman Malik and Raja Jurdak and Rasheed Hussain and Raimundas Matulevičius and Davor Svetinovic},\nkeywords = {Anomaly detection, Blockchain, Cyber-Physical Systems (CPSs), Digital Twins (DTs), Industrial Control Systems (ICSs), Internet of Things (IoT), Industry 4.0},\nabstract = {The complexity of cyberattacks in Cyber-Physical Systems (CPSs) calls for a mechanism that can evaluate critical infrastructures’ operational behaviour and security without affecting the operation of live systems. In this regard, Digital Twins (DTs) provide actionable insights through monitoring, simulating, predicting, and optimizing the state of CPSs. Through the use cases, including system testing and training, detecting system misconfigurations, and security testing, DTs strengthen the security of CPSs throughout the product lifecycle. However, such benefits of DTs depend on an assumption about data integrity and security. Data trustworthiness becomes more critical while integrating multiple components among different DTs owned by various stakeholders to provide an aggregated view of the complex physical system. This article envisions a blockchain-based DT framework as Trusted Twins for Securing Cyber-Physical Systems (TTS-CPS). With the automotive industry as a CPS use case, we demonstrate the viability of the TTS-CPS framework through a proof of concept. To utilize reliable system specification data for building the process knowledge of DTs, we ensure the trustworthiness of data-generating sources through Integrity Checking Mechanisms (ICMs). Additionally, Safety and Security (S&S) rules evaluated during simulation are stored and retrieved from the blockchain, thereby establishing more understanding and confidence in the decisions made by the underlying systems. Finally, we perform formal verification of the TTS-CPS.}\n}",{"title":4957,"type":228,"excerpt":4958,"year":4126,"authors":4959,"tags":4967,"pdfFile":10,"pdfUrl":4968,"extendedUrl":10,"bibTeX":4969},"Towards enhanced threat modelling and analysis using a Markov Decision Process","Computer Communications, 194,  282−291. DOI: 10.1016\u002Fj.comcom.2022.07.038.",[4960,4961,4963,4965],{"author":4943},{"author":4962},"Anjum, Adeel",{"author":4964},"Moqurrab, Syed Atif",{"author":4966},"Srivastava, Gautam",[],"https:\u002F\u002Fdx.doi.org\u002F10.1016\u002Fj.comcom.2022.07.038",{"tag":10,"width":10,"height":10,"text":4970},"@article{MALIK2022282,\ntitle = {Towards enhanced threat modelling and analysis using a Markov Decision Process},\njournal = {Computer Communications},\nvolume = {194},\npages = {282-291},\nyear = {2022},\nissn = {0140-3664},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.comcom.2022.07.038},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS014036642200281X},\nauthor = {Saif U.R. Malik and Adeel Anjum and Syed Atif Moqurrab and Gautam Srivastava},\nkeywords = {Attack Trees, Formal methods, Markov Decision Process, Probabilistic model checking, Security analysis},\nabstract = {The complexity of socio-technical systems using Ambient Intelligence (AmI) and the Internet of Things (IoT) is growing exponentially, involving numerous entities, such as humans, infrastructures, and cyber systems. Achieving and maintaining a specified level of security and privacy in such systems is challenging and crucial. Attack Tree is a powerful technique used in safety and reliability engineering. In this paper, we attempted to enhance Attack Tree analysis by transforming it into a Markov Decision Process (MDP) model. We propose an algorithm to transform an Attack Tree into an MDP model. We argue that formal methods, such as probabilistic model checking can significantly improve the security analysis capabilities. Moreover, the mixture of MDP and probabilistic model checking can overcome the limitations of Attack Trees, such as state explosion, scalability, and manual interaction. We used a probabilistic model checker, namely PRISM to model an attack scenario and perform security analysis on it. To demonstrate the significance, we took a real-world use case and performed a probabilistic analysis on it. The results revealed that formal analysis can prove certain properties, which were not possible to verify using attack trees.}\n}",{"title":4972,"type":228,"excerpt":4973,"year":4126,"authors":4974,"tags":4991,"pdfFile":10,"pdfUrl":4992,"extendedUrl":10,"bibTeX":4993},"Rapid Screening for Variants of Concern in Routine SARS-CoV-2 PCR Diagnostics","Journal of Vaccines amp; Vaccination,  1−2. DOI: 10.1101\u002F2021.04.01.21254755.",[4975,4977,4979,4981,4983,4985,4987,4989],{"author":4976},"Naaber, Paul",{"author":4978},"Lahesaare, Andrio",{"author":4980},"Truu, Laura",{"author":4982},"Soojärv, Andres",{"author":4984},"Adamson, Ainika",{"author":4986},"Beljaev, Kaido",{"author":4988},"Aamisepp, Rainar",{"author":4990},"Ratnik, Kaspar",[],"https:\u002F\u002Fwww.medrxiv.org\u002Fcontent\u002F10.1101\u002F2021.04.01.21254755v1.full.pdf",{"tag":10,"width":10,"height":10,"text":4994},"@article {Naaber2021.04.01.21254755,\n\tauthor = {Naaber, Paul and Lahesaare, Andrio and Truu, Laura and Sooj{\\\"a}rv, Andres and Adamson, Ainika and Beljaev, Kaido and Aamisepp, Rainar and Ratnik, Kaspar},\n\ttitle = {Rapid screening for variants of concern in routine SARS-CoV-2 PCR diagnostics},\n\telocation-id = {2021.04.01.21254755},\n\tyear = {2021},\n\tdoi = {10.1101\u002F2021.04.01.21254755},\n\tpublisher = {Cold Spring Harbor Laboratory Press},\n\tabstract = {The emerging spread of variants of concern (VOC) of SARS-CoV-2 has been noted in several countries worldwide during last months. VOCs associated with increased transmissibility and morality. Sequencing is the gold standard for investigation of variants, however it is expensive and time-consuming. S-dropout routine monitoring in combination with VOC screening by RT-PCR is a useful tool for VOC surveillance.Competing Interest StatementThe authors have declared no competing interest.Funding StatementStudy was funded by SYNLAB EestiAuthor DeclarationsI confirm all relevant ethical guidelines have been followed, and any necessary IRB and\u002For ethics committee approvals have been obtained.YesThe details of the IRB\u002Foversight body that provided approval or exemption for the research described are given below:Not applicableAll necessary patient\u002Fparticipant consent has been obtained and the appropriate institutional forms have been archived.YesI understand that all clinical trials and any other prospective interventional studies must be registered with an ICMJE-approved registry, such as ClinicalTrials.gov. I confirm that any such study reported in the manuscript has been registered and the trial registration ID is provided (note: if posting a prospective study registered retrospectively, please provide a statement in the trial ID field explaining why the study was not registered in advance).YesI have followed all appropriate research reporting guidelines and uploaded the relevant EQUATOR Network research reporting checklist(s) and other pertinent material as supplementary files, if applicable.YesData is available by request},\n\tURL = {https:\u002F\u002Fwww.medrxiv.org\u002Fcontent\u002Fearly\u002F2021\u002F04\u002F07\u002F2021.04.01.21254755},\n\teprint = {https:\u002F\u002Fwww.medrxiv.org\u002Fcontent\u002Fearly\u002F2021\u002F04\u002F07\u002F2021.04.01.21254755.full.pdf},\n\tjournal = {medRxiv}\n}",{"title":4996,"type":228,"excerpt":4997,"year":4126,"authors":4998,"tags":5013,"pdfFile":10,"pdfUrl":5014,"extendedUrl":10,"bibTeX":10},"A Deep Learning-Based Privacy-Preserving Model for Smart Healthcare in Internet of Medical Things Using Fog Computing","Wireless Personal Communications, 126 (3),  2379−2401. DOI: 10.1007\u002Fs11277-021-09323-0.",[4999,5000,5002,5003,5005,5007,5009,5011],{"author":4964},{"author":5001},"Tariq, Noshina",{"author":4962},{"author":5004},"Asheralieva, Alia",{"author":5006},"Malik, Saif U. R.",{"author":5008},"Malik, Hassan",{"author":5010},"Pervaiz, Haris",{"author":5012},"Gill, Sukhpal Singh",[],"https:\u002F\u002Flink.springer.com\u002Fcontent\u002Fpdf\u002F10.1007\u002Fs11277-021-09323-0.pdf",{"title":5016,"type":228,"excerpt":5017,"year":4126,"authors":5018,"tags":5027,"pdfFile":10,"pdfUrl":5028,"extendedUrl":10,"bibTeX":5029},"A Novel Privacy Paradigm for Improving Serial Data Privacy","Sensors, 22 (7),  ARTN 2811. DOI: 10.3390\u002Fs22072811.",[5019,5021,5022,5023,5025],{"author":5020},"Shaukat, Ayesha",{"author":4962},{"author":5006},{"author":5024},"Shah, Munam Ali",{"author":5026},"Maple, Carsten",[],"https:\u002F\u002Fwww.mdpi.com\u002F1424-8220\u002F22\u002F7\u002F2811\u002Fpdf?version=1649299146",{"tag":10,"width":10,"height":10,"text":5030},"@Article{s22072811,\nAUTHOR = {Shaukat, Ayesha and Anjum, Adeel and Malik, Saif U. R. and Shah, Munam Ali and Maple, Carsten},\nTITLE = {A Novel Privacy Paradigm for Improving Serial Data Privacy},\nJOURNAL = {Sensors},\nVOLUME = {22},\nYEAR = {2022},\nNUMBER = {7},\nARTICLE-NUMBER = {2811},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F1424-8220\u002F22\u002F7\u002F2811},\nPubMedID = {35408425},\nISSN = {1424-8220},\nABSTRACT = {Protecting the privacy of individuals is of utmost concern in today’s society, as inscribed and governed by the prevailing privacy laws, such as GDPR. In serial data, bits of data are continuously released, but their combined effect may result in a privacy breach in the whole serial publication. Protecting serial data is crucial for preserving them from adversaries. Previous approaches provide privacy for relational data and serial data, but many loopholes exist when dealing with multiple sensitive values. We address these problems by introducing a novel privacy approach that limits the risk of privacy disclosure in republication and gives better privacy with much lower perturbation rates. Existing techniques provide a strong privacy guarantee against attacks on data privacy; however, in serial publication, the chances of attack still exist due to the continuous addition and deletion of data. In serial data, proper countermeasures for tackling attacks such as correlation attacks have not been taken, due to which serial publication is still at risk. Moreover, protecting privacy is a significant task due to the critical absence of sensitive values while dealing with multiple sensitive values. Due to this critical absence, signatures change in every release, which is a reason for attacks. In this paper, we introduce a novel approach in order to counter the composition attack and the transitive composition attack and we prove that the proposed approach is better than the existing state-of-the-art techniques. Our paper establishes the result with a systematic examination of the republication dilemma. Finally, we evaluate our work using benchmark datasets, and the results show the efficacy of the proposed technique.},\nDOI = {10.3390\u002Fs22072811}\n}",{"title":5032,"type":228,"excerpt":5033,"year":4126,"authors":5034,"tags":5037,"pdfFile":10,"pdfUrl":5038,"extendedUrl":10,"bibTeX":5039},"A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem","DOI: 10.48550\u002FarXiv.2207.07964.",[5035,5036],{"author":4538},{"author":4528},[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2207.07964",{"tag":10,"width":10,"height":10,"text":5040},"@misc{anagreh2022parallelprivacypreservingshortestpath,\n      title={A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem}, \n      author={Mohammad Anagreh and Peeter Laud},\n      year={2022},\n      eprint={2207.07964},\n      archivePrefix={arXiv},\n      primaryClass={cs.CR},\n      url={https:\u002F\u002Farxiv.org\u002Fabs\u002F2207.07964}, \n}",{"title":5042,"type":228,"excerpt":5043,"year":4690,"authors":5044,"tags":5048,"pdfFile":10,"pdfUrl":5049,"extendedUrl":10,"bibTeX":5050},"Estimating Carbon Footprint of Paper and Internet Voting","In:  Electronic Voting. (140−155).  Springer. (Lecture Notes in Computer Science; 14230). DOI: 10.1007\u002F978-3-031-43756-4_9.",[5045,5046],{"author":4253},{"author":5047},"Krips, Kristjan",[],"https:\u002F\u002Flink.springer.com\u002Fcontent\u002Fpdf\u002F10.1007\u002F978-3-031-43756-4_9.pdf",{"tag":10,"width":10,"height":10,"text":5051},"@InProceedings{10.1007\u002F978-3-031-43756-4_9,\nauthor=\"Willemson, Jan\nand Krips, Kristjan\",\neditor=\"Volkamer, Melanie\nand Duenas-Cid, David\nand R{\\o}nne, Peter\nand Ryan, Peter Y. A.\nand Budurushi, Jurlind\nand Kulyk, Oksana\nand Rodriguez P{\\'e}rez, Adri{\\`a}\nand Spycher-Krivonosova, Iuliia\",\ntitle=\"Estimating Carbon Footprint of Paper and Internet Voting\",\nbooktitle=\"Electronic Voting\",\nyear=\"2023\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"140--155\",\nabstract=\"This paper compares the carbon footprint of paper voting in polling stations with the emissions of remote vote casting via the Internet. We identify the process steps with the most significant emissions in terms of {\\$}{\\$}{\\backslash}textrm{\\{}CO{\\}}{\\_}2{\\$}{\\$}CO2equivalent, design a methodology to quantify these emissions and give a comparative analysis based on the example of the Estonian parliamentary elections of 2023. Our results show that paper voting has about 180 times higher carbon footprint, owing largely to the need to transport the voters to the polling stations and back.\",\nisbn=\"978-3-031-43756-4\"\n}",{"title":5053,"type":228,"excerpt":5054,"year":4690,"authors":5055,"tags":5057,"pdfFile":10,"pdfUrl":5058,"extendedUrl":10,"bibTeX":5059},"Analysis of Information Security Measures Embedded in the GDPR","2023 IEEE 31st International Requirements Engineering Conference Workshops (REW): 2023 IEEE 31st International Requirements Engineering Conference Workshops (REW), Hannover, Germany, 04-05 September 2023. IEEE, 214−217. DOI: 10.1109\u002FREW57809.2023.00043.",[5056],{"author":4253},[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FREW57809.2023.00043",{"tag":10,"width":10,"height":10,"text":5060},"@INPROCEEDINGS{10260940,\n  author={Willemson, Jan},\n  booktitle={2023 IEEE 31st International Requirements Engineering Conference Workshops (REW)}, \n  title={Analysis of Information Security Measures Embedded in the GDPR}, \n  year={2023},\n  volume={},\n  number={},\n  pages={214-217},\n  keywords={Privacy;Security management;Conferences;Information security;Requirements engineering;General Data Protection Regulation;Task analysis;GDPR;Information security management},\n  doi={10.1109\u002FREW57809.2023.00043}}",{"title":5062,"type":228,"excerpt":5063,"year":4690,"authors":5064,"tags":5072,"pdfFile":10,"pdfUrl":5073,"extendedUrl":10,"bibTeX":5074},"SecurePrivChain: A decentralized framework for securing the global model using cryptography","Future Generation Computer Systems, 142,  364−375. DOI: 10.1016\u002Fj.future.2022.12.032.",[5065,5067,5068,5070],{"author":5066},"Sanam, Kahkishan",{"author":4943},{"author":5069},"Kanwal, Tehsin",{"author":5071},"Adil, Zain Ul Islam",[],"https:\u002F\u002Fdx.doi.org\u002F10.1016\u002Fj.future.2022.12.032",{"tag":10,"width":10,"height":10,"text":5075},"@article{SANAM2023364,\ntitle = {SecurePrivChain: A decentralized framework for securing the global model using cryptography},\njournal = {Future Generation Computer Systems},\nvolume = {142},\npages = {364-375},\nyear = {2023},\nissn = {0167-739X},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.future.2022.12.032},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167739X22004368},\nauthor = {Kahkishan Sanam and Saif Ur Rehman Malik and Tehsin Kanwal and Zain Ul Islam Adil},\nkeywords = {Horizontal federated learning, Private Ethereum, ECC, RSA, Algamal, Internet of vehicles, Cryptography, Global model security},\nabstract = {VANETS (IoVs), banks, and healthcare records are the sensitive information of vehicles, clients, and patients that is stored and maintained electronically, which has historically been a popular target for privacy leakage. To address growing issues about privacy leakage in these scenarios, federated learning has been frequently accepted as a privacy-preserving framework that enables multiple users to collectively develop a global model. To preserve the privacy of the training data, the server and participants share only model parameters. However, since participants have access to modified model parameters, this solution is still prone to poisoning and label-flipping attacks. Recent research showed that the federated learning framework is highly susceptible to attacks, with poisoning and label flipping being the most powerful, as well as secluded attacks, in which attackers can poison the parameters of the global model to gain access to the clients’ confidential information or degrade the global model’s performance. To address these attacks, a decentralized framework for securing the global models in federated learning (SecurePrivChain) is proposed in this study. A permissioned private Ethereum blockchain and encryption mechanisms were adopted in the framework to hide global parameters and preserve the privacy of a client’s data as well as achieve client’s authentication. Finally, the proposed model is evaluated using metrics such as computed cost, transaction latency, loss, and cost analysis based on Ethereum gas consumption. The performance of the scheme was compared with other benchmark models which are based on different encryption mechanisms. These included RSA and algamal using publicly available MNIST, banks, vehicles, and hospital datasets. Numerical results show that the proposed framework has good performance. A formal security analysis is done to show how the system can meet its goal of protecting privacy.}\n}",{"title":5077,"type":228,"excerpt":5078,"year":4690,"authors":5079,"tags":5089,"pdfFile":10,"pdfUrl":5090,"extendedUrl":10,"bibTeX":5091},"Cohort-based kernel principal component analysis with Multi-path Service Routing in Federated Learning","Future Generation Computer Systems, 149,  518−530. DOI: 10.1016\u002Fj.future.2023.07.037.",[5080,5082,5084,5085,5087],{"author":5081},"Sikandar, Hira S.",{"author":5083},"Malik, Saif ur Rehman",{"author":4962},{"author":5086},"Khan, Abid",{"author":5088},"Jeon, Gwanggil",[],"https:\u002F\u002Fdx.doi.org\u002F10.1016\u002Fj.future.2023.07.037",{"tag":10,"width":10,"height":10,"text":5092},"@article{SIKANDAR2023518,\ntitle = {Cohort-based kernel principal component analysis with Multi-path Service Routing in Federated Learning},\njournal = {Future Generation Computer Systems},\nvolume = {149},\npages = {518-530},\nyear = {2023},\nissn = {0167-739X},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.future.2023.07.037},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167739X23002947},\nauthor = {Hira S. Sikandar and Saif ur Rehman Malik and Adeel Anjum and Abid Khan and Gwanggil Jeon},\nkeywords = {Federated Learning (FL), Cohorts, Security, Machine learning (ML), Multipath Service Routing (MSR)},\nabstract = {Federated Learning (FL) is a machine learning (ML) strategy that is performed in a decentralized environment. The training is performed locally by the client on the global model shared by the server. Federated learning has recently been used as a service (FLaaS) to provide a collaborative training environment to independent third-party applications. However, the widespread adoption in distributed settings of FL has opened venues for a number of security attacks. A number of studies have been performed to prevent multiple FL attacks. However, sophisticated attacks, such as label-flipping attacks, have received little or no attention. From the said perspective, this research is focused on providing a defense mechanism for the aforesaid attack. The proposed approach is based on Type-based Cohorts (TC) with Kernel Principal Component Analysis (KPCA) to detect and defend against label-flipping attacks. Moreover, to improve the performance of the network, we will deploy Multi-path Service Routing (MSR) for edge nodes to work effectively. The KPCA will be used to secure the network from attacks. The proposed mechanism will provide an effective and secure FL system. The proposed approach is evaluated with respect to the following measures: execution time, memory consumption, information loss, accuracy, service request violations, and the request’s waiting time.}\n}",{"title":5094,"type":228,"excerpt":5095,"year":4690,"authors":5096,"tags":5108,"pdfFile":10,"pdfUrl":5109,"extendedUrl":10,"bibTeX":5110},"Malware Detection in Android IoT Systems Using Deep Learning","Computers, Materials amp; Continua, 74 (2), 4399−4415. DOI: 10.32604\u002Fcmc.2023.032984.",[5097,5099,5101,5103,5104,5106],{"author":5098},"Waqar, Muhammad",{"author":5100},"Fareed, Sabeeh",{"author":5102},"Kim, Ajung",{"author":4943},{"author":5105},"Imran, Muhammad",{"author":5107},"Yaseen, Muhammad Usman",[],"https:\u002F\u002Ffile.techscience.com\u002Fueditor\u002Ffiles\u002Fcmc\u002FTSP_CMC-74-2\u002FTSP_CMC_32984\u002FTSP_CMC_32984.pdf",{"tag":10,"width":10,"height":10,"text":5111},"@Article{cmc.2023.032984,\nAUTHOR = {Muhammad Waqar, Sabeeh Fareed, Ajung Kim, Saif Ur Rehman Malik, Muhammad Imran, Muhammad Usman Yaseen},\nTITLE = {Malware Detection in Android IoT Systems Using Deep Learning},\nJOURNAL = {Computers, Materials \\& Continua},\nVOLUME = {74},\nYEAR = {2023},\nNUMBER = {2},\nPAGES = {4399--4415},\nURL = {http:\u002F\u002Fwww.techscience.com\u002Fcmc\u002Fv74n2\u002F50268},\nISSN = {1546-2226},\nABSTRACT = {The Android Operating System (AOS) has been evolving since its inception and it has become one of the most widely used operating system for the Internet of Things (IoT). Due to the high popularity and reliability of AOS for IoT, it is a target of many cyber-attacks which can cause compromise of privacy, financial loss, data integrity, unauthorized access, denial of services and so on. The Android-based IoT (AIoT) devices are extremely vulnerable to various malwares due to the open nature and high acceptance of Android in the market. Recently, several detection preventive malwares are developed to conceal their malicious activities from analysis tools. Hence, conventional malware detection techniques could not be applied and innovative countermeasures against such anti-detection malwares are indispensable to secure the AIoT. In this paper, we proposed the novel deep learning-based real-time multiclass malware detection techniques for the AIoT using dynamic analysis. The results show that the proposed technique outperforms existing malware detection techniques and achieves detection accuracy up to 99.87%.},\nDOI = {10.32604\u002Fcmc.2023.032984}\n}",{"title":5113,"type":228,"excerpt":5114,"year":4690,"authors":5115,"tags":5128,"pdfFile":10,"pdfUrl":5129,"extendedUrl":10,"bibTeX":5130},"Preserving Privacy in Internet of Vehicles (IoV): A Novel Group-Leader-Based Shadowing Scheme Using Blockchain","IEEE Internet of Things Journal, 10 (24),  21421−21430. DOI: 10.1109\u002FJIOT.2023.3294133.",[5116,5118,5119,5120,5122,5124,5126],{"author":5117},"Saqib, N.U.",{"author":1436},{"author":1434},{"author":5121},"Syed, M.H.",{"author":5123},"Moqurrab, S.A.",{"author":5125},"Srivastava, G.",{"author":5127},"Lin, J.C.W.",[],"https:\u002F\u002Fdx.doi.org\u002F10.1109\u002FJIOT.2023.3294133",{"tag":10,"width":10,"height":10,"text":5131},"@ARTICLE{10177933,\n  author={Saqib, Najam U and Malik, Saif U. R. and Anjum, Adeel and Syed, Madiha Haider and Moqurrab, Syed Atif and Srivastava, Gautam and Lin, Jerry Chun-Wei},\n  journal={IEEE Internet of Things Journal}, \n  title={Preserving Privacy in Internet of Vehicles (IoV): A Novel Group-Leader-Based Shadowing Scheme Using Blockchain}, \n  year={2023},\n  volume={10},\n  number={24},\n  pages={21421-21430},\n  keywords={Privacy;Vehicular ad hoc networks;Real-time systems;Safety;Security;Dedicated short range communication;Blockchains;Data privacy;Anonymization;blockchain;data privacy;data publishing;data utility;local recording},\n  doi={10.1109\u002FJIOT.2023.3294133}}",{"title":5133,"type":228,"excerpt":5134,"year":4690,"authors":5135,"tags":5141,"pdfFile":10,"pdfUrl":5142,"extendedUrl":10,"bibTeX":5143},"Improved lattice‐based mix‐nets for electronic voting","IET Information Security, 17 (1),  18−34. DOI: 10.1049\u002Fise2.12089.",[5136,5138,5139],{"author":5137},"Farzaliyev, Valeh",{"author":4253},{"author":5140},"Kaasik, Jaan Kristjan",[],"https:\u002F\u002Fonlinelibrary.wiley.com\u002Fdoi\u002Fpdfdirect\u002F10.1049\u002Fise2.12089",{"tag":10,"width":10,"height":10,"text":5144},"@article{https:\u002F\u002Fdoi.org\u002F10.1049\u002Fise2.12089,\nauthor = {Farzaliyev, Valeh and Willemson, Jan and Kaasik, Jaan Kristjan},\ntitle = {Improved lattice-based mix-nets for electronic voting},\njournal = {IET Information Security},\nvolume = {17},\nnumber = {1},\npages = {18-34},\nkeywords = {electronic voting, implementation, lattice-based post-quantum cryptography, mix-nets, zero-knowledge proofs},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1049\u002Fise2.12089},\nurl = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fabs\u002F10.1049\u002Fise2.12089},\neprint = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fpdf\u002F10.1049\u002Fise2.12089},\nabstract = {Abstract Mix-networks were first proposed by Chaum in the late 1970s–early 1980s as a general tool for building anonymous communication systems. Classical mix-net implementations rely on standard public key primitives (e.g., ElGamal encryption) that will become vulnerable when a sufficiently powerful quantum computer will be built. Thus, there is a need to develop quantum-resistant mix-nets. This article focuses on the application case of electronic voting where the number of votes to be mixed may reach hundreds of thousands or even millions. We propose an improved architecture for lattice-based post-quantum mix-nets featuring more efficient zero-knowledge proofs while maintaining established security assumptions. Our current implementation scales up to 100,000 votes, still leaving a lot of room for future optimisation.},\nyear = {2023}\n}",{"title":5146,"type":228,"excerpt":5147,"year":4690,"authors":5148,"tags":5161,"pdfFile":10,"pdfUrl":5162,"extendedUrl":10,"bibTeX":5163},"Management of national eID infrastructure as a state-critical asset and public-private partnership: learning from the case of Estonia","Information Systems Frontiers,  18 pp. DOI: 10.1007\u002Fs10796-022-10363-5.",[5149,5151,5153,5155,5157,5159],{"author":5150},"Lips, Silvia",{"author":5152},"Tsap, Valentyna",{"author":5154},"Bharosa, Nitesh",{"author":5156},"Draheim, Dirk",{"author":5158},"Krimmer, Robert",{"author":5160},"Tammet, Tanel",[],"https:\u002F\u002Flink.springer.com\u002Fcontent\u002Fpdf\u002F10.1007\u002Fs10796-022-10363-5.pdf",{"tag":10,"width":10,"height":10,"text":10},{"title":5165,"type":228,"excerpt":5166,"year":4690,"authors":5167,"tags":5177,"pdfFile":10,"pdfUrl":5178,"extendedUrl":10,"bibTeX":5179},"A Detailed Survey on Federated Learning Attacks and Defenses","Electronics, 12 (2),  ARTN 260. DOI: 10.3390\u002Felectronics12020260.",[5168,5170,5172,5174,5175],{"author":5169},"Sikandar, Hira Shahzadi",{"author":5171},"Waheed, Huda",{"author":5173},"Tahir, Sibgha",{"author":5006},{"author":5176},"Rafique, Waqas",[],"https:\u002F\u002Fwww.mdpi.com\u002F2079-9292\u002F12\u002F2\u002F260\u002Fpdf?version=1673690001",{"tag":10,"width":10,"height":10,"text":5180},"@Article{electronics12020260,\nAUTHOR = {Sikandar, Hira Shahzadi and Waheed, Huda and Tahir, Sibgha and Malik, Saif U. R. and Rafique, Waqas},\nTITLE = {A Detailed Survey on Federated Learning Attacks and Defenses},\nJOURNAL = {Electronics},\nVOLUME = {12},\nYEAR = {2023},\nNUMBER = {2},\nARTICLE-NUMBER = {260},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F2079-9292\u002F12\u002F2\u002F260},\nISSN = {2079-9292},\nABSTRACT = {A traditional centralized method of training AI models has been put to the test by the emergence of data stores and public privacy concerns. To overcome these issues, the federated learning (FL) approach was introduced. FL employs a privacy-by-design architecture to train deep neural networks utilizing decentralized data, in which numerous devices collectively build any machine learning system that does not reveal users’ personal information under the supervision of a centralized server. While federated learning (FL), as a machine learning (ML) strategy, may be effective for safeguarding the confidentiality of local data, it is also vulnerable to attacks. Increased interest in the FL domain inspired us to write this paper, which informs readers of the numerous threats to and flaws in the federated learning strategy, and introduces a multiple-defense mechanism that can be employed to fend off threats.},\nDOI = {10.3390\u002Felectronics12020260}\n}",{"title":5182,"type":228,"excerpt":5183,"year":4690,"authors":5184,"tags":5186,"pdfFile":10,"pdfUrl":5187,"extendedUrl":10,"bibTeX":5188},"Creating a Decryption Proof Verifier for the Estonian Internet Voting System","ARES #39;23: Proceedings of the 18th International Conference on Availability, Reliability and Security: 18th International Conference on Availability, Reliability and Security, Benevento, Italy, 29 August 2023 -- 1 September 2023. ACM, 1−7. DOI: 10.1145\u002F3600160.3605467.",[5185],{"author":4253},[],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002Fpdf\u002F10.1145\u002F3600160.3605467",{"tag":10,"width":10,"height":10,"text":5189},"@inproceedings{10.1145\u002F3600160.3605467,\nauthor = {Willemson, Jan},\ntitle = {Creating a Decryption Proof Verifier for the Estonian Internet Voting System},\nyear = {2023},\nisbn = {9798400707728},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3600160.3605467},\ndoi = {10.1145\u002F3600160.3605467},\nabstract = {This paper describes the efforts made for and lessons learnt from creating a decryption proof verifier for the Estonian IVXV Internet voting system. Our main conclusion is that cryptographic protocols aiming at providing transparency through verifiability should also take into account a non-functional requirement of low implementation complexity. We identify several steps of the verification protocol that could be made easier to implement without sacrificing security. A side-product of our effort is a fully functional IVXV decryption proof verifier written in Go that we used during the latest Estonian parliamentary elections of March 2023.},\nbooktitle = {Proceedings of the 18th International Conference on Availability, Reliability and Security},\narticleno = {58},\nnumpages = {7},\nlocation = {Benevento, Italy},\nseries = {ARES '23}\n}",{"title":5191,"type":228,"excerpt":5192,"year":4690,"authors":5193,"tags":5195,"pdfFile":10,"pdfUrl":5196,"extendedUrl":10,"bibTeX":5197},"Analyzing and Improving Eligibility Verifiability of the Proposed Belgian Remote Voting System","In: Security and Trust Management. (126−135). Springer. (Lecture Notes in Computer Science; 14336). DOI: 10.1007\u002F978-3-031-47198-8_8.",[5194],{"author":4253},[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2305.09411",{"tag":10,"width":10,"height":10,"text":5198},"@InProceedings{10.1007\u002F978-3-031-47198-8_8,\nauthor=\"Willemson, Jan\",\neditor=\"Rios, Ruben\nand Posegga, Joachim\",\ntitle=\"Analyzing and Improving Eligibility Verifiability of the Proposed Belgian Remote Voting System\",\nbooktitle=\"Security and Trust Management\",\nyear=\"2023\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"126--135\",\nabstract=\"This paper discusses a recent hybrid paper-electronic voting system proposal put forward for Belgian elections. We point to some problems in the proposal, and consider addition of blind signatures as one possible approach to dealing with the identified shortcomings. We discuss the concomitant updates from both the protocol and electoral processes point of view, arguing that our proposal would strike a better balance between different requirements. To the best of our knowledge, this is also the first proposal to use blind signatures in a paper-based voting system.\",\nisbn=\"978-3-031-47198-8\"\n}",{"title":5200,"type":228,"excerpt":5201,"year":4690,"authors":5202,"tags":5208,"pdfFile":10,"pdfUrl":5209,"extendedUrl":10,"bibTeX":5210},"Differentially private release of event logs for process mining","Information Systems, 115,  ARTN 102161. DOI: 10.1016\u002Fj.is.2022.102161.",[5203,5205,5206],{"author":5204},"Elkoumy, Gamal",{"author":4251},{"author":5207},"Dumas, Marlon",[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2201.03010",{"tag":10,"width":10,"height":10,"text":5211},"@article{ELKOUMY2023102161,\ntitle = {Differentially private release of event logs for process mining},\njournal = {Information Systems},\nvolume = {115},\npages = {102161},\nyear = {2023},\nissn = {0306-4379},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.is.2022.102161},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0306437922001399},\nauthor = {Gamal Elkoumy and Alisa Pankova and Marlon Dumas},\nkeywords = {Privacy-preserving process mining, Process mining, Privacy-enhancing technologies, Differential privacy},\nabstract = {The applicability of process mining techniques hinges on the availability of event logs capturing the execution of a business process. In some use cases, particularly those involving customer-facing processes, these event logs may contain private information. Data protection regulations restrict the use of such event logs for analysis purposes. One way of circumventing these restrictions is to anonymize the event log to the extent that no individual can be singled out using the anonymized log. This article addresses the problem of anonymizing an event log in order to guarantee that, upon release of the anonymized log, the probability that an attacker may single out any individual represented in the original log does not increase by more than a threshold. The article proposes a differentially private release mechanism, which samples the cases in the log and adds noise to the timestamps to the extent required to achieve the above privacy guarantee. The article reports on an empirical comparison of the proposed approach against the state-of-the-art approaches using 14 real-life event logs in terms of data utility loss and computational efficiency.}\n}",{"title":5213,"type":228,"excerpt":5214,"year":4690,"authors":5215,"tags":5236,"pdfFile":10,"pdfUrl":5237,"extendedUrl":10,"bibTeX":5238},"UN Handbook on Privacy-Preserving Computation Techniques","DOI: 10.48550\u002FarXiv.2301.06167.",[5216,5218,5220,5222,5224,5226,5228,5230,5232,5234],{"author":5217},"Archer, David W.",{"author":5219},"de Pigem, Balle Borja",{"author":5221},"Bogdanov, Dan",{"author":5223},"Craddock, Mark",{"author":5225},"Gascon, Adria",{"author":5227},"Jansen, Ronald",{"author":5229},"Jug, Matjaž",{"author":5231},"Laine, Kim",{"author":5233},"McLellan, Robert",{"author":5235},"Ohrimenko, Olga",[],"https:\u002F\u002Funstats.un.org\u002Fbigdata\u002Ftask-teams\u002Fprivacy\u002FUN%20Handbook%20for%20Privacy-Preserving%20Techniques.pdf",{"tag":10,"width":10,"height":10,"text":5239},"@misc{archer2023handbookprivacypreservingcomputationtechniques,\n      title={UN Handbook on Privacy-Preserving Computation Techniques}, \n      author={David W. Archer and Borja de Balle Pigem and Dan Bogdanov and Mark Craddock and Adria Gascon and Ronald Jansen and Matjaž Jug and Kim Laine and Robert McLellan and Olga Ohrimenko and Mariana Raykova and Andrew Trask and Simon Wardley},\n      year={2023},\n      eprint={2301.06167},\n      archivePrefix={arXiv},\n      primaryClass={cs.CY},\n      url={https:\u002F\u002Farxiv.org\u002Fabs\u002F2301.06167}, \n}",{"title":5241,"type":228,"excerpt":5242,"year":4690,"authors":5243,"tags":5257,"pdfFile":10,"pdfUrl":5258,"extendedUrl":10,"bibTeX":10},"TEADAL: Trustworthy, Energy-Aware federated DAta Lakes along the computing continuum","Proceedings of the Research Projects Exhibition Papers Presented at the 35th International Conference on Advanced Information Systems Engineering (CAiSE 2023): CAiSE 2023 Research Projects Exhibition, Zaragoza, Spain, June 12-16, 2023. Ed. Font, Jaime; Arcega, Lorena, Reyes Roman, Jose Fabian; Giachetti, Giovanni. CEUR-WS.org, 28−35.",[5244,5246,5248,5250,5252,5254,5255],{"author":5245},"Plebani, Pierluigi",{"author":5247},"Kat, Ronen I.",{"author":5249},"Pallas, Frank",{"author":5251},"Werner, Sebastian",{"author":5253},"Inches, Giacomo",{"author":4528},{"author":5256},"Santiago, Rita",[],"https:\u002F\u002Fteadal.eu\u002F2023\u002F06\u002F22\u002Fteadal-being-presented-at-caise-conference-2023\u002F",{"title":5260,"type":228,"excerpt":5261,"year":48,"authors":5262,"tags":5272,"pdfFile":10,"pdfUrl":5273,"extendedUrl":10,"bibTeX":5274},"DeepDetect: An innovative hybrid deep learning framework for anomaly detection in IoT networks","Journal of Computational Science, 83,  ARTN 102426. DOI: 10.1016\u002Fj.jocs.2024.102426.",[5263,5265,5266,5267,5269,5271],{"author":5264},"Zulfiqar, Zeenat",{"author":5006},{"author":4964},{"author":5268},"Zulfiqar, Zubair",{"author":5270},"Yaseen, Usman",{"author":4966},[],"https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jocs.2024.102426",{"tag":10,"width":10,"height":10,"text":5275},"@article{ZULFIQAR2024102426,\ntitle = {DeepDetect: An innovative hybrid deep learning framework for anomaly detection in IoT networks},\njournal = {Journal of Computational Science},\nvolume = {83},\npages = {102426},\nyear = {2024},\nissn = {1877-7503},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jocs.2024.102426},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1877750324002199},\nauthor = {Zeenat Zulfiqar and Saif U.R. Malik and Syed Atif Moqurrab and Zubair Zulfiqar and Usman Yaseen and Gautam Srivastava},\nkeywords = {Anomaly detection, Network security, 5G, Deep learning, Internet of things, NSL-KDD},\nabstract = {The presence of threats and anomalies in the Internet of Things infrastructure is a rising concern. Attacks, such as Denial of Service, User to Root, Probing, and Malicious operations can lead to the failure of an Internet of Things system. Traditional machine learning methods rely entirely on feature engineering availability to determine which data features will be considered by the model and contribute to its training and classification and “dimensionality” reduction techniques to find the most optimal correlation between data points that influence the outcome. The performance of the model mostly depends on the features that are used. This reliance on feature engineering and its effects on the model performance has been demonstrated from the perspective of the Internet of Things intrusion detection system. Unfortunately, given the risks associated with the Internet of Things intrusion, feature selection considerations are quite complicated due to the subjective complexity. Each feature has its benefits and drawbacks depending on which features are selected. Deep structured learning is a subcategory of machine learning. It realizes features inevitably out of raw data as it has a deep structure that contains multiple hidden layers. However, deep learning models such as recurrent neural networks can capture arbitrary-length dependencies, which are difficult to handle and train. However, it is suffering from exploiting and vanishing gradient problems. On the other hand, the log-cosh conditional variational Autoencoder ignores the detection of the multiple class classification problem, and it has a high level of false alarms and a not high detection accuracy. Moreover, the Autoencoder ignores to detect multi-class classification. Furthermore, there is evidence that a single convolutional neural network cannot fully exploit the rich information in network traffic. To deal with the challenges, this research proposed a novel approach for network anomaly detection. The proposed model consists of multiple convolutional neural networks, gate-recurrent units, and a bi-directional-long-short-term memory network. The proposed model employs multiple convolution neural networks to grasp spatial features from the spatial dimension through network traffic. Furthermore, gate recurrent units overwhelm the problem of gradient disappearing- and effectively capture the correlation between the features. In addition, the bi-directional-long short-term memory network approach was used. This layer benefits from preserving the historical context for a long time and extracting temporal features from backward and forward network traffic data. The proposed hybrid model improves network traffic’s accuracy and detection rate while lowering the false positive rate. The proposed model is evaluated and tested on the intrusion detection benchmark NSL-KDD dataset. Our proposed model outperforms other methods, as evidenced by the experimental results. The overall accuracy of the proposed model for multi-class classification is 99.31% and binary-class classification is 99.12%.}\n}",{"title":5277,"type":228,"excerpt":5278,"year":48,"authors":5279,"tags":5285,"pdfFile":5286,"pdfUrl":5288,"extendedUrl":10,"bibTeX":5289},"Blueprints for Deploying Privacy Enhancing Technologies in E-Government","In: Bieker, Felix ; de Conca, Silvia; Gruschka, Nils; Jensen, Meiko; Schiering, Ina (Ed.).  Privacy and Identity Management. Sharing in a Digital World. (3−19).  Springer. (IFIP Advances in Information and Communication Technology; 695). DOI: 10.1007\u002F978-3-031-57978-3_1.",[5280,5281,5282,5284],{"author":234},{"author":135},{"author":5283},"Brito, E.",{"author":4112},[],{"url":5287},"\u002Fuploads\u002F978_3_031_57978_3_1_df2f483b9c.pdf","https:\u002F\u002Flink.springer.com\u002Fcontent\u002Fpdf\u002F10.1007\u002F978-3-031-57978-3_1.pdf",{"tag":10,"width":10,"height":10,"text":5290},"@InProceedings{10.1007\u002F978-3-031-57978-3_1,\nauthor=\"Kamm, Liina\nand Bogdanov, Dan\nand Brito, Eduardo\nand Ostrak, Andre\",\neditor=\"Bieker, Felix\nand de Conca, Silvia\nand Gruschka, Nils\nand Jensen, Meiko\nand Schiering, Ina\",\ntitle=\"Blueprints for Deploying Privacy Enhancing Technologies in E-Government\",\nbooktitle=\"Privacy and Identity Management. Sharing in a Digital World\",\nyear=\"2024\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"3--19\",\nabstract=\"Governments are increasingly becoming providers of data-driven services to both citizens and organisations. As the number of these services grows, the government will store greater amounts of personal and company data. Data minimisation and data protection can be legal obligations, especially for governments that have passed data protection and privacy regulations. However, even without such regulation, processing only as much data as is necessary, is good information security practice. In this paper, we give an overview of how we put together a Privacy Enhancing Technology (PET) concept and roadmap for an e-government, including motivations, an adoption strategy and blueprints for services that benefit from PETs.\",\nisbn=\"978-3-031-57978-3\"\n}",{"title":5292,"type":228,"excerpt":5293,"year":48,"authors":5294,"tags":5314,"pdfFile":10,"pdfUrl":5315,"extendedUrl":10,"bibTeX":5316},"Privacy-friendly evaluation of patient data with secure multiparty computation in a European pilot study.","Npj Digital Medicine, 7 (1),  280. DOI: 10.1038\u002Fs41746-024-01293-4.",[5295,5297,5299,5301,5302,5304,5306,5308,5310,5312],{"author":5296},"Ballhausen, Hendrik",{"author":5298},"Corradini, Stefanie",{"author":5300},"Belka, Claus",{"author":5221},{"author":5303},"Boldrini, Luca",{"author":5305},"Bono, Francesco",{"author":5307},"Goelz, Christian",{"author":5309},"Landry, Guillaume",{"author":5311},"Panza, Giulia",{"author":5313},"Parodi, Katia",[],"https:\u002F\u002Fdoi.org\u002F10.1038\u002Fs41746-024-01293-4",{"tag":10,"width":10,"height":10,"text":10},{"title":5318,"type":228,"excerpt":5319,"year":48,"authors":5320,"tags":5330,"pdfFile":10,"pdfUrl":5331,"extendedUrl":10,"bibTeX":5332},"Voter Perception of Cast-as-Intended Verifiability in the Estonian I-Vote Protocol","E-Vote-ID 2023. DOI: 10.18420\u002Fe-vote-id2023_11. Gesellschaft für Informatik, Bonn. ISSN: 1617-5468. ISBN: 978-3-88579-741-8",[5321,5323,5325,5327,5328],{"author":5322},"Hilt, Tobias",{"author":5324},"Sein, Kati",{"author":5326},"Mällo, Tanel",{"author":4253},{"author":5329},"Volkamer, Melanie",[],"https:\u002F\u002Fdl.gi.de\u002Fitems\u002F071c1771-08c5-481a-85cf-2e4087c9bc31",{"tag":10,"width":10,"height":10,"text":5333},"@misc{misc,\nauthor = \"Hilt, Tobias and Sein, Kati and Mällo, Tanel and Willemson, Jan and Volkamer, Melanie\",\ntitle = \"Voter Perception of Cast-as-Intended Verifiability\",\nyear = 2023,\ndoi = \"10.18420\u002Fe-vote-id2023_11\",\nhowpublished = \"E-Vote-ID 2023\"\npublisher = \"Gesellschaft für Informatik, Bonn\",\nissn = \"1617-5468\",\nisbn = \"978-3-88579-741-8\",\n}",{"title":5335,"type":228,"excerpt":5336,"year":48,"authors":5337,"tags":5342,"pdfFile":10,"pdfUrl":5343,"extendedUrl":10,"bibTeX":5344},"Protocol choice and iteration for the free cornering","Journal of Logical and Algebraic Methods in Programming, 137,  Art. 100942; 30 pp. DOI: 10.1016\u002Fj.jlamp.2023.100942.",[5338,5340],{"author":5339},"Nester, Chad",{"author":5341},"Voorneveld, Niels",[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2305.16899",{"tag":10,"width":10,"height":10,"text":5345},"@article{NESTER2024100942,\ntitle = {Protocol choice and iteration for the free cornering},\njournal = {Journal of Logical and Algebraic Methods in Programming},\nvolume = {137},\npages = {100942},\nyear = {2024},\nissn = {2352-2208},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jlamp.2023.100942},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS2352220823000962},\nauthor = {Chad Nester and Niels Voorneveld},\nkeywords = {Category theory, Concurrency, Double categories, Computational effects},\nabstract = {We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated communication protocols. We validate our constructions by showing that they inherit significant categorical structure from the free cornering, including that they form monoidal double categories. We also establish some elementary properties of the novel structure they contain. Further, we give a model of the free cornering in terms of strong functors and strong natural transformations, inspired by the literature on computational effects.}\n}",{"title":5347,"type":228,"excerpt":5348,"year":48,"authors":5349,"tags":5363,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":5364},"Open-Source Post-Quantum Encryptor: Design, Implementation and Deployment","Proceedings of the 21st International Conference on Security and Cryptography: 21st International Conference on Security and Cryptography SECRYPT, Dijon, France, July 2024.  SCITEPRESS, 826−831. DOI: 10.5220\u002F0012839200003767.",[5350,5352,5354,5356,5358,5360,5362],{"author":5351},"Tuma, Petr",{"author":5353},"Hajny, Jan",{"author":5355},"Muzikant, Petr",{"author":5357},"Havlin, Jan",{"author":5359},"Malina, Lukas",{"author":5361},"Dobias, Patrik",{"author":4253},[],{"tag":10,"width":10,"height":10,"text":5365},"@conference{secrypt24,\nauthor={Petr Tuma and Jan Hajny and Petr Muzikant and Jan Havlin and Lukas Malina and Patrik Dobias and Jan Willemson},\ntitle={Open-Source Post-Quantum Encryptor: Design, Implementation and Deployment},\nbooktitle={Proceedings of the 21st International Conference on Security and Cryptography - SECRYPT},\nyear={2024},\npages={826-831},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0012839200003767},\nisbn={978-989-758-709-2},\nissn={2184-7711},\n}",{"title":5367,"type":228,"excerpt":5368,"year":48,"authors":5369,"tags":5372,"pdfFile":10,"pdfUrl":5373,"extendedUrl":10,"bibTeX":10},"Overview of Secure Multi-Party Computation Applications in Health Research and Social Sciences","In: Drechsler, Jörg; Kifer, Daniel; Reiter, Jerome; Slavković, Aleksandra (Ed.).  Handbook of Sharing Confidential Data. Differential Privacy, Secure Multiparty Computation, and Synthetic Data. (242−257).  New York: Chapman and Hall\u002FCRC.",[5370,5371],{"author":234},{"author":135},[],"https:\u002F\u002Fwww.taylorfrancis.com\u002Fchapters\u002Fedit\u002F10.1201\u002F9781003185284-19\u002Foverview-secure-multi-party-computation-applications-health-research-social-sciences-liina-kamm-dan-bogdanov",{"title":5375,"type":228,"excerpt":5376,"year":48,"authors":5377,"tags":5395,"pdfFile":10,"pdfUrl":5396,"extendedUrl":10,"bibTeX":5397},"ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs","2024 IEEE 37th Computer Security Foundations Symposium (CSF): Enschede, Netherlands, 08-12 July 2024.  Ed. Lisa O#39;Conner. IEEE Computer Society Press, 372−387. DOI: 10.1109\u002FCSF61375.2024.00010.",[5378,5379,5381,5382,5383,5385,5387,5389,5391,5393],{"author":5221},{"author":5380},"Jääger, Joosep",{"author":4528},{"author":4736},{"author":5384},"Pettai, Martin",{"author":5386},"Randmets, Jaak",{"author":5388},"Rebane, Raul-Martin",{"author":5390},"Sokk, Ville",{"author":5392},"Tali, Kert",{"author":5394},"Valdma, Sandhra-Mirella",[],"https:\u002F\u002Fdoi.org\u002F10.1109\u002FCSF61375.2024.00010",{"tag":10,"width":10,"height":10,"text":5398},"@INPROCEEDINGS{10664299,\n  author={Bogdanov, Dan and Jääger, Joosep and Laud, Peeter and Nestra, Härmel and Pettai, Martin and Randmets, Jaak and Rebane, Raul-Martin and Sokk, Ville and Tali, Kert and Valdma, Sandhra-Mirella},\n  booktitle={2024 IEEE 37th Computer Security Foundations Symposium (CSF)}, \n  title={ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs}, \n  year={2024},\n  volume={},\n  number={},\n  pages={372-387},\n  keywords={Protocols;Circuits;Computer security;Domain specific languages;domain-specific languages;type and effect systems;zero-knowledge proofs},\n  doi={10.1109\u002FCSF61375.2024.00010}}",{"title":5400,"type":228,"excerpt":5401,"year":48,"authors":5402,"tags":5410,"pdfFile":10,"pdfUrl":5411,"extendedUrl":10,"bibTeX":5412},"Artificial Intelligence System Risk Management Methodology Based on Generalized Blueprints","2024 16th International Conference on Cyber Conflict: Over the Horizon (CyCon): 16th International Conference on Cyber Conflict: Over the Horizon, Tallinn, Estonia, 28-31 May 2024.  Ed. C. Kwan, L. Lindström, D. Giovannelli, K. Podiņš, D. Štrucl. IEEE, 123−140. DOI: 10.23919\u002FCyCon62501.2024.10685644.",[5403,5404,5406,5408],{"author":5221},{"author":5405},"Etti, Paula",{"author":5407},"Kamm, Liina",{"author":5409},"Stomakhin, Fedor",[],"https:\u002F\u002Fieeexplore.ieee.org\u002Fdocument\u002F10685644",{"tag":10,"width":10,"height":10,"text":5413},"@INPROCEEDINGS{10685644,\n  author={Bogdanov, Dan and Etti, Paula and Kamm, Liina and Stomakhin, Fedor},\n  booktitle={2024 16th International Conference on Cyber Conflict: Over the Horizon (CyCon)}, \n  title={Artificial Intelligence System Risk Management Methodology Based on Generalized Blueprints}, \n  year={2024},\n  volume={},\n  number={},\n  pages={123-140},\n  keywords={Ethics;Computational modeling;Buildings;Organizations;Data models;Safety;Risk management;artificial intelligence;cybersecurity;data governance;data protection;risk management},\n  doi={10.23919\u002FCyCon62501.2024.10685644}}",{"title":5415,"type":228,"excerpt":5416,"year":48,"authors":5417,"tags":5421,"pdfFile":10,"pdfUrl":5422,"extendedUrl":10,"bibTeX":10},"Migrating Some Legacy e-Governance Applications to Post-Quantum Cryptography","Fifth PQC Standardization Conference, 10.-12. aprill 2024, Rockville, Maryland, USA.  NIST.",[5418,5419,5420],{"author":5355},{"author":4253},{"author":4528},[],"https:\u002F\u002Fcsrc.nist.gov\u002Fpresentations\u002F2024\u002Fmigrating-legacy-e-governance-applications-to-pqc",{"title":5424,"type":228,"excerpt":5425,"year":48,"authors":5426,"tags":5429,"pdfFile":10,"pdfUrl":5430,"extendedUrl":10,"bibTeX":5431},"Deploying Post-Quantum Algorithms in Existing Applications and Embedded Devices","In: Wang, G., Wang, H., Min, G., Georgalas, N., Meng, W. (Ed.).  Ubiquitous Security Third International Conference, UbiSec 2023. (147−162).  Springer. (Communications in Computer and Information Science; 2034). DOI: 10.1007\u002F978-981-97-1274-8_10.",[5427,5428],{"author":5355},{"author":4253},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-981-97-1274-8_10",{"tag":10,"width":10,"height":10,"text":5432},"@InProceedings{10.1007\u002F978-981-97-1274-8_10,\nauthor=\"Muzikant, Petr\nand Willemson, Jan\",\neditor=\"Wang, Guojun\nand Wang, Haozhe\nand Min, Geyong\nand Georgalas, Nektarios\nand Meng, Weizhi\",\ntitle=\"Deploying Post-quantum Algorithms in Existing Applications and Embedded Devices\",\nbooktitle=\"Ubiquitous Security\",\nyear=\"2024\",\npublisher=\"Springer Nature Singapore\",\naddress=\"Singapore\",\npages=\"147--162\",\nabstract=\"This document studies the current state of post-quantum cryptography implementation feasibility, providing general approaches that developers and security engineers can utilize to start integrating today. First, we analyze the current state of the art in the field of available cryptographic libraries and standards for algorithm interpretations and encodings. Then, we provide few implementation challenges that rose from our experiments and how to handle them. Lastly, we have built a proof-of-concept implementation by creating a post-quantum version of a modern web authentication framework. Our work introduces post-quantum support in multiple open-source libraries that together enable web-service administrators to authenticate their users with Dilithium-5 or Falcon-1024 secured electronic identities. Among other components, our proof-of-concept also includes a client side solution for key management using programmable embedded device.\",\nisbn=\"978-981-97-1274-8\"\n}",{"title":5434,"type":14,"excerpt":5435,"year":5436,"authors":5437,"tags":5440,"pdfFile":5441,"pdfUrl":10,"extendedUrl":10,"bibTeX":5443},"Efficient Two-Party ML-DSA Protocol in Active Security Model (Efektiivne kaheosapoolne ML-DSA protokoll aktiivse turvalisusega)","MSc thesis. University of Tartu, 2025.",2025,[5438],{"author":5439},"Kravtšenko, S.",[],{"url":5442},"\u002Fuploads\u002FKravtsenko_cybersecurity_2025_d4d6912bce.pdf",{"tag":10,"width":10,"height":10,"text":10},{"title":5445,"type":14,"excerpt":5446,"year":48,"authors":5447,"tags":5450,"pdfFile":5451,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Exploring the Use of Synthetic Data in the Public Sector: A Framework and Case Study Based on the Example of the Estonian Police and Border Guard Board","MSc thesis. Tallinn University of Technology, 2024.",[5448],{"author":5449},"Etti, P.",[],{"url":5452},"\u002Fuploads\u002F0584194caa4d4ba4a61582a2ea6a21b2_3ca2ae4496.pdf",{"title":5454,"type":14,"excerpt":5446,"year":48,"authors":5455,"tags":5458,"pdfFile":5459,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Cybersecurity-related Support Needs and Challenges Incurred by Informal Support: a Study Among Estonian Home Users",[5456],{"author":5457},"Sein, K.",[],{"url":5460},"\u002Fuploads\u002F79c58b9df4264909add872e049b589dd_a1e24a7eb9.pdf",{"title":5462,"type":14,"excerpt":5463,"year":48,"authors":5464,"tags":5466,"pdfFile":5467,"pdfUrl":5469,"extendedUrl":10,"bibTeX":10},"Foundations of Efficient and Secure Algorithm Development for Secure Multiparty Computation","PhD thesis. University of Tartu, 2024.",[5465],{"author":3985},[],{"url":5468},"\u002Fuploads\u002Fpullonen_raudvere_pille_437251e9f1.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002Ff52fc12d-ae92-4906-9205-ac87ed250d56",{"title":5471,"type":228,"excerpt":5472,"year":5436,"authors":5473,"tags":5481,"pdfFile":10,"pdfUrl":5482,"extendedUrl":10,"bibTeX":10},"Model-based verification of data protection mechanisms in collaborative business processes","Softw Syst Model (2025).  DOI: 10.1007\u002Fs10270-024-01217-6",[5474,5475,5476,5477,5478,5479],{"author":1520},{"author":1522},{"author":1524},{"author":3985},{"author":1527},{"author":5480},"Tiezzi, F.",[],"https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10270-024-01217-6",{"title":5484,"type":228,"excerpt":5485,"year":5436,"authors":5486,"tags":5493,"pdfFile":10,"pdfUrl":5494,"extendedUrl":10,"bibTeX":5495},"TrustOps: Continuously Building Trustworthy Software","In: Kaczmarek-Heß, M., Rosenthal, K., Suchánek, M., Da Silva, M.M., Proper, H.A., Schnellmann, M. (eds) Enterprise Design, Operations, and Computing. EDOC 2024 Workshops . EDOC 2024. Lecture Notes in Business Information Processing, vol 537. Springer, Cham. DOI: 10.1007\u002F978-3-031-79059-1_4",[5487,5488,5490,5491],{"author":5283},{"author":5489},"Castillo, F.",{"author":3985},{"author":5492},"Werner, S.",[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-79059-1_4",{"tag":10,"width":10,"height":10,"text":5496},"@InProceedings{10.1007\u002F978-3-031-79059-1_4,\nauthor=\"Brito, Eduardo\nand Castillo, Fernando\nand Pullonen-Raudvere, Pille\nand Werner, Sebastian\",\neditor=\"Kaczmarek-He{\\ss}, Monika\nand Rosenthal, Kristina\nand Such{\\'a}nek, Marek\nand Da Silva, Miguel Mira\nand Proper, Henderik A.\nand Schnellmann, Marianne\",\ntitle=\"TrustOps: Continuously Building Trustworthy Software\",\nbooktitle=\"Enterprise Design, Operations, and Computing. EDOC 2024 Workshops                                                                             \",\nyear=\"2025\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"53--67\",\nabstract=\"Software services play a crucial role in daily life, with automated actions determining access to resources and information. Trusting service providers to perform these actions fairly and accurately is essential, yet challenging for users to verify. Even with publicly available codebases, the rapid pace of development and the complexity of modern deployments hinder the understanding and evaluation of service actions, including for experts. Hence, current trust models rely heavily on the assumption that service providers follow best practices and adhere to laws and regulations, which is increasingly impractical and risky, leading to undetected flaws and data leaks.\",\nisbn=\"978-3-031-79059-1\"\n}",{"title":5498,"type":46,"excerpt":5499,"year":5436,"authors":5500,"tags":5502,"pdfFile":5503,"pdfUrl":55,"extendedUrl":10,"bibTeX":5505},"An Overview of Vulnerabilities and Mitigations of Intel SGX and Intel TDX Applications","Cybernetica research report D-2-116 v1.4. 2025.",[5501],{"author":51},[],{"url":5504},"\u002Fuploads\u002Freport_2025_sgx_19b89d79ed.pdf",{"tag":57,"width":58,"height":25,"text":5506},"@TECHREPORT{CYBER:R32,\n  author = {A. Kisand},\n  title = {An Overview of Vulnerabilities and Mitigations of Intel SGX and Intel TDX Applications},\n  institution = {Cybernetica AS},\n  year = {2025},\n  number = {D-2-116},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":5508,"type":14,"excerpt":5509,"year":48,"authors":5510,"tags":5513,"pdfFile":5514,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Towards practical privacy-preserving data analysis with Intel TDX-based Sharemind HI","MSc thesis. University of Tartu, 2024.",[5511],{"author":5512},"Rull, H.",[],{"url":5515},"\u002Fuploads\u002FRull_computer_science_2024_21ab6b23b0.pdf",{"title":5517,"type":46,"excerpt":5518,"year":48,"authors":5519,"tags":5524,"pdfFile":5525,"pdfUrl":55,"extendedUrl":10,"bibTeX":5527},"Interoperability Platform Architecture for Large Digital Governments","Cybernetica research report D-2-750. 2024.",[5520,5522,5523],{"author":5521},"Kromonov, I.",{"author":879},{"author":4129},[],{"url":5526},"\u002Fuploads\u002FInteroperability_Platform_Architecture_for_Service_Intensive_Digital_Governments_in_Large_Countries_D_2_750_v1_3_1467b55273.pdf",{"tag":57,"width":58,"height":25,"text":5528},"@TECHREPORT{CYBER:R33,\n  author = {I. Kromonov, M. Freudenthal, T. Toomere},\n  title = {Interoperability Platform Architecture for Large Digital Governments},\n  institution = {Cybernetica AS},\n  year = {2024},\n  number = {D-2-750},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":5530,"type":46,"excerpt":5531,"year":48,"authors":5532,"tags":5534,"pdfFile":5535,"pdfUrl":55,"extendedUrl":10,"bibTeX":5537},"Machine Learning on Confidential VMs","Cybernetica research report D-16-539. 2024.",[5533],{"author":51},[],{"url":5536},"\u002Fuploads\u002Fmachine_learning_on_confidential_vms_D_16_539_v1_1_ebd2a0fb49.pdf",{"tag":57,"width":58,"height":25,"text":5538},"@TECHREPORT{CYBER:R34,\n  author = {A. Kisand},\n  title = {Machine Learning onConfidential VMs},\n  institution = {Cybernetica AS},\n  year = {2024},\n  number = {D-16-539},\n  address = {\\url{https:\u002F\u002Fcyber.ee\u002Fresearch\u002Freports\u002F}}\n}\n",{"title":5540,"type":228,"excerpt":5541,"year":48,"authors":5542,"tags":5546,"pdfFile":10,"pdfUrl":5547,"extendedUrl":10,"bibTeX":5548},"Holistic Cyber Threat Modeling for Machine Learning-Based Systems: A Case Study in Healthcare","In Proceedings of the 18th International Joint Conference on Biomedical Engineering Systems and Technologies - HEALTHINF",[5543,5545],{"author":5544},"Jaal, J.",{"author":1700},[],"https:\u002F\u002Fwww.scitepress.org\u002FPublicationsDetail.aspx?ID=QA\u002FcpjJtUSc=&t=1",{"tag":10,"width":10,"height":10,"text":5549},"@conference{healthinf25,\nauthor={Janno Jaal and Hayretdin Bahsi},\ntitle={Holistic Cyber Threat Modeling for Machine Learning-Based Systems: A Case Study in Healthcare},\nbooktitle={Proceedings of the 18th International Joint Conference on Biomedical Engineering Systems and Technologies - HEALTHINF},\nyear={2025},\npages={319-329},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0013372300003911},\nisbn={978-989-758-731-3},\nissn={2184-4305},\n}",{"title":5551,"type":46,"excerpt":5552,"year":4126,"authors":5553,"tags":5573,"pdfFile":10,"pdfUrl":5574,"extendedUrl":10,"bibTeX":10},"Masinõppe ja AI toega teenused","Programmi RITA tegevuse 1 projekti „Masinõppe ja AI toega teenused“ lõpparuanne. 1−97. 2022.",[5554,5556,5558,5560,5562,5564,5566,5568,5570,5572],{"author":5555},"Solvak, M.",{"author":5557},"Vilo, J.",{"author":5559},"Reisberg, S.",{"author":5561},"Tamm, S.",{"author":5563},"Oja, M.",{"author":5565},"Ligi, K.",{"author":5567},"Unt, T.",{"author":5569},"Võrk, A.",{"author":5571},"Leets, P.",{"author":234},[],"https:\u002F\u002Fwww.etag.ee\u002Fwp-content\u002Fuploads\u002F2022\u002F05\u002FRITA_MAITT_LOPPARUANNE_FINAL.pdf",{"title":5576,"type":228,"excerpt":5577,"year":5436,"authors":5578,"tags":5586,"pdfFile":10,"pdfUrl":5587,"extendedUrl":10,"bibTeX":10},"Zero-Knowledge Proof-of-Location Protocols for Vehicle Subsidies and Taxation Compliance","Proceedings of the 5th International Workshop on Security and Privacy in Intelligent Infrastructures (SP2I 2025), held in conjunction with the 20th International Conference on Availability, Reliability and Security (ARES 2025). https:\u002F\u002Fdoi.org\u002F10.48550\u002FarXiv.2506.16812",[5579,5580,5581,5583,5584],{"author":135},{"author":5283},{"author":5582},"Jaakson, A.",{"author":219},{"author":5585},"Rebane, R-M.",[],"https:\u002F\u002Fwww.arxiv.org\u002Fpdf\u002F2506.16812",{"title":5589,"type":228,"excerpt":5590,"year":5436,"authors":5591,"tags":5599,"pdfFile":10,"pdfUrl":5600,"extendedUrl":10,"bibTeX":10},"A Taxonomy and Methodology for Proof-of-Location Systems","29th International Conference on Enterprise Design, Operations, and Computing (EDOC 2025). https:\u002F\u002Fdoi.org\u002F10.48550\u002FarXiv.2508.14230",[5592,5593,5594,5595,5597],{"author":5283},{"author":5489},{"author":234},{"author":5596},"Hadachi, A.",{"author":5598},"Norbisrach, U.",[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2508.14230",{"title":5602,"type":228,"excerpt":5603,"year":5436,"authors":5604,"tags":5608,"pdfFile":10,"pdfUrl":5609,"extendedUrl":10,"bibTeX":10},"Privacy-preserving server-supported decryption","Computer Security Foundations Symposium, CSF 2025. https:\u002F\u002Fdoi.org\u002F10.48550\u002FarXiv.2410.19338",[5605,5606,5607],{"author":219},{"author":355},{"author":4060},[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2410.19338",{"title":5611,"type":46,"excerpt":5612,"year":5436,"authors":5613,"tags":5619,"pdfFile":10,"pdfUrl":5620,"extendedUrl":10,"bibTeX":10},"Decentralized Proof-of-Location systems for trust, scalability, and privacy in digital societies","Scientific Reports. http:\u002F\u002Fdx.doi.org\u002F10.1038\u002Fs41598-025-04566-4",[5614,5615,5616,5617],{"author":5283},{"author":5596},{"author":234},{"author":5618},"Norbisrath, U.",[],"https:\u002F\u002Fwww.researchgate.net\u002Fpublication\u002F392441431_Decentralized_Proof-of-Location_systems_for_trust_scalability_and_privacy_in_digital_societies",{"title":5622,"type":228,"excerpt":5623,"year":5436,"authors":5624,"tags":5631,"pdfFile":10,"pdfUrl":5632,"extendedUrl":10,"bibTeX":10},"Trustworthy Decentralized Autonomous Machines: A New Paradigm in Automation Economy","IEEE International Workshop on Decentralized Physical Infrastructure Networks 2025, in conjunction with ICBC'25. https:\u002F\u002Fdoi.org\u002F10.48550\u002FarXiv.2504.15676",[5625,5626,5627,5629],{"author":5283},{"author":5489},{"author":5628},"Castillo, O.",{"author":5630},"Espinola, S.",[],"https:\u002F\u002Farxiv.org\u002Fpdf\u002F2504.15676",{"title":5634,"type":228,"excerpt":5635,"year":5436,"authors":5636,"tags":5643,"pdfFile":10,"pdfUrl":5644,"extendedUrl":10,"bibTeX":10},"Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting","Journal of Cryptology 38. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00145-024-09530-5",[5637,5638,5640,5642],{"author":1419},{"author":5639},"Pärn, C.",{"author":5641},"Saarse, H.",{"author":141},[],"https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs00145-024-09530-5",{"title":5646,"type":228,"excerpt":5647,"year":5436,"authors":5648,"tags":5653,"pdfFile":10,"pdfUrl":5654,"extendedUrl":10,"bibTeX":10},"Leveraging Call Detail Records to Uncover Azimuth Configuration Errors in Cellular Networks","2025 31st International Conference on Telecommunications (ICT), Budva, Montenegro, 2025, pp. 1-5, doi: 10.1109\u002FICT65093.2025.11046281.",[5649,5651,5652],{"author":5650},"Vajakas, T.",{"author":1396},{"author":5596},[],"https:\u002F\u002Fieeexplore.ieee.org\u002Fdocument\u002F11046281\u002F",{"title":5656,"type":228,"excerpt":5657,"year":5436,"authors":5658,"tags":5662,"pdfFile":10,"pdfUrl":5663,"extendedUrl":10,"bibTeX":10},"Proving vote correctness in the IVXV internet voting system","Sci Rep 15, 31793 (2025). https:\u002F\u002Fdoi.org\u002F10.1038\u002Fs41598-025-16764-1",[5659,5661],{"author":5660},"Kraavi, T.",{"author":141},[],"https:\u002F\u002Fwww.nature.com\u002Farticles\u002Fs41598-025-16764-1",{"title":5665,"type":228,"excerpt":5666,"year":5436,"authors":5667,"tags":5673,"pdfFile":10,"pdfUrl":5674,"extendedUrl":10,"bibTeX":10},"Two-Party ECDSA with JavaCard-Based Smartcards","Applied Cryptography and Network Security. ACNS 2025. Lecture Notes in Computer Science, vol 15826. Springer, Cham. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-031-95764-2_7",[5668,5670,5671],{"author":5669},"Dufka, A.",{"author":219},{"author":5672},"Švenda, P.",[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-031-95764-2_7",{"title":5540,"type":228,"excerpt":5676,"year":5436,"authors":5677,"tags":5680,"pdfFile":10,"pdfUrl":5681,"extendedUrl":10,"bibTeX":10},"18th International Conference on Health Informatics. http:\u002F\u002Fdx.doi.org\u002F10.5220\u002F0013372300003911",[5678,5679],{"author":5544},{"author":1700},[],"https:\u002F\u002Fwww.researchgate.net\u002Fpublication\u002F389361896_Holistic_Cyber_Threat_Modeling_for_Machine_Learning-Based_Systems_A_Case_Study_in_Healthcare",{"title":5683,"type":10,"excerpt":5684,"year":5436,"authors":5685,"tags":5693,"pdfFile":10,"pdfUrl":5694,"extendedUrl":10,"bibTeX":5695},"SynthGuard: Redefining Synthetic Data Generation with a Scalable and Privacy-Preserving Workflow Framework","Proceedings of the 1st International Workshop on Responsible Data Governance, Privacy, and Digital Transformation (RDGPT 2025), held in conjunction with the 20th International Conference on Availability, Reliability and Security (ARES 2025). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-00633-2_12",[5686,5687,5689,5691,5692],{"author":5283},{"author":5688},"Shoush, M.",{"author":5690},"Tamm, K.",{"author":5449},{"author":234},[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-00633-2_12",{"tag":10,"width":10,"height":10,"text":5696},"@InProceedings{10.1007\u002F978-3-032-00633-2_12,\nauthor=\"Brito, Eduardo\nand Shoush, Mahmoud\nand Tamm, Kristian\nand Etti, Paula\nand Kamm, Liina\",\neditor=\"Coppens, Bart\nand Volckaert, Bruno\nand Naessens, Vincent\nand De Sutter, Bjorn\",\ntitle=\"SynthGuard: Redefining Synthetic Data Generation with a Scalable and Privacy-Preserving Workflow Framework\",\nbooktitle=\"Availability, Reliability and Security\",\nyear=\"2025\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"193--211\",\nabstract=\"The growing reliance on data-driven applications in sectors such as healthcare, finance, and law enforcement underscores the need for secure, privacy-preserving, and scalable mechanisms for data generation and sharing. Synthetic data generation (SDG) has emerged as a promising approach but often relies on centralized or external processing, raising concerns about data sovereignty, domain ownership, and compliance with evolving regulatory standards. To overcome these issues, we introduce SynthGuard, a framework designed to ensure computational governance by enabling data owners to maintain control over SDG workflows. SynthGuard supports modular and privacy-preserving workflows, ensuring secure, auditable, and reproducible execution across diverse environments. In this paper, we demonstrate how SynthGuard addresses the complexities at the intersection of domain-specific needs and scalable SDG by aligning with requirements for data sovereignty and regulatory compliance. Developed iteratively with domain expert input, SynthGuard has been validated through real-world use cases, demonstrating its ability to balance security, privacy, and scalability while ensuring compliance. The evaluation confirms its effectiveness in implementing and executing SDG workflows and integrating privacy and utility assessments across various computational environments.\",\nisbn=\"978-3-032-00633-2\"\n}\n\n",{"title":5698,"type":14,"excerpt":5699,"year":48,"authors":5700,"tags":5702,"pdfFile":10,"pdfUrl":5703,"extendedUrl":10,"bibTeX":10},"Towards integration of mobile network data into analyzing human mobility","PhD thesis. University of Tartu, 2025.",[5701],{"author":5650},[],"https:\u002F\u002Fdspace.ut.ee\u002Fbitstreams\u002Fc50289b7-fb11-421b-afe6-78bdd4231d3d\u002Fdownload",{"title":5705,"type":14,"excerpt":5699,"year":5436,"authors":5706,"tags":5708,"pdfFile":10,"pdfUrl":5709,"extendedUrl":10,"bibTeX":10},"Threshold Cryptography on Secure Hardware Devices",[5707],{"author":5669},[],"https:\u002F\u002Fis.muni.cz\u002Fth\u002Frtv9a\u002Fthesis_proposal.pdf",{"title":5711,"type":14,"excerpt":5699,"year":5436,"authors":5712,"tags":5714,"pdfFile":10,"pdfUrl":5715,"extendedUrl":10,"bibTeX":10},"Prescriptive process monitoring under uncertainty and resource constraints",[5713],{"author":5688},[],"https:\u002F\u002Fdspace.ut.ee\u002Fbitstreams\u002F625f29a2-8889-47ce-becd-eced4f3b7ddc\u002Fdownload",{"title":5717,"type":14,"excerpt":5718,"year":5436,"authors":5719,"tags":5722,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Learning to Conduct, and Defend against, Hybrid Attacks","PhD thesis. University College London, Faculty of Engineering, Department of Computer Science, 2025.",[5720],{"author":5721},"Padur, K.",[],{"title":5724,"type":228,"excerpt":5725,"year":5726,"authors":5727,"tags":5734,"pdfFile":5735,"pdfUrl":5737,"extendedUrl":5738,"bibTeX":5739},"Parametric iteration in resource theories","34th EACSL Annual Conference on Computer Science Logic, CSL 2026, February 23–28, 2026, Paris, France. Ed. Guerrini, S.; König, B. Saarbrücken\u002FWadern: Schloss Dagstuhl , 29:1−29:23. (Leibniz International Proceedings in Informatics (LIPIcs); 363). DOI: 10.4230\u002FLIPIcs.CSL.2026.29",2026,[5728,5730,5732],{"author":5729},"Di Giorgio, A.",{"author":5731},"Sobocinski, P.",{"author":5733},"Voorneveld, N.",[],{"url":5736},"\u002Fuploads\u002FParametric_iteration_in_resource_theories_aadf23f096.pdf","https:\u002F\u002Fdrops.dagstuhl.de\u002Fentities\u002Fdocument\u002F10.4230\u002FLIPIcs.CSL.2026.29","https:\u002F\u002Fdrops.dagstuhl.de\u002Fstorage\u002F00lipics\u002Flipics-vol363-csl2026\u002FLIPIcs.CSL.2026.29\u002FLIPIcs.CSL.2026.29.pdf",{"tag":10,"width":10,"height":10,"text":5740},"@InProceedings{digiorgio_et_al:LIPIcs.CSL.2026.29,\n  author =\t{Di Giorgio, Alessandro and Sobocinski, Pawel and Voorneveld, Niels},\n  title =\t{{Parametric Iteration in Resource Theories}},\n  booktitle =\t{34th EACSL Annual Conference on Computer Science Logic (CSL 2026)},\n  pages =\t{29:1--29:23},\n  series =\t{Leibniz International Proceedings in Informatics (LIPIcs)},\n  ISBN =\t{978-3-95977-411-6},\n  ISSN =\t{1868-8969},\n  year =\t{2026},\n  volume =\t{363},\n  editor =\t{Guerrini, Stefano and K\\\"{o}nig, Barbara},\n  publisher =\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\\"u}r Informatik},\n  address =\t{Dagstuhl, Germany},\n  URL =\t\t{https:\u002F\u002Fdrops.dagstuhl.de\u002Fentities\u002Fdocument\u002F10.4230\u002FLIPIcs.CSL.2026.29},\n  URN =\t\t{urn:nbn:de:0030-drops-254541},\n  doi =\t\t{10.4230\u002FLIPIcs.CSL.2026.29},\n  annote =\t{Keywords: Markov categories, Cryptography, String diagrams, Asymptotic equivalence}\n}",{"title":5742,"type":228,"excerpt":5743,"year":5726,"authors":5744,"tags":5752,"pdfFile":5753,"pdfUrl":5755,"extendedUrl":5756,"bibTeX":5757},"Uncovering challenges of cybersecurity cross-regulation in EU legislation","In: Information and Software Technology, 193. DOI: 10.1016\u002Fj.infsof.2026.108033",[5745,5747,5749,5750],{"author":5746},"Canavese, D.",{"author":5748},"Ferreira, A.",{"author":234},{"author":5751},"Quesada Rodriguez, A.",[],{"url":5754},"\u002Fuploads\u002FUncovering_challenges_of_cybersecurity_cross_regulation_in_EU_legislation_9fd329be49.pdf","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950584926000224?via%3Dihub","https:\u002F\u002Firis.cnr.it\u002Fbitstream\u002F20.500.14243\u002F570263\u002F2\u002Fist%20-%20final.pdf",{"tag":10,"width":10,"height":10,"text":5758},"@article{CANAVESE2026108033,\ntitle = {Uncovering challenges of cybersecurity cross-regulation in EU legislation},\njournal = {Information and Software Technology},\nvolume = {193},\npages = {108033},\nyear = {2026},\nissn = {0950-5849},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.infsof.2026.108033},\nurl = {https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950584926000224},\nauthor = {Daniele Canavese and Afonso Ferreira and Liina Kamm and Adrian {Quesada Rodriguez}},\nkeywords = {Software compliance, Compliance-by-design, Cyber Resilience Act (CRA), Artificial Intelligence Act (AI act), Network and Information Security Directive (NIS 2), Cybersecurity Act (CSA), Radio Equipment Directive (RED)},\nabstract = {Context:\nThe European Union has recently introduced a suite of foundational digital regulations—the Cyber Resilience Act, the Artificial Intelligence Act, the Radio Equipment Directive, the NIS 2 Directive, and the Cybersecurity Act—that directly affect the engineering of software-intensive systems. While these instruments aim to enhance trust and security, their overlapping scopes generate a complex compliance landscape that software development must address at the design, implementation, and deployment stages.\nObjectives:\nThis paper examines the cross-regulatory impact of such EU cybersecurity legislation from a software engineering perspective, aiming to provide a set of guidelines and recommendations for implementing a compliance-by-design approach.\nMethod:\nWe analyze and compare the five legal instruments, focusing on how their obligations intersect with each other. We then translate their regulatory requirements into actionable artifacts, ranging from architectural constraints and security controls to organisational processes, using a legal engineering approach. Finally, we propose a compliance-by-design lifecycle pattern that integrates regulatory alignment into requirements engineering, system design, and testing.\nResults:\nTo demonstrate applicability, we evaluate three representative use cases: an AI-enabled power plant, an autonomous drone delivery platform, and an AI-powered clinical decision support system. These examples demonstrate that multiple regulatory regimes often govern software-based systems. We conclude with practical recommendations for suppliers, deployers, and policymakers towards an integrated compliance framework to promote compliance-aware software engineering.\nConclusion:\nOur findings indicate that the European digital landscape is shifting compliance from a post-hoc audit exercise to a design-time engineering principle. Embedding compliance early into the software development lifecycle not only supports regulatory alignment but also improves system resilience and trustworthiness.}\n}",{"title":5760,"type":228,"excerpt":5761,"year":5726,"authors":5762,"tags":5764,"pdfFile":10,"pdfUrl":5765,"extendedUrl":55,"bibTeX":5766},"Threshold Trust Logic"," In: Secure IT Systems. (403−423). Springer. (Lecture Notes in Computer Science; 16325). DOI: 10.1007\u002F978-3-032-14782-0_22",[5763],{"author":5733},[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-14782-0_22",{"tag":10,"width":10,"height":10,"text":5767},"@inproceedings{10.1007\u002F978-3-032-14782-0_22,\nauthor = {Voorneveld, Niels},\ntitle = {Threshold Trust Logic},\nyear = {2026},\nisbn = {978-3-032-14781-3},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-14782-0_22},\ndoi = {10.1007\u002F978-3-032-14782-0_22},\nabstract = {Distributed processes, such as multi-party computations and collaborative product pipelines, require many entities. To formulate formal guarantees of such processes involves the gathering and evaluation of claims of the entities involved. We consider a formal logic in which modalities are used to mark the channel in which such claims are made, specifying their source and target. Formally, we see each channel as some domain of knowledge, containing both literal claims and their consequences. We can combine such channels to express whether claims were made independently by different channels, or collaboratively by pooling claims from different channels. Together, this allows us to formulate more complex combinations we call threshold channels. We can use this logic to find out which sources need to be trusted, and which targets will have received sufficient claims, in order to prove a particular guarantee. The paper is split into two parts. First, we formulate and investigate the formal properties of a modal logic expressing threshold channels. Second, we consider how to apply this to reasoning about threshold claims for distributed processes.},\nbooktitle = {Secure IT Systems: 30th Nordic Conference, NordSec 2025, Tartu, Estonia, November 12-13, 2025, Proceedings},\npages = {403–423},\nnumpages = {21},\nkeywords = {Modal Logic, Distributed Systems, Formal Methods, Trust Management},\nlocation = {Tartu, Estonia}\n}",{"title":5769,"type":228,"excerpt":5770,"year":5726,"authors":5771,"tags":5775,"pdfFile":5776,"pdfUrl":5778,"extendedUrl":5778,"bibTeX":5779},"Universally Composable Server-Supported Signatures for Smartphones","Universally Composable Server-Supported Signatures for Smartphones. IACR Communications in Cryptology, 3 (1), 40pp. DOI: 10.62056\u002Fa3c3wa0kr",[5772,5773,5774],{"author":4062},{"author":4060},{"author":219},[],{"url":5777},"\u002Fuploads\u002FUniversally_Composable_Server_Supported_Signatures_for_Smartphones_012e3362d9.pdf","https:\u002F\u002Fcic.iacr.org\u002Fp\u002F3\u002F1\u002F13\u002Fpdf",{"tag":10,"width":10,"height":10,"text":5780},"@article{10.62056\u002Fa3c3wa0kr,\n         author={Nikita Snetkov and Jelizaveta Vakarjuk and Peeter Laud},\n         title={Universally Composable Server-Supported Signatures for Smartphones},\n         volume={3},\n         number={1},\n         year={2026},\n         date={2026-05-04},\n         issn={3006-5496},\n         doi={10.62056\u002Fa3c3wa0kr},\n         journal={{IACR} Communications in Cryptology},\n         publisher={International Association for Cryptologic Research}\n}",{"title":5782,"type":228,"excerpt":5783,"year":5726,"authors":5784,"tags":5791,"pdfFile":10,"pdfUrl":5792,"extendedUrl":10,"bibTeX":5793},"Towards Trusted Service Monitoring: Verifiable Service Level Agreements","In: Service-Oriented Computing 23rd International Conference, ICSOC 2025, Shenzhen, China, December 1–4, 2025, Proceedings, Part II. (159−174). Springer. (Lecture Notes in Computer Science; 16321). DOI: 10.1007\u002F978-981-95-5015-9_12",[5785,5786,5787,5788,5789],{"author":5489},{"author":5283},{"author":5492},{"author":3985},{"author":5790},"Heiss, J.",[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-981-95-5015-9_12",{"tag":10,"width":10,"height":10,"text":5794},"@InProceedings{10.1007\u002F978-981-95-5015-9_12,\nauthor=\"Castillo, Fernando\nand Brito, Eduardo\nand Werner, Sebastian\nand Pullonen-Raudvere, Pille\nand Heiss, Jonathan\",\neditor=\"Aiello, Marco\nand Deng, Shuiguang\nand Murillo, Juan-Manuel\nand Georgievski, Ilche\nand Benatallah, Boualem\nand Wang, Zhongjie\",\ntitle=\"Towards Trusted Service Monitoring: Verifiable Service Level Agreements\",\nbooktitle=\"Service-Oriented Computing\",\nyear=\"2026\",\npublisher=\"Springer Nature Singapore\",\naddress=\"Singapore\",\npages=\"159--174\",\nabstract=\"Service Level Agreement (SLA) monitoring in service-oriented environments suffers from inherent trust conflicts when providers self-report metrics, creating incentives to underreport violations. We introduce a framework for generating verifiable SLA violation claims through trusted hardware monitors and zero-knowledge proofs, establishing cryptographic foundations for genuine trustworthiness in service ecosystems. Our approach starts with machine-readable SLA clauses converted into verifiable predicates and monitored within Trusted Execution Environments. These monitors collect timestamped telemetry, organize measurements into Merkle trees, and produce signed attestations. Zero-knowledge proofs aggregate Service-Level Indicators to evaluate compliance, generating cryptographic proofs verifiable by stakeholders, arbitrators, or insurers in disputes, without accessing underlying data. This ensures three security properties: integrity, authenticity, and validity. Our prototype demonstrates linear scaling up to over 1 million events per hour for measurements with near constant-time proof generation and verification for single violation claims, enabling trustless SLA enforcement through cryptographic guarantees for automated compliance verification in service monitoring.\",\nisbn=\"978-981-95-5015-9\"\n}",{"title":5796,"type":228,"excerpt":5797,"year":5726,"authors":5798,"tags":5803,"pdfFile":5804,"pdfUrl":5806,"extendedUrl":5807,"bibTeX":5808},"Utilising Video Deepfakes for Paper Voting Privacy Defence","IET Information Security, 2026 (1), 1−19. DOI: 10.1049\u002Fise2\u002F2236872",[5799,5801,5802],{"author":5800},"Habanen, A.",{"author":141},{"author":236},[],{"url":5805},"\u002Fuploads\u002FUtilising_Video_Deepfakes_for_Paper_Voting_Privacy_Defence_59d84a2d5a.pdf","https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fepdf\u002F10.1049\u002Fise2\u002F2236872","https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002F10.1049\u002Fise2\u002F2236872",{"tag":10,"width":10,"height":10,"text":5809},"@article{https:\u002F\u002Fdoi.org\u002F10.1049\u002Fise2\u002F2236872,\nauthor = {Habanen, Anette and Willemson, Jan and Laur, Sven},\ntitle = {Utilising Video Deepfakes for Paper Voting Privacy Defence},\njournal = {IET Information Security},\nvolume = {2026},\nnumber = {1},\npages = {2236872},\ndoi = {https:\u002F\u002Fdoi.org\u002F10.1049\u002Fise2\u002F2236872},\nurl = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fabs\u002F10.1049\u002Fise2\u002F2236872},\neprint = {https:\u002F\u002Fietresearch.onlinelibrary.wiley.com\u002Fdoi\u002Fpdf\u002F10.1049\u002Fise2\u002F2236872},\nabstract = {The recent rise of artificial intelligence (AI) solutions has also had a significant impact on electoral processes. Most notably, deepfakes created by generative AI applications can (and have been) used to spread misinformation during the campaigns, but they can also be used for cyberattack automation, biased social media bots, etc. We instead present a positive use case for generative AI in manipulating video material required as proof of voting by potential coercers. For this, we have created a pipeline that takes a video of a voting ballot and replaces its critical content (in our case, the digits on the ballot). To achieve this, a YOLOv11 model is used to find the digits, a WavePaint image inpainting model is used to cover up the old digits and a separate image of the new digits is used to place them into the video. Additionally, we implemented the prototype application in the form of a web service and validated the outcome by asking the humans to distinguish fake ballot images and videos from the real ones. Our results show that humans can still recognise fake ballot videos relatively well, implying that requesting ballot videos is still an efficient attack against voter freedom in the case of paper voting. However, future developments in the generative AI techniques are likely to improve the situation significantly.},\nyear = {2026}\n}",{"title":5811,"type":228,"excerpt":5812,"year":5726,"authors":5813,"tags":5818,"pdfFile":10,"pdfUrl":5819,"extendedUrl":10,"bibTeX":10},"Secure IT Systems","Springer Cham. DOI: 10.1007\u002F978-3-032-14782-0",[5814,5815,5816],{"author":1959},{"author":234},{"author":5817},"Iqbal, M.",[],"https:\u002F\u002Flink.springer.com\u002Fbook\u002F10.1007\u002F978-3-032-14782-0",{"title":5589,"type":228,"excerpt":5821,"year":5726,"authors":5822,"tags":5828,"pdfFile":10,"pdfUrl":5829,"extendedUrl":10,"bibTeX":5830},"Enterprise Design, Operations, and Computing. Revised Selected Papers: 29th International Conference, EDOC 2025, Lisbon, Portugal, September 9–12, 2025. Springer, 228−244. DOI: 10.1007\u002F978-3-032-15140-7_13",[5823,5824,5825,5826,5827],{"author":5283},{"author":5489},{"author":234},{"author":5596},{"author":5618},[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-15140-7_13",{"tag":10,"width":10,"height":10,"text":5831},"@InProceedings{10.1007\u002F978-3-032-15140-7_13,\nauthor=\"Brito, Eduardo\nand Castillo, Fernando\nand Kamm, Liina\nand Hadachi, Amnir\nand Norbisrath, Ulrich\",\neditor=\"Gianola, Alessandro\nand Guizzardi, Renata\nand Borbinha, Jos{\\'e}\nand Mira da Silva, Miguel\nand Barateiro, Jos{\\'e}\",\ntitle=\"A Taxonomy and Methodology for Proof-of-Location Systems\",\nbooktitle=\"Enterprise Design, Operations, and Computing\",\nyear=\"2026\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"228--244\",\nabstract=\"Digital societies increasingly rely on trustworthy proofs of physical presence for services such as supply-chain tracking, e-voting, ride-sharing, and location-based rewards. Yet, traditional localization methods often lack cryptographic guarantees of where and when an entity was present, leaving them vulnerable to spoofing, replay, or collusion attacks. In response, research on Proof-of-Location (PoL) has emerged, with recent approaches combining distance bounding, distributed consensus, and privacy-enhancing techniques to enable verifiable, tamper-resistant location claims.\",\nisbn=\"978-3-032-15140-7\"\n}",{"title":5833,"type":228,"excerpt":5834,"year":5726,"authors":5835,"tags":5841,"pdfFile":5842,"pdfUrl":5844,"extendedUrl":55,"bibTeX":5845},"Cybersecurity-related support needs and challenges incurred by informal support: a study among Estonian home users","Journal of Cybersecurity, 12 (1), 1−17. DOI: 10.1093\u002Fcybsec\u002Ftyag006.",[5836,5837,5839],{"author":5457},{"author":5838},"Sütterlin, S.",{"author":5840},"Mällo, T.",[],{"url":5843},"\u002Fuploads\u002FCybersecurity_related_support_needs_and_challenges_32634d8adc.pdf","https:\u002F\u002Facademic.oup.com\u002Fcybersecurity\u002Farticle\u002F12\u002F1\u002Ftyag006\u002F8472656?login=false",{"tag":10,"width":10,"height":10,"text":5846},"@article{10.1093\u002Fcybsec\u002Ftyag006,\n    author = {Sein, Kati and Sütterlin, Stefan and Mällo, Tanel},\n    title = {Cybersecurity-related support needs and challenges incurred by informal support: a study among Estonian home users},\n    journal = {Journal of Cybersecurity},\n    volume = {12},\n    number = {1},\n    pages = {tyag006},\n    year = {2026},\n    month = {01},\n    abstract = {Estonia, recognized for its robust e-services and cybersecurity, currently lacks a dedicated cybersecurity support service for laypeople to address private cybersecurity issues. Instead, citizens rely primarily on friends and family for assistance. This study explores the cybersecurity support needs of Estonian home users, analyzing the concept of “cybersecurity caregiving,” where individuals offer voluntary, informal cybersecurity help. Using a mixed-methods approach, the study conducted seven interviews and surveyed 161 participants, broadly reflecting Estonia’s demographic makeup. Key findings indicate that users seek support primarily in cyber incident handling and situational awareness, with desired support characterized by accuracy, speed, accessibility, understandability, and cost-free availability. However, informal support often lacks accuracy and promptness, highlighting a gap that a professional support service could address. Additional findings reveal demographic-based risk patterns, where younger users, high-frequency internet users, and men report higher anticipation of poor advice, while women report dependency on cybersecurity caregivers. The study underscores the need for (1) education on personal cybersecurity priorities and self-reliance in cybersecurity; (2) empowering cybersecurity caregivers with resources; and (3) establishing a professional cybersecurity support services. It makes recommendations to bolster Estonia’s cyber resilience and proposes potential future research to address gaps for non-Estonian speakers and minors.},\n    issn = {2057-2085},\n    doi = {10.1093\u002Fcybsec\u002Ftyag006},\n    url = {https:\u002F\u002Fdoi.org\u002F10.1093\u002Fcybsec\u002Ftyag006},\n    eprint = {https:\u002F\u002Facademic.oup.com\u002Fcybersecurity\u002Farticle-pdf\u002F12\u002F1\u002Ftyag006\u002F66851171\u002Ftyag006.pdf},\n}",{"title":5848,"type":228,"excerpt":5849,"year":5436,"authors":5850,"tags":5853,"pdfFile":5854,"pdfUrl":5856,"extendedUrl":10,"bibTeX":5857},"End-To-End Verifiable Internet Voting with Partially Private Bulletin Boards","In: Electronic Voting. (73−89). Springer. (Lecture Notes in Computer Science; 16028). DOI: 10.1007\u002F978-3-032-05036-6_5",[5851,5852],{"author":1419},{"author":141},[],{"url":5855},"\u002Fuploads\u002FEnd_to_end_Verifiable_Internet_voting_with_partially_private_bulletin_boards_4b4a55cbdd.pdf","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-05036-6_5#citeas",{"tag":10,"width":10,"height":10,"text":5858},"@InProceedings{10.1007\u002F978-3-032-05036-6_5,\nauthor=\"Farzaliyev, Valeh\nand Willemson, Jan\",\neditor=\"Duenas-Cid, David\nand Roenne, Peter\nand Volkamer, Melanie\nand Blom, Michelle\nand Gaudry, Pierrick\nand Borucki, Isabelle\nand Loeber, Leontine\nand Debant, Alexandre\",\ntitle=\"End-To-End Verifiable Internet Voting with Partially Private Bulletin Boards\",\nbooktitle=\"Electronic Voting\",\nyear=\"2026\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"73--89\",\nabstract=\"In 2024, Harrison and Haines examined the applicability of STARKs in the context of homomorphically tallied elections. While their work ensures the Recorded-as-Cast and Tallied-as-Recorded properties of a voting system, it lacks Cast-as-Intended verification and does not provide a coercion mitigation mechanism. In this work, we address these challenges and propose an updated voting protocol that achieves all three verification properties, at the same time providing coercion resistance by allowing re-voting. Our approach leverages vector commitment schemes with update mechanisms. We implement our protocol and provide comparative benchmarks to the Harrison and Haines solution. Our approach significantly outperforms the latter, allowing processing a considerably larger number of votes within the same hardware limits.\",\nisbn=\"978-3-032-05036-6\"\n}",{"title":5860,"type":228,"excerpt":5861,"year":5436,"authors":5862,"tags":5864,"pdfFile":5865,"pdfUrl":5867,"extendedUrl":10,"bibTeX":5868},"Recommendations to OSCE\u002FODIHR (on How to Give Better Recommendations for Internet Voting)","In: Duenas-Cid, D., et al. Electronic Voting. E-Vote-ID 2025. Lecture Notes in Computer Science, vol 16028. Springer, Cham. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-05036-6_13",[5863],{"author":141},[],{"url":5866},"\u002Fuploads\u002FRecommendations_to_OSCE_ODIHR_8ce53e7f0c.pdf","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-05036-6_13#citeas",{"tag":10,"width":10,"height":10,"text":5869},"@InProceedings{10.1007\u002F978-3-032-05036-6_13,\nauthor=\"Willemson, Jan\",\neditor=\"Duenas-Cid, David\nand Roenne, Peter\nand Volkamer, Melanie\nand Blom, Michelle\nand Gaudry, Pierrick\nand Borucki, Isabelle\nand Loeber, Leontine\nand Debant, Alexandre\",\ntitle=\"Recommendations to OSCE\u002FODIHR (on How to Give Better Recommendations for Internet Voting)\",\nbooktitle=\"Electronic Voting\",\nyear=\"2026\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"208--223\",\nabstract=\"This paper takes a critical look at the recommendations OSCE\u002FODIHR has given for the Estonian Internet voting over the 20 years it has been running. We present examples of recommendations that can not be fulfilled at all, but also examples where fulfilling a recommendation requires a non-trivial trade-off, potentially weakening the system in some other respect. In such cases OSCE\u002FODIHR should take an explicit position which trade-off it recommends. We also look at the development of the recommendation to introduce end-to-end verifiability. In this case we expect OSCE\u002FODIHR to define what it exactly means by this property, as well as to give explicit criteria to determine whether and to which extent end-to-end verifiability has been achieved.\",\nisbn=\"978-3-032-05036-6\"\n}",{"title":5871,"type":228,"excerpt":5872,"year":5436,"authors":5873,"tags":5875,"pdfFile":5876,"pdfUrl":5878,"extendedUrl":10,"bibTeX":5879},"Forward Proof Search for Intuitionistic Multimodal K Logics","Automated Reasoning with Analytic Tableaux and Related Methods : 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27–29, 2025, Proceedings. Ed. Pozzato, Gian Luca; Uustalu, Tarmo. Cham: Springer, 335−353. (Lecture Notes in Computer Science; 15980 ). DOI: 10.1007\u002F978-3-032-06085-3_18",[5874],{"author":5733},[],{"url":5877},"\u002Fuploads\u002FForward_Proof_Search_for_Intuitionistic_Multimodal_K_Logics_855ebd7cd3.pdf","https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-06085-3_18",{"tag":10,"width":10,"height":10,"text":5880},"@InProceedings{10.1007\u002F978-3-032-06085-3_18,\nauthor=\"Voorneveld, Niels\",\neditor=\"Pozzato, Gian Luca\nand Uustalu, Tarmo\",\ntitle=\"Forward Proof Search for Intuitionistic Multimodal K Logics\",\nbooktitle=\"Automated Reasoning with Analytic Tableaux and Related Methods\",\nyear=\"2026\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"335--353\",\nabstract=\"We consider intuitionistic multimodal logics with modalities satisfying axiom K and the axiom of Necessity, as well as collections of axioms for transforming, removing and splitting modalities, specified by a relation between modalities and sequences of modalities. These axioms can be used for systems of knowledge and belief, describing multiple environments of truth and their awareness of each other. We extend Gentzen's decidable cut-free calculus to accommodate such multimodal systems, using a modal shift operation on contexts to extend the cut elimination proof in a novel way. We then adapt the inverse method to formulate a correct and complete forward proof search for these logics, which can be interpreted in a Fitch-style manner. Proof derivation is streamlined by implementing most derivations using the cut rule. The resulting proof search allows for making multiple queries, building a database of assumptions and their consequences which can be fine-tuned and updated to fit an application.\",\nisbn=\"978-3-032-06085-3\"\n}",{"title":5811,"type":228,"excerpt":5882,"year":5436,"authors":5883,"tags":5891,"pdfFile":10,"pdfUrl":5892,"extendedUrl":10,"bibTeX":10},"29th Nordic Conference, NordSec 2024 Karlstad, Sweden, November 6–7, 2024 Proceedings",[5884,5886,5887,5889],{"author":5885},"Iwaya, L.",{"author":234},{"author":5888},"Martucci, L.",{"author":5890},"Pulls, T.",[],"https:\u002F\u002Flink.springer.com\u002Fbook\u002F10.1007\u002F978-3-031-79007-2",{"title":5894,"type":46,"excerpt":10,"year":5436,"authors":5895,"tags":5906,"pdfFile":5907,"pdfUrl":5909,"extendedUrl":10,"bibTeX":10},"Algorithmic bias risk management methodology",[5896,5897,5898,5900,5901,5902,5904],{"author":135},{"author":5449},{"author":5899},"Kaminaga, H.",{"author":234},{"author":5840},{"author":5903},"Pern, T.",{"author":5905},"Stomakhin, F.",[],{"url":5908},"\u002Fuploads\u002Falgorithmic_bias_risk_management_methodology_505e3f9611.pdf","https:\u002F\u002Fwww.volinik.ee\u002Fen\u002Finformation-materials\u002Falgorithmic-bias-risk-management-methodology.html",{"title":5911,"type":228,"excerpt":5912,"year":5436,"authors":5913,"tags":5917,"pdfFile":10,"pdfUrl":5918,"extendedUrl":10,"bibTeX":10},"Preface","In: Lecture Notes in Computer Science LNCS",[5914,5915,5916],{"author":5885},{"author":234},{"author":5890},[],"https:\u002F\u002Fwww.scopus.com\u002Fpages\u002Fpublications\u002F85218681141",{"title":5920,"type":46,"excerpt":10,"year":5436,"authors":5921,"tags":5929,"pdfFile":5930,"pdfUrl":55,"extendedUrl":10,"bibTeX":10},"Algorithmic bias risk management guideline",[5922,5923,5924,5925,5926,5927,5928],{"author":135},{"author":5449},{"author":5899},{"author":234},{"author":5840},{"author":5903},{"author":5905},[],{"url":5931},"\u002Fuploads\u002Falgorithmic_bias_risk_management_gudieline_562ed95ca7.pdf",{"title":5933,"type":228,"excerpt":5934,"year":5436,"authors":5935,"tags":5939,"pdfFile":10,"pdfUrl":5940,"extendedUrl":10,"bibTeX":5941},"Novel Approximations of Elementary Functions in Zero-Knowledge Proofs","In: Lecture Notes in Computer Science. (165−182). Springer Science and Business Media Deutschland GmbH. DOI: 10.1007\u002F978-3-032-00642-4_10",[5936,5938],{"author":5937},"Kurik, K. A.",{"author":219},[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-3-032-00642-4_10",{"tag":10,"width":10,"height":10,"text":5942},"@InProceedings{10.1007\u002F978-3-032-00642-4_10,\nauthor=\"Kurik, Kaarel August\nand Laud, Peeter\",\neditor=\"Skopik, Florian\nand Naessens, Vincent\nand De Sutter, Bjorn\",\ntitle=\"Novel Approximations of Elementary Functions in Zero-Knowledge Proofs\",\nbooktitle=\"Availability, Reliability and Security\",\nyear=\"2025\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"165--182\",\nabstract=\"In this paper, we study the computation of complex mathematical functions in statements executed on top of zero-knowledge proofs (ZKP); these functions may include roots, exponentials and logarithms, trigonometry etc. While existing approaches to these functions in privacy-preserving computations (and sometimes also in general-purpose processors) have relied on polynomial approximation, more powerful methods are available for ZKP. In this paper, we note that in ZKP, all algebraic functions are exactly computable. Recognizing that, we proceed to the approximation of transcendental functions with algebraic functions. We develop methods of approximation, instantiate them on a number of common transcendental functions, and benchmark their precision and efficiency in comparison with best polynomial approximations.\",\nisbn=\"978-3-032-00642-4\"\n}",{"title":5944,"type":228,"excerpt":5945,"year":5436,"authors":5946,"tags":5949,"pdfFile":5950,"pdfUrl":5952,"extendedUrl":10,"bibTeX":5953},"Security Proof of Single-Source Shortest Distance Protocols Built on Secure Multiparty Computation Protocols","Cryptography, 9 (1), ARTN 1. DOI: 10.3390\u002Fcryptography9010001",[5947,5948],{"author":1394},{"author":219},[],{"url":5951},"\u002Fuploads\u002FSecurity_Proof_of_Single_Source_Shortest_Distance_Protocols_a1eb40d5e4.pdf","https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F9\u002F1\u002F1",{"tag":10,"width":10,"height":10,"text":5954},"@Article{cryptography9010001,\nAUTHOR = {Anagreh, Mohammad and Laud, Peeter},\nTITLE = {Security Proof of Single-Source Shortest Distance Protocols Built on Secure Multiparty Computation Protocols},\nJOURNAL = {Cryptography},\nVOLUME = {9},\nYEAR = {2025},\nNUMBER = {1},\nARTICLE-NUMBER = {1},\nURL = {https:\u002F\u002Fwww.mdpi.com\u002F2410-387X\u002F9\u002F1\u002F1},\nISSN = {2410-387X},\nABSTRACT = {Secure secret-sharing Single-Source Shortest Distance (SSSD) protocols, based on secure multiparty computation (SMC), offer a promising solution for securely distributing and managing sensitive information among multiple parties. However, formal security proofs for these protocols have largely been unexplored. This paper addresses this gap by providing the first security proof for the SSSD protocols using the privacy-preserving Bellman–Ford protocols. These new protocols offer significant enhancements in efficiency, particularly in handling large-scale graphs due to parallel computation. In our previous work, published in MDPI Cryptography, we introduced these protocols and presented extensive experiments on the Sharemind system that demonstrated their efficiency. However, that work did not include security proofs. Building on this foundation, the current paper rigorously proves the security of these protocols, offering valuable insights into their robustness and reliability. Furthermore, we discuss the adversarial model, security definitions, cryptographic assumptions, and sophisticated reduction techniques employed in the proof. This paper not only validates the security of the proposed protocols but also provides a detailed comparison of their performance with existing methods, highlighting their strengths and potential for future research in the field.},\nDOI = {10.3390\u002Fcryptography9010001}\n}",{"title":5956,"type":228,"excerpt":5957,"year":5436,"authors":5958,"tags":5967,"pdfFile":5968,"pdfUrl":5970,"extendedUrl":10,"bibTeX":5971},"Streamlining carbon neutrality efforts for small municipalities in Central and Eastern Europe: policy recommendations towards an effective and efficient implementation","European Energy Journal, 1−10. DOI: 10.4337\u002Feecj.2025.0003",[5959,5961,5963,5965],{"author":5960},"Milich, L.",{"author":5962},"Pagan, H.",{"author":5964},"Carosi, A.",{"author":5966},"Morcillo, M.",[],{"url":5969},"\u002Fuploads\u002FStreamlining_carbon_neutrality_efforts_for_small_municipalities_4736de6d85.pdf","https:\u002F\u002Fwww.elgaronline.com\u002Fview\u002Fjournals\u002Feecj\u002Faop\u002Farticle-10.4337-eecj.2025.0003\u002Farticle-10.4337-eecj.2025.0003.xml",{"tag":10,"width":10,"height":10,"text":5972},"@article { StreamliningcarbonneutralityeffortsforsmallmunicipalitiesinCentralandEasternEuropepolicyrecommendationstowardsaneffectiveandefficientimplementation,\n      author = \"Lenard Milich and Hector C. Pagan and Andrea Carosi and Miguel Morcillo\",\n      title = \"Streamlining carbon neutrality efforts for small municipalities in Central and Eastern Europe: policy recommendations towards an effective and efficient implementation\",\n      journal = \"The European Energy and Climate Journal\",\n      year = \"2025\",\n      publisher = \"Edward Elgar Publishing Ltd\",\n      address = \"Cheltenham, UK\",\n      doi = \"10.4337\u002Feecj.2025.0003\",\n      pages=      \"1 - 10\",\n      url = \"https:\u002F\u002Fwww.elgaronline.com\u002Fview\u002Fjournals\u002Feecj\u002Faop\u002Farticle-10.4337-eecj.2025.0003\u002Farticle-10.4337-eecj.2025.0003.xml\"\n}",{"title":5974,"type":46,"excerpt":10,"year":5436,"authors":5975,"tags":5983,"pdfFile":5984,"pdfUrl":5986,"extendedUrl":10,"bibTeX":10},"Algoritmilise kallutatuse riskihalduse juhend",[5976,5977,5978,5979,5980,5981,5982],{"author":135},{"author":5449},{"author":5899},{"author":234},{"author":5840},{"author":5903},{"author":5905},[],{"url":5985},"\u002Fuploads\u002Falgoritmilise_kallutatuse_riskihalduse_juhend_4a99cc9edf.pdf","https:\u002F\u002Fwww.volinik.ee\u002Finfomaterjalid\u002Falgoritmilise-kallutatuse-riskihalduse-juhend",{"title":5988,"type":46,"excerpt":10,"year":5436,"authors":5989,"tags":5997,"pdfFile":5998,"pdfUrl":6000,"extendedUrl":10,"bibTeX":10},"Algoritmilise kallutatuse riskihalduse metoodika",[5990,5991,5992,5993,5994,5995,5996],{"author":135},{"author":5449},{"author":5899},{"author":234},{"author":5840},{"author":5903},{"author":5905},[],{"url":5999},"\u002Fuploads\u002Falgoritmilise_kallutatuse_riskihalduse_metoodika_b6fac250ef.pdf","https:\u002F\u002Fwww.volinik.ee\u002Finfomaterjalid\u002Falgoritmilise-kallutatuse-riskihalduse-metoodika",{"title":6002,"type":46,"excerpt":10,"year":5436,"authors":6003,"tags":6022,"pdfFile":6023,"pdfUrl":6025,"extendedUrl":10,"bibTeX":10},"On the role of ENISA in cybersecurity for AI",[6004,6006,6007,6009,6011,6012,6014,6016,6018,6020],{"author":6005},"Pardo, M.",{"author":5748},{"author":6008},"Fogelström, E.",{"author":6010},"Haeberlen, T.",{"author":234},{"author":6013},"Kessler, E.",{"author":6015},"Klasen, W.",{"author":6017},"Lenco, S.",{"author":6019},"Mantere, M.",{"author":6021},"Matejic, A.",[],{"url":6024},"\u002Fuploads\u002FOn_the_role_of_ENISA_in_cybersecurity_for_AI_10ca564cf4.pdf","https:\u002F\u002Fwww.enisa.europa.eu\u002Fsites\u002Fdefault\u002Ffiles\u002F2025-07\u002FAG%20opinion%20paper%20on%20AI.pdf",{"title":6027,"type":228,"excerpt":6028,"year":5436,"authors":6029,"tags":6033,"pdfFile":10,"pdfUrl":6034,"extendedUrl":10,"bibTeX":6035},"Electrum: UC fail-stop server-supported signatures","Provable and Practical Security : 19th International Conference, ProvSec 2025, Yokohama, Japan, October 10–12, 2025, Proceedings. Ed. Yang, G.; Liu, S.; Su, C.; Otsuka, A; Lian, Z. Singapore: Springer, 88−107. (Lecture Notes in Computer Science; 16172). DOI: 10.1007\u002F978-981-95-2961-2_5",[6030,6031,6032],{"author":4062},{"author":4060},{"author":219},[],"https:\u002F\u002Flink.springer.com\u002Fchapter\u002F10.1007\u002F978-981-95-2961-2_5",{"tag":10,"width":10,"height":10,"text":6036},"@InProceedings{10.1007\u002F978-981-95-2961-2_5,\nauthor=\"Snetkov, Nikita\nand Vakarjuk, Jelizaveta\nand Laud, Peeter\",\neditor=\"Yang, Guomin\nand Liu, Shengli\nand Su, Chunhua\nand Otsuka, Akira\nand Lian, Zhuotao\",\ntitle=\"Electrum: UC Fail-Stop Server-Supported Signatures\",\nbooktitle=\"Provable and Practical Security\",\nyear=\"2026\",\npublisher=\"Springer Nature Singapore\",\naddress=\"Singapore\",\npages=\"88--107\",\nabstract=\"Migration to quantum-safe cryptography represents a significant technological shift, addressing the vulnerabilities of traditional cryptographic primitives, such as KEMs and digital signatures. Yet, a number of challenges remain, especially in the development of secure solutions for sophisticated cryptographic applications. One of them is Smart-ID, European server-supported (threshold) signing service.\",\nisbn=\"978-981-95-2961-2\"\n}",{"title":6038,"type":14,"excerpt":5435,"year":5436,"authors":6039,"tags":6042,"pdfFile":6043,"pdfUrl":10,"extendedUrl":10,"bibTeX":6045},"Eesti rahvastikuregistrile sarnase sünteetilise andmestiku reeglipõhine genereerimine",[6040],{"author":6041},"Eichhorn, R.",[],{"url":6044},"\u002Fuploads\u002FEichhorn_Andmeteadus_2025_5cb0d26a4f.pdf",{"tag":10,"width":10,"height":10,"text":6046},"@mastersthesis{MSc:Eichhorn25,\n  author  = {Rain Eichhorn},\n  title   = {{Eesti rahvastikuregistrile sarnase sünteetilise andmestiku reeglipõhine genereerimine}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002F6d7e7cdd-8801-4a52-b99d-f499b15f8e33}}\n} ",{"title":6048,"type":14,"excerpt":5435,"year":5436,"authors":6049,"tags":6051,"pdfFile":6052,"pdfUrl":10,"extendedUrl":10,"bibTeX":6054},"Deepfakes for Paper Vote Privacy Defence",[6050],{"author":5800},[],{"url":6053},"\u002Fuploads\u002FAnette_Habanen_Master_thesis_Deepfakes_for_Paper_Vote_Privacy_Defence_4187acc7ea.pdf",{"tag":10,"width":10,"height":10,"text":6055},"@mastersthesis{MSc:Habanen25,\n  author  = {Anette Habanen},\n  title   = {{Deepfakes for Paper Vote Privacy Defence}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002F65b0c71d-4d43-410c-a8f5-5a0c3991791b}}\n} ",{"title":6057,"type":14,"excerpt":6058,"year":5436,"authors":6059,"tags":6062,"pdfFile":6063,"pdfUrl":6065,"extendedUrl":10,"bibTeX":6066},"Converting Server-Supported RSA into a Fail-Stop Signature Scheme","MSc thesis. Tallinn University of Technology, 2025.",[6060],{"author":6061},"Türk, A.",[],{"url":6064},"\u002Fuploads\u002FCONVERTING_SERVER_SUPPORTED_RSA_INTO_A_FAIL_STOP_SIGNATURE_SCHEME_1c7d39aac8.pdf","https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002F82e91386-826b-4dab-b53a-795ce08b3f89",{"tag":10,"width":10,"height":10,"text":6067},"@mastersthesis{MSc:Türk25,\n  author  = {Andreas Türk},\n  title   = {{Converting Server-Supported RSA into a Fail-Stop Signature Scheme}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002F82e91386-826b-4dab-b53a-795ce08b3f89}}\n} ",{"title":6069,"type":14,"excerpt":5446,"year":48,"authors":6070,"tags":6073,"pdfFile":6074,"pdfUrl":10,"extendedUrl":10,"bibTeX":6076},"Analysis of CDOC 2.0 Protocols in ProVerif",[6071],{"author":6072},"Warren, L.",[],{"url":6075},"\u002Fuploads\u002FAnalysis_of_CDOC_2_0_Protocols_in_Pro_Verif_6375cd2f05.pdf",{"tag":10,"width":10,"height":10,"text":6077},"@mastersthesis{MSc:Warren24,\n  author  = {Liam Simonos Warren},\n  title   = {{Analysis of CDOC 2.0 Protocols in ProVerif}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2024},\n  note    = {\\url{http:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002Fc62a6ecd-730c-4f49-add8-4015664c8ddf}}\n} ",{"title":6079,"type":14,"excerpt":5435,"year":5436,"authors":6080,"tags":6082,"pdfFile":6083,"pdfUrl":6085,"extendedUrl":10,"bibTeX":6086},"Applications of Semigroup Actions to the Cryptanalysis of Diffie-Hellman-like Schemes",[6081],{"author":5639},[],{"url":6084},"\u002Fuploads\u002FApplications_of_semigroup_actions_to_the_cryptanalysis_of_Diffie_Hellman_like_schemes_b0f8dc7cf9.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F02e8e54e-454d-4ccf-ba38-fa3a283a9f42\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6087},"@mastersthesis{MSc:Pärn25,\n  author  = {Calvin Pärn},\n  title   = {{Applications of Semigroup Actions to the Cryptanalysis of Diffie-Hellman-like Schemes}},\n  school  = {Institute of Mathematics and Statistics, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F02e8e54e-454d-4ccf-ba38-fa3a283a9f42\u002Fcontent}}\n} ",{"title":6089,"type":14,"excerpt":5435,"year":5436,"authors":6090,"tags":6092,"pdfFile":6093,"pdfUrl":6095,"extendedUrl":10,"bibTeX":6096},"Framework for Privacy-Preserving Synthesis of Textual Data",[6091],{"author":5905},[],{"url":6094},"\u002Fuploads\u002Fstomakhin_andmeteadus_2025_91378216e7.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F39b50ed3-6bd2-4f4b-80e0-f84084362748\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6097},"@mastersthesis{MSc:Stomakhin25,\n  author  = {Fedor Stomakhin},\n  title   = {{Framework for Privacy-Preserving Synthesis of Textual Data}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F39b50ed3-6bd2-4f4b-80e0-f84084362748\u002Fcontent}}\n} ",{"title":6099,"type":14,"excerpt":5435,"year":5436,"authors":6100,"tags":6103,"pdfFile":6104,"pdfUrl":6106,"extendedUrl":10,"bibTeX":6107},"Väike- ja keskettevõtete infoturbe hindamine: kohandamise vajadused F4SLE raamistikule ja sellele tuginevale MASS tööriistale",[6101],{"author":6102},"Neider-Kuusalu, P.",[],{"url":6105},"\u002Fuploads\u002FNeider_Kuusalu_IT_mitteinformaatikutele_2025_0c2bf1116d.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F531b8c3c-2eaf-446e-bce7-fc2476599a04\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6108},"@mastersthesis{MSc:Neider-Kuusalu25,\n  author  = {Pille Neider-Kuusalu},\n  title   = {{Väike- ja keskettevõtete infoturbe hindamine: kohandamise vajadused F4SLE raamistikule ja sellele tuginevale MASS tööriistale}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F531b8c3c-2eaf-446e-bce7-fc2476599a04\u002Fcontent}}\n} ",{"title":6110,"type":14,"excerpt":5509,"year":48,"authors":6111,"tags":6114,"pdfFile":6115,"pdfUrl":6117,"extendedUrl":10,"bibTeX":6118},"E-valimiste protsessid Riigikogu valimiste näitel",[6112],{"author":6113},"Ütsik, L.",[],{"url":6116},"\u002Fuploads\u002FUtsik_IT_mitteinformaatikutele_2024_7b34279bd3.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F31511edf-509c-48b8-b1b0-a8c67539ac80\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6119},"@mastersthesis{MSc:Ütsik24,\n  author  = {Lauri Ütsik},\n  title   = {{E-valimiste protsessid Riigikogu valimiste näitel}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F31511edf-509c-48b8-b1b0-a8c67539ac80\u002Fcontent}}\n} ",{"title":6121,"type":14,"excerpt":5509,"year":48,"authors":6122,"tags":6125,"pdfFile":6126,"pdfUrl":6128,"extendedUrl":10,"bibTeX":6129},"Eesti infoturbe standardi (E-ITS) nõuete kirjeldamine riigihangetes",[6123],{"author":6124},"Koit, K.",[],{"url":6127},"\u002Fuploads\u002FKoit_I_Tmitteinformaatikutele_2024_3233862da7.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F80aab7f6-6d3d-491c-9faa-59a88833485d\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6130},"@mastersthesis{MSc:Koit24,\n  author  = {Kadri Koit},\n  title   = {{Eesti infoturbe standardi (E-ITS) nõuete kirjeldamine riigihangetes}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F80aab7f6-6d3d-491c-9faa-59a88833485d\u002Fcontent}}\n} ",{"title":6132,"type":14,"excerpt":5509,"year":48,"authors":6133,"tags":6136,"pdfFile":6137,"pdfUrl":6139,"extendedUrl":10,"bibTeX":6140},"Plokiahela kasutamine avalikes e-teenustes Eesti näitel",[6134],{"author":6135},"Pajoma, P.",[],{"url":6138},"\u002Fuploads\u002FPajoma_IT_Mitteinformaatikutele_2024_d9971eeae9.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Fbe7049e6-a79c-40c2-85cd-dc7f513bb7f7\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6141},"@mastersthesis{MSc:Pajoma24,\n  author  = {Pirgit Pajoma},\n  title   = {{Plokiahela kasutamine avalikes e-teenustes Eesti näitel}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Fbe7049e6-a79c-40c2-85cd-dc7f513bb7f7\u002Fcontent}}\n} ",{"title":6143,"type":14,"excerpt":5509,"year":48,"authors":6144,"tags":6147,"pdfFile":6148,"pdfUrl":6150,"extendedUrl":10,"bibTeX":6151},"Practical Zero-Knowledge within the European Digital Identity Framework: Implementing Privacy-Preserving Identity Checks",[6145],{"author":6146},"Saarela, U.",[],{"url":6149},"\u002Fuploads\u002FSaarela_SECCLO_2024_8595ee2669.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Fca02d2bb-cabb-4cb6-8a73-6df34f96b0c2\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6152},"@mastersthesis{MSc:Saarela24,\n  author  = {Uuna Saarela},\n  title   = {{Practical Zero-Knowledge within the European Digital Identity Framework: Implementing Privacy-Preserving Identity Checks}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Fca02d2bb-cabb-4cb6-8a73-6df34f96b0c2\u002Fcontent}}\n} ",{"title":6154,"type":14,"excerpt":5446,"year":48,"authors":6155,"tags":6157,"pdfFile":6158,"pdfUrl":6160,"extendedUrl":10,"bibTeX":6161},"Proving Vote Correctness in the Estonian Internet Voting System",[6156],{"author":5660},[],{"url":6159},"\u002Fuploads\u002FKraavi_masterthesis_e7bd17dca4.pdf","https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002Fitem\u002Fb70ea1b2-bb84-4707-80fe-f3dd19f5888f",{"tag":10,"width":10,"height":10,"text":6162},"@mastersthesis{MSc:Kraavi24,\n  author  = {Taaniel Kraavi},\n  title   = {{Proving Vote Correctness in the Estonian Internet Voting System}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002Fitem\u002Fb70ea1b2-bb84-4707-80fe-f3dd19f5888f}}\n}",{"title":6164,"type":14,"excerpt":5509,"year":48,"authors":6165,"tags":6168,"pdfFile":6169,"pdfUrl":6171,"extendedUrl":10,"bibTeX":6172},"Quantitative Analysis on Vulnerability to Electronic Business Identity Theft Among Estonian Companies",[6166],{"author":6167},"Jõgi, A.",[],{"url":6170},"\u002Fuploads\u002FJogi_cybersecurity_2024_b60f0989ca.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F45ad8bc4-2ff9-44bf-8930-0011819da6b6\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6173},"@mastersthesis{MSc:Jõgi24,\n  author  = {Andres Jõgi},\n  title   = {{Quantitative Analysis on Vulnerability to Electronic Business Identity Theft Among Estonian Companies}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F45ad8bc4-2ff9-44bf-8930-0011819da6b6\u002Fcontent}}\n} ",{"title":6175,"type":14,"excerpt":5509,"year":48,"authors":6176,"tags":6179,"pdfFile":10,"pdfUrl":6180,"extendedUrl":10,"bibTeX":6181},"Töötajate teadlikkus õngitsusrünnakutest Balt-Hellin OÜ näitel",[6177],{"author":6178},"Markus, K.",[],"https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002Fccf02715-aa67-44f9-af0b-a353c2468353",{"tag":10,"width":10,"height":10,"text":6182},"@mastersthesis{MSc:Markus24,\n  author  = {Kerli Markus},\n  title   = {{Töötajate teadlikkus õngitsusrünnakutest Balt-Hellin OÜ näitel}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2024},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fitems\u002Fccf02715-aa67-44f9-af0b-a353c2468353}}\n} ",{"title":6184,"type":14,"excerpt":4888,"year":4690,"authors":6185,"tags":6188,"pdfFile":6189,"pdfUrl":6191,"extendedUrl":10,"bibTeX":6192},"Experimental Integration of the Smart-ID Service Into Intel SGX Enclaves",[6186],{"author":6187},"Punnar, M.",[],{"url":6190},"\u002Fuploads\u002FMasters_Thesis_Punnar_38b7993974.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F1ede79d1-1925-456f-a4d6-7a962a052c98\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6193},"@mastersthesis{MSc:Punnar23,\n  author  = {Margus Punnar},\n  title   = {{Experimental Integration of the Smart-ID Service Into Intel SGX Enclaves}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2023},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F1ede79d1-1925-456f-a4d6-7a962a052c98\u002Fcontent}}\n} ",{"title":6195,"type":14,"excerpt":4191,"year":1391,"authors":6196,"tags":6199,"pdfFile":6200,"pdfUrl":6202,"extendedUrl":10,"bibTeX":6203},"An Integrated Approach for Certification and Re-certification Based on the Case Study of an Integrated Circuit",[6197],{"author":6198},"Jayavarshini, T.",[],{"url":6201},"\u002Fuploads\u002FJayavarshini_Thirumalai_04d635122a.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F54cd2fba-288c-42b2-afa8-14d964c5d551\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6204},"@mastersthesis{MSc:Jayavarshini21,\n  author  = {Thirumalai Jayavarshini},\n  title   = {{An Integrated Approach for Certification and Re-certification Based on the Case Study of an Integrated Circuit}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2021},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F54cd2fba-288c-42b2-afa8-14d964c5d551\u002Fcontent}}\n} ",{"title":6206,"type":14,"excerpt":4209,"year":1391,"authors":6207,"tags":6210,"pdfFile":6211,"pdfUrl":6213,"extendedUrl":10,"bibTeX":6214},"Benchmarking of Android Applications' System Calls Behavior: Implications for Malware Detection",[6208],{"author":6209},"Välbe, M.",[],{"url":6212},"\u002Fuploads\u002FVaelbe_Master_Thesis_583edd2c4d.pdf","https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002F4cdf8662-8149-4f60-863c-80acc2b01f5a",{"tag":10,"width":10,"height":10,"text":6215},"@mastersthesis{MSc:Välbe21,\n  author  = {Martin Välbe},\n  title   = {{Benchmarking of Android Applications' System Calls Behavior: Implications for Malware Detection}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2021},\n  note    = {\\url{https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002F4cdf8662-8149-4f60-863c-80acc2b01f5a}}\n} ",{"title":6217,"type":14,"excerpt":4209,"year":1391,"authors":6218,"tags":6220,"pdfFile":6221,"pdfUrl":6223,"extendedUrl":10,"bibTeX":6224},"Converting a Post-Quantum Signature Scheme to a Two-Party Signature Scheme",[6219],{"author":4060},[],{"url":6222},"\u002Fuploads\u002FVakarjuk_Master_Thesis_778dd76821.pdf","https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002Fcf7cd20f-9467-44ce-94ed-1133f2b42ae8",{"tag":10,"width":10,"height":10,"text":6225},"@mastersthesis{MSc:Vakarjuk21,\n  author  = {Jelizaveta Vakarjuk},\n  title   = {{Converting a Post-Quantum Signature Scheme to a Two-Party Signature Scheme}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2021},\n  note    = {\\url{https:\u002F\u002Fdigikogu.taltech.ee\u002Fet\u002FItem\u002Fcf7cd20f-9467-44ce-94ed-1133f2b42ae8}}\n} ",{"title":6227,"type":14,"excerpt":6228,"year":1391,"authors":6229,"tags":6232,"pdfFile":6233,"pdfUrl":6235,"extendedUrl":10,"bibTeX":10},"Estonian Electronic Identity Card and its Security Challenges","PhD thesis. University of Tartu, 2021.",[6230],{"author":6231},"Paršovs, A.",[],{"url":6234},"\u002Fuploads\u002Fparsovs_arnis_ce9aaeb04f.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Ff78915b7-93fe-4f35-8c04-f6d387ee29d0\u002Fcontent",{"title":6237,"type":14,"excerpt":4209,"year":1391,"authors":6238,"tags":6241,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10}," Evaluation of Secure Communication Solutions for Data Processing in Autonomous Vehicles",[6239],{"author":6240},"Vilur, R.",[],{"title":6243,"type":14,"excerpt":6244,"year":16,"authors":6245,"tags":6248,"pdfFile":6249,"pdfUrl":6251,"extendedUrl":10,"bibTeX":6252}," Integrating User Identity with Ethereum Smart Contract Wallet","MSc thesis. University of Tartu, 2019.",[6246],{"author":6247},"Tsõganov, A.",[],{"url":6250},"\u002Fuploads\u002FTsoganov_thesis_c6e8919889.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F739eb335-afee-40b0-bd69-1ccaa39bf43e\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6253},"@mastersthesis{MSc:Tsõganov19,\n  author  = {Aleksandr Tsõganov},\n  title   = {{Integrating User Identity with Ethereum Smart Contract Wallet}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2019},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F739eb335-afee-40b0-bd69-1ccaa39bf43e\u002Fcontent}}\n} ",{"title":6255,"type":14,"excerpt":6244,"year":16,"authors":6256,"tags":6258,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Multi-level Policy-aware Privacy Analysis",[6257],{"author":1972},[],{"title":6260,"type":14,"excerpt":6244,"year":16,"authors":6261,"tags":6264,"pdfFile":10,"pdfUrl":6265,"extendedUrl":10,"bibTeX":10},"Penetration Testing of Glia's Web Application",[6262],{"author":6263},"Sarapuu, D.",[],"https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F3ee6d576-d5c2-4c35-83ba-c93821510929\u002Fcontent",{"title":6267,"type":14,"excerpt":6244,"year":16,"authors":6268,"tags":6271,"pdfFile":6272,"pdfUrl":6274,"extendedUrl":10,"bibTeX":6275},"Security of Health Information Databases",[6269],{"author":6270},"Simisker, M.",[],{"url":6273},"\u002Fuploads\u002FSimisker_thesis_99c2988a31.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Ff4cb32a7-843b-4f25-b3d6-614de7416c1e\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6276},"@mastersthesis{MSc:Simisker19,\n  author  = {Mart Simisker},\n  title   = {{Penetration Testing of Glia's Web Application}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2019},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Ff4cb32a7-843b-4f25-b3d6-614de7416c1e\u002Fcontent}}\n} ",{"title":6278,"type":14,"excerpt":6244,"year":16,"authors":6279,"tags":6282,"pdfFile":6283,"pdfUrl":6285,"extendedUrl":10,"bibTeX":6286},"Võltsitud PDF dokumentide tuvastamise võimalused",[6280],{"author":6281},"Purga, I.",[],{"url":6284},"\u002Fuploads\u002FPurga_thesis_6dbc82734a.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Ffc16dcae-532b-4e3c-8f86-8f3d70f6013c\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6287},"@mastersthesis{MSc:Purga19,\n  author  = {Indrek Purga},\n  title   = {{Võltsitud PDF dokumentide tuvastamise võimalused}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2019},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002Ffc16dcae-532b-4e3c-8f86-8f3d70f6013c\u002Fcontent}}\n} ",{"title":6289,"type":14,"excerpt":6290,"year":107,"authors":6291,"tags":6294,"pdfFile":6295,"pdfUrl":6297,"extendedUrl":10,"bibTeX":6298},"Töötajatest tulenevate infoturbe riskide analüüs Eesti Kirjandusmuuseumi näitel","MSc thesis. University of Tartu, 2018.",[6292],{"author":6293},"Soonberg-Kaine, M.",[],{"url":6296},"\u002Fuploads\u002FSoonberg_thesis_8f74fbc5ec.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F3d0ea58a-d35c-4e5e-9deb-a339edaf93fa\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6299},"@mastersthesis{MSc:Soonberg-Kaine18,\n  author  = {Maarja Soonberg-Kaine},\n  title   = {{Eesti rahvastikuregistrile sarnase sünteetilise andmestiku reeglipõhine genereerimine}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2018},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F3d0ea58a-d35c-4e5e-9deb-a339edaf93fa\u002Fcontent}}\n} ",{"title":6301,"type":10,"excerpt":6302,"year":95,"authors":6303,"tags":6306,"pdfFile":6307,"pdfUrl":6309,"extendedUrl":10,"bibTeX":10},"Efficient Cryptographic Protocols for Secure and Private Remote Databases","PhD thesis. University of Tartu, 2011.",[6304],{"author":6305},"Bingsheng, Z.",[],{"url":6308},"\u002Fuploads\u002Fzhang_bingsheng_13b018f86c.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F9d50ca65-13f7-4e7a-86c7-6e58652575a9\u002Fcontent",{"title":6311,"type":14,"excerpt":6312,"year":5726,"authors":6313,"tags":6316,"pdfFile":10,"pdfUrl":10,"extendedUrl":10,"bibTeX":10},"Semantic Interpretation of String Diagrams","MSc thesis. Tallinn University of Technology, 2026.",[6314],{"author":6315},"Kuusk, A.O.",[],{"title":6318,"type":14,"excerpt":6312,"year":5726,"authors":6319,"tags":6322,"pdfFile":10,"pdfUrl":10,"extendedUrl":6323,"bibTeX":10},"Assessing Post-Quantum Cryptography Readiness in the Banking Sector",[6320],{"author":6321},"Kruusimäe, M-L.",[],"https:\u002F\u002Fwww.etis.ee\u002FPortal\u002FMentorships\u002FDisplay\u002F7b9e0086-7bda-4900-b32b-b10c1910cc9f",{"title":6325,"type":14,"excerpt":6326,"year":164,"authors":6327,"tags":6331,"pdfFile":10,"pdfUrl":6332,"extendedUrl":6333,"bibTeX":6334},"Sharemind: a framework for fast privacy-preserving computations.","In Proceedings of 13th European Symposium on Research in Computer Security, ESORICS 2008, LNCS, vol. 5283, pp. 192-206. Springer, Heidelberg. 2008.",[6328,6329,6330],{"author":68},{"author":204},{"author":85},[],"http:\u002F\u002Fdx.doi.org\u002F10.1007\u002F978-3-540-88313-5_13","http:\u002F\u002Feprint.iacr.org\u002F2008\u002F289",{"tag":6335,"width":447,"height":42,"text":6336},"Sharemind MPC","@inproceedings {ESORICS08:BLW08,\n   author = {Dan Bogdanov and Sven Laur and Jan Willemson},\n   title = {{Sharemind: A Framework for Fast Privacy-Preserving Computations}},\n   booktitle = {Proceedings of the 13th European Symposium on Research in Computer Security - ESORICS'08},\n   series = {Lecture Notes in Computer Science},\n   editor = {Jajodia, Sushil and Lopez, Javier},\n   publisher = {Springer Berlin \u002F Heidelberg},\n   isbn = {978-3-540-88312-8},\n   keyword = {Computer Science},\n   pages = {192-206},\n   volume = {5283},\n   year = {2008}\n}\n",{"title":6338,"type":228,"excerpt":6339,"year":5726,"authors":6340,"tags":6348,"pdfFile":6350,"pdfUrl":6352,"extendedUrl":55,"bibTeX":6353},"SLAMP-FSS: Two-Party Multi-Point Function Secret Sharing from Simple Linear Algebra","IACR Communications in Cryptology, 3 (1). DOI: 10.62056\u002Favommpxqi",[6341,6343,6344,6345,6347],{"author":6342},"Külaots, E.",{"author":19},{"author":1545},{"author":6346},"Pisetskaya, D.",{"author":3985},[6349],{"tag":6335},{"url":6351},"\u002Fuploads\u002FSLAMP_FSS_Two_Party_Multi_Point_Function_Secret_Sharing_from_Simple_Linear_Algebra_676d0407cf.pdf","https:\u002F\u002Fcic.iacr.org\u002Fp\u002F3\u002F1\u002F16\u002Fpdf",{"tag":10,"width":10,"height":10,"text":6354},"@article{10.62056\u002Favommpxqi,\n         author={Erki Külaots and Toomas Krips and Hendrik Eerikson and Darya Pisetskaya and Pille Pullonen-Raudvere},\n         title={{SLAMP}-{FSS}: Two-Party Multi-Point Function Secret Sharing from Simple Linear Algebra},\n         volume={3},\n         number={1},\n         year={2026},\n         date={2026-05-04},\n         issn={3006-5496},\n         doi={10.62056\u002Favommpxqi},\n         journal={{IACR} Communications in Cryptology},\n         publisher={International Association for Cryptologic Research}\n}",{"title":6356,"type":228,"excerpt":6357,"year":5436,"authors":6358,"tags":6362,"pdfFile":10,"pdfUrl":6364,"extendedUrl":10,"bibTeX":6365},"Decade of Advancement: Evaluating Multi-Party Computation Progress in Satellite Collision Avoidance","Proc. 9th European Conference on Space Debris, Bonn, Germany, 1–4 April 2025, published by the ESA Space Debris Office.",[6359,6360],{"author":4150},{"author":6361},"Veskus, K. H.",[6363],{"tag":6335},"https:\u002F\u002Fconference.sdo.esoc.esa.int\u002Fproceedings\u002Fsdc9\u002Fpaper\u002F286\u002FSDC9-paper286.pdf",{"tag":10,"width":10,"height":10,"text":6366},"@article{10YearsMPC,\ntitle = {Decade of Advancement: Evaluating Multi-Party Computation Progress in Satellite Collision Avoidance},\njournal = {Proc. 9th European Conference on Space Debris},\nyear = {2025},\nurl = {https:\u002F\u002Fconference.sdo.esoc.esa.int\u002Fproceedings\u002Fsdc9\u002Fpaper\u002F286\u002FSDC9-paper286.pdf},\nauthor = {Sandhra-Mirella Valdma and Karl Hannes Veskus}\n}",{"title":6368,"type":14,"excerpt":5435,"year":5436,"authors":6369,"tags":6372,"pdfFile":6374,"pdfUrl":6376,"extendedUrl":10,"bibTeX":6377},"Architecture of Secure Multi-Party Computation as a Service with No Single Point of Trust",[6370],{"author":6371},"Zakatov, A.",[6373],{"tag":6335},{"url":6375},"\u002Fuploads\u002FZakatov_Software_Engineering_2025_8cc16c6bc4.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F57502a7e-d0bb-479b-b4c6-e49f8b1db588\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6378},"@mastersthesis{MSc:Zakatov25,\n  author  = {Anton Zakatov},\n  title   = {{Architecture of Secure Multi-Party Computation as a Service with No Single Point of Trust}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F57502a7e-d0bb-479b-b4c6-e49f8b1db588\u002Fcontent}}\n} ",{"title":6380,"type":228,"excerpt":6381,"year":48,"authors":6382,"tags":6389,"pdfFile":6391,"pdfUrl":6393,"extendedUrl":55,"bibTeX":6394},"MPCFL: Towards Multi-party Computation for Secure Federated Learning Aggregation","UCC '23: Proceedings of the IEEE\u002FACM 16th International Conference on Utility and Cloud Computing, December 2023.",[6383,6384,6386,6388],{"author":5899},{"author":6385},"Awaysheh, F.M.",{"author":6387},"Alawadi, S.",{"author":234},[6390],{"tag":6335},{"url":6392},"\u002Fuploads\u002FTowards_Multi_party_Computation_for_Secure_Federated_Learning_Aggregation_D_2_584_v1_0_1bcb045e96.pdf","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3603166.3632144",{"tag":10,"width":10,"height":10,"text":6395},"@inproceedings{10.1145\u002F3603166.3632144,\nauthor = {Kaminaga, Hiroki and Awaysheh, Feras M. and Alawadi, Sadi and Kamm, Liina},\ntitle = {MPCFL: Towards Multi-party Computation for Secure Federated Learning Aggregation},\nyear = {2024},\nisbn = {9798400702341},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https:\u002F\u002Fdoi.org\u002F10.1145\u002F3603166.3632144},\ndoi = {10.1145\u002F3603166.3632144},\nabstract = {In the rapidly evolving machine learning (ML) and distributed systems realm, the escalating concern for data privacy naturally comes to the forefront of discussions. Federated learning (FL) emerges as a pivotal technology capable of addressing the inherent issues of centralized data privacy. However, FL architectures with centralized orchestration are still vulnerable, especially in the aggregation phase. A malicious server can exploit the aggregation process to learn about participants' data. This study proposes MPCFL, a secure FL algorithm based on secure multi-party computation (MPC) and secret sharing. The proposed algorithm leverages the Sharemind MPC framework to aggregate local model updates for securely formulating a global model. MPCFL provides practical mitigation of trending FL concerns, e.g., inference attack, gradient leakage attack, model poisoning, and model inversion. The algorithm is evaluated on several benchmark datasets and shows promising results. Our results demonstrate that the proposed algorithm is viable for developing secure and privacy-preserving FL applications, significantly improving all performance metrics while maintaining security and reliability. This investigation is a precursor to deeper explorations to craft robust FL aggregation algorithms.},\nbooktitle = {Proceedings of the IEEE\u002FACM 16th International Conference on Utility and Cloud Computing},\narticleno = {19},\nnumpages = {10},\nkeywords = {federated learning, multi-party computation, secret sharing, privacy-preserving, data security},\nlocation = {\u003Cconf-loc>, \u003Ccity>Taormina (Messina)\u003C\u002Fcity>, \u003Ccountry>Italy\u003C\u002Fcountry>, \u003C\u002Fconf-loc>},\nseries = {UCC '23}\n}",{"title":6397,"type":14,"excerpt":6398,"year":230,"authors":6399,"tags":6401,"pdfFile":10,"pdfUrl":6403,"extendedUrl":10,"bibTeX":6404},"Applying Secure Multi-party Computation in Practice.","PhD thesis. University of Tartu. 2016.",[6400],{"author":191},[6402],{"tag":6335},"http:\u002F\u002Fhdl.handle.net\u002F10062\u002F50510",{"tag":10,"width":159,"height":90,"text":6405},"@phdthesis{UT:Talviste16,\n  author = {Riivo Talviste},\n  title = {Applying Secure Multi-party Computation in Practice},\n  school = {University of Tartu},\n  year = {2016},\n  url = {http:\u002F\u002Fdspace.ut.ee\u002Fhandle\u002F10062\u002F50510}\n}\n",{"title":6407,"type":228,"excerpt":6408,"year":164,"authors":6409,"tags":6413,"pdfFile":10,"pdfUrl":6415,"extendedUrl":10,"bibTeX":6416},"Sharemind: a framework for fast privacy-preserving computations","In: Jajodia, S., Lopez, J. (eds) Computer Security - ESORICS 2008. ESORICS 2008. Lecture Notes in Computer Science, vol 5283. Springer, Berlin, Heidelberg.",[6410,6411,6412],{"author":135},{"author":2774},{"author":141},[6414],{"tag":6335},"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-540-88313-5_13",{"tag":10,"width":10,"height":10,"text":6417},"@InProceedings{10.1007\u002F978-3-540-88313-5_13,\nauthor=\"Bogdanov, Dan\nand Laur, Sven\nand Willemson, Jan\",\neditor=\"Jajodia, Sushil\nand Lopez, Javier\",\ntitle=\"Sharemind: A Framework for Fast Privacy-Preserving Computations\",\nbooktitle=\"Computer Security - ESORICS 2008\",\nyear=\"2008\",\npublisher=\"Springer Berlin Heidelberg\",\naddress=\"Berlin, Heidelberg\",\npages=\"192--206\",\nabstract=\"Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably secure and efficient general-purpose computation system to address this problem. Our solution---Sharemind---is a virtual machine for privacy-preserving data processing that relies on share computing techniques. This is a standard way for securely evaluating functions in a multi-party computation environment. The novelty of our solution is in the choice of the secret sharing scheme and the design of the protocol suite. We have made many practical decisions to make large-scale share computing feasible in practice. The protocols of Sharemind are information-theoretically secure in the honest-but-curious model with three computing participants. Although the honest-but-curious model does not tolerate malicious participants, it still provides significantly increased privacy preservation when compared to standard centralised databases.\",\nisbn=\"978-3-540-88313-5\"\n}\n",{"title":6419,"type":228,"excerpt":6420,"year":5726,"authors":6421,"tags":6425,"pdfFile":10,"pdfUrl":6426,"extendedUrl":10,"bibTeX":6427},"Leveraging Public Data for High-Fidelity Gradient Inversion","2026 2nd International Conference on Federated Learning and Intelligent Computing Systems (FLICS), Valencia, Spain, 2026, pp. 414-422, doi: 10.1109\u002FFLICS70075.2026.11621947.",[6422,6423,6424],{"author":5899},{"author":236},{"author":234},[],"https:\u002F\u002Fieeexplore.ieee.org\u002Fdocument\u002F11621947",{"tag":10,"width":10,"height":10,"text":6428},"@INPROCEEDINGS{11621947,\n  author={Kaminaga, Hiroki and Laur, Sven and Kamm, Liina},\n  booktitle={2026 2nd International Conference on Federated Learning and Intelligent Computing Systems (FLICS)}, \n  title={Leveraging Public Data for High-Fidelity Gradient Inversion}, \n  year={2026},\n  volume={},\n  number={},\n  pages={414-422},\n  keywords={Federated learning;Modeling;Equations;Printing;Training;Privacy;Labeling;Aggregates;Optimization;Signal detection;federated learning;gradient inversion;privacy;public data;information leakage},\n  doi={10.1109\u002FFLICS70075.2026.11621947}}",{"title":6430,"type":14,"excerpt":6431,"year":5726,"authors":6432,"tags":6435,"pdfFile":6436,"pdfUrl":6438,"extendedUrl":10,"bibTeX":10},"From Data Silos to Integrated Assurance: A Synthetic Data Approach to the Three Lines Model for Governance, Risk, and Compliance.","MSc thesis. University of Tartu, 2026.",[6433],{"author":6434},"Faridha, D. I.",[],{"url":6437},"\u002Fuploads\u002FFaridha_ITM_2026_812417689f.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002Ff12151b2-c92a-41f4-9e55-d621cb954c14",{"title":6440,"type":228,"excerpt":6441,"year":5726,"authors":6442,"tags":6446,"pdfFile":10,"pdfUrl":6447,"extendedUrl":10,"bibTeX":6448},"Coppercloud: Blind Server-Supported RSA Signatures.","Proceedings of the 23rd International Conference on Security and Cryptography, 1: The 23rd International Conference on Security and Cryptography (SECRYPT 2026); Porto - Portugal, Vila Galé Porto hotel; 16-18 July 2026. Ed. Sabrina De Capitani Di Vimercati and Pierangela Samarati. SciTePress, 419−428. DOI: 10.5220\u002F0015000200004103.",[6443,6444,6445],{"author":4062},{"author":4060},{"author":355},[],"https:\u002F\u002Feprint.iacr.org\u002F2025\u002F1824",{"tag":10,"width":10,"height":10,"text":6449},"@conference{secrypt26,\nauthor={Nikita Snetkov and Jelizaveta Vakarjuk and Alisa Pankova},\ntitle={Coppercloud: Blind Server-Supported RSA Signatures},\nbooktitle={Proceedings of the 23rd International Conference on Security and Cryptography - Volume 1: SECRYPT},\nyear={2026},\npages={419-428},\npublisher={SciTePress},\norganization={INSTICC},\ndoi={10.5220\u002F0015000200004103},\nisbn={978-989-758-858-7},\nissn={2184-7711},\n}",{"title":6451,"type":14,"excerpt":6452,"year":5726,"authors":6453,"tags":6456,"pdfFile":6457,"pdfUrl":6459,"extendedUrl":10,"bibTeX":6460},"Interpolation of Satellite Orbital States in the Context of ShareSat.","BSc thesis. University of Tartu, 2026.",[6454],{"author":6455},"Varkel, K.",[],{"url":6458},"\u002Fuploads\u002FVarkel_computer_science_2026_2aa625b7e2.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002F6bac92d2-4d00-4887-bac3-bb18fdaf019f",{"tag":10,"width":10,"height":10,"text":6461},"@bachelorsthesis{varkel2026interpolation,\nauthor = {Kätryn Varkel},\ntitle = {Interpolation of Satellite Orbital States in the Context of ShareSat},\nschool = {University of Tartu},\nyear = {2026},\ntype = {Bachelor's thesis},\nsupervisor = {Karl Hannes Veskus, Sandhra-Mirella Valdma, and Hendrik Eerikson}\n}",{"title":6463,"type":14,"excerpt":6431,"year":5726,"authors":6464,"tags":6467,"pdfFile":6468,"pdfUrl":6470,"extendedUrl":10,"bibTeX":6471},"Adding Garbled Circuits to the Trilithium Post-quantum Signature Protocol",[6465],{"author":6466},"Järv, P.",[],{"url":6469},"\u002Fuploads\u002FJarv_computer_science_2026_71fdb08b8b.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002F30c9723c-3133-4080-b8af-c3f7f4973d24",{"tag":10,"width":10,"height":10,"text":6472},"@mastersthesis{MSc:Järv26,\n  author  = {Pihla Järv},\n  title   = {{Adding Garbled Circuits to the Trilithium Post-quantum Signature Protocol}},\n  school  = {Institute of Computer Science, University of Tartu},\n  year    = {2026},\n  note    = {\\url{https:\u002F\u002Fthesis.cs.ut.ee\u002F30c9723c-3133-4080-b8af-c3f7f4973d24}}\n} ",{"title":6474,"type":14,"excerpt":6431,"year":5726,"authors":6475,"tags":6478,"pdfFile":6479,"pdfUrl":6481,"extendedUrl":10,"bibTeX":6482},"Large, Fast, Free? A Base Model for the Next Generation of Estonian Machine Translation",[6476],{"author":6477},"Peekman, K.",[],{"url":6480},"\u002Fuploads\u002FPeekman_computer_science_2026_8abf979999.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002F0d738d2a-ca25-4996-8138-aa5a32017039",{"tag":10,"width":10,"height":10,"text":6483},"@mastersthesis{MSc:Peekman26,\nauthor = {Kairit Peekman},\ntitle = {{Large, Fast, Free? A Base Model for the Next Generation of Estonian Machine Translation}},\nschool = {Institute of Computer Science, University of Tartu},\nyear = {2026},\nnote = {\\url{https:\u002F\u002Fthesis.cs.ut.ee\u002F0d738d2a-ca25-4996-8138-aa5a32017039}}\n}",{"title":6485,"type":14,"excerpt":6452,"year":5726,"authors":6486,"tags":6489,"pdfFile":6490,"pdfUrl":6492,"extendedUrl":10,"bibTeX":6493},"Toward the Practical Realization of Decentralized Proof-of-Location Systems",[6487],{"author":6488},"Tomson, T.",[],{"url":6491},"\u002Fuploads\u002FTamor_Tomson_Po_L_Thesis_342340d2dc.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002F4dce8ef1-667a-43d3-95a1-682783ecfef3",{"tag":10,"width":10,"height":10,"text":6494},"@bachelorthesis{BSc:Tomson26,\nauthor = {Tamor Thomson},\ntitle = {{Toward the Practical Realization of Decentralized Proof-of-Location Systems}},\nschool = {Institute of Computer Science, University of Tartu},\nyear = {2026},\nnote = {\\url{https:\u002F\u002Fthesis.cs.ut.ee\u002F4dce8ef1-667a-43d3-95a1-682783ecfef3}}\n}",{"title":6496,"type":14,"excerpt":6497,"year":5436,"authors":6498,"tags":6500,"pdfFile":6501,"pdfUrl":6503,"extendedUrl":10,"bibTeX":6504},"SynthGuard: Scalable and Privacy-Preserving Synthetic Data Generation Workflow Framework","BSc thesis. University of Tartu, 2025.",[6499],{"author":5690},[],{"url":6502},"\u002Fuploads\u002Ftamm_informaatika_2025_78c8cb64d1.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002Fa9e39a52-8933-4eff-afbc-113f0e2c8dc2",{"tag":10,"width":10,"height":10,"text":6505},"@bachelorthesis{BSc:Tamm25,\nauthor = {Kristian Tamm},\ntitle = {{SynthGuard: Scalable and Privacy-Preserving Synthetic Data Generation Workflow Framework}},\nschool = {Institute of Computer Science, University of Tartu},\nyear = {2025},\nnote = {\\url{https:\u002F\u002Fthesis.cs.ut.ee\u002Fa9e39a52-8933-4eff-afbc-113f0e2c8dc2}}\n}",{"title":6507,"type":14,"excerpt":6508,"year":5436,"authors":6509,"tags":6512,"pdfFile":6513,"pdfUrl":6515,"extendedUrl":10,"bibTeX":6516},"Privacy Preserving Data Pipelines using Zero-knowledge Proofs for Continuous SLA Monitoring","BSc thesis. Tallinn University of Technology, 2025.",[6510],{"author":6511},"Kutianskyi, Z.",[],{"url":6514},"\u002Fuploads\u002FZK_Thesis_a7b5cc22b2.pdf","https:\u002F\u002Fdigikogu.taltech.ee\u002Fen\u002FItem\u002F1744c82c-6077-49c0-98ab-8a8b87d8d7b5",{"tag":10,"width":10,"height":10,"text":6517},"@bachelorthesis{BSc:Kutianskyi25,\n  author  = {Zakhar Kutianskyi},\n  title   = {{Privacy Preserving Data Pipelines using Zero-knowledge Proofs for Continuous SLA Monitoring}},\n  school  = {School of Information Technologies, Tallinn University of Technology},\n  year    = {2025},\n  note    = {\\url{https:\u002F\u002Fdigikogu.taltech.ee\u002Fen\u002FItem\u002F1744c82c-6077-49c0-98ab-8a8b87d8d7b5}}\n} ",{"title":6519,"type":228,"excerpt":6520,"year":5726,"authors":6521,"tags":6525,"pdfFile":10,"pdfUrl":6526,"extendedUrl":10,"bibTeX":6527},"Private Quantised Neural Network Inference","In: Kieseberg, P., Skopik, F., Atli, B., Asplund, M. (eds) Availability, Reliability and Security. ARES 2026 EU Projects Symposium Workshops. ARES 2026. Lecture Notes in Computer Science, vol 16903. Springer, Cham. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-37218-5_27",[6522,6523,6524],{"author":1545},{"author":236},{"author":3985},[],"https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-032-37218-5_27",{"tag":10,"width":10,"height":10,"text":6528},"@InProceedings{10.1007\u002F978-3-032-37218-5_27,\nauthor=\"Eerikson, Hendrik\nand Laur, Sven\nand Pullonen-Raudvere, Pille\",\neditor=\"Kieseberg, Peter\nand Skopik, Florian\nand Atli, Buse\nand Asplund, Mikael\",\ntitle=\"Private Quantised Neural Network Inference\",\nbooktitle=\"Availability, Reliability and Security. ARES 2026 EU Projects Symposium Workshops\",\nyear=\"2027\",\npublisher=\"Springer Nature Switzerland\",\naddress=\"Cham\",\npages=\"456--474\",\nabstract=\"Neural networks based machine learning models are used in many classification problems yet privacy issues in model usage are mostly unresolved. When a model owner provides their model to other parties for inference, either the model owner has to share the parameters of the model or the model user must share their query and result with the model owner. Depending on the usage scenario, the user's query or query result could contain sensitive information that the model provider should not see. And on the other hand, the model parameters themselves could be a valuable business secret or leak private training data. In such cases, neural network inference must be performed in a privacy preserving manner, for example, using secure multi-party computation (MPC).\",\nisbn=\"978-3-032-37218-5\"\n}\n",{"title":6530,"type":14,"excerpt":1246,"year":178,"authors":6531,"tags":6533,"pdfFile":6534,"pdfUrl":6536,"extendedUrl":10,"bibTeX":6537},"Homological Classification of Commitment Schemes",[6532],{"author":234},[],{"url":6535},"\u002Fuploads\u002Fkamm_liina_72142a0eb2.pdf","https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F8b7fdacf-db87-4a07-ac3a-3f7cf195cf04\u002Fcontent",{"tag":10,"width":10,"height":10,"text":6538},"@mastersthesis{MSc:Kamm07,\nauthor = {Liina Kamm},\ntitle = {{Homological Classification of Commitment Schemes}},\nschool = {Institute of Computer Science, University of Tartu},\nyear = {2007},\nnote = {\\url{https:\u002F\u002Fdspace.ut.ee\u002Fserver\u002Fapi\u002Fcore\u002Fbitstreams\u002F8b7fdacf-db87-4a07-ac3a-3f7cf195cf04\u002Fcontent}}\n}",{"title":6540,"type":14,"excerpt":6541,"year":120,"authors":6542,"tags":6544,"pdfFile":6545,"pdfUrl":6547,"extendedUrl":10,"bibTeX":6548},"The Analysis and Design of a Privacy-Preserving Survey System.","Master's Thesis. University of Tartu. 2015.",[6543],{"author":2387},[],{"url":6546},"\u002Fuploads\u002FPrivacy_Preserving_Survey_System_Vaht_67370270d4.pdf","https:\u002F\u002Fthesis.cs.ut.ee\u002F1c6e17a6-4910-4070-b0c0-a0427f698dac",{"tag":6549,"width":770,"height":90,"text":6550},"Vaht15","@MASTERSTHESIS{MSc:Vaht15,\n  author = {Meril Vaht},\n  title = {{The Analysis and Design of a Privacy-Preserving Survey System}},\n  school = {Institute of Computer Science, University of Tartu},\n  year = {2015}\n}\n",1790088920430]