Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

Sortér efter: Dato | Forfatter | Titel

Neerbek, J. (2020). Sensitive Information Detection: Recursive Neural Networks for Encoding Context. Århus Universitet.

Miltersen, P. B. & Sheffet, O. (2012). Send mixed signals : earn more, work less. I B. Faltings, K. Leyton-Brown & P. Ipeirotis (red.), EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce (s. 234-247). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229033

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Feldthaus, A. & Møller, A. (2013). Semi-Automatic Rename Refactoring for JavaScript. ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages and Applications, 323-338 . https://doi.org/10.1145/2509136.2509520

Chan, T. M., Cheng, P. & Zheng, D. W. (2024). Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. I W. Mulzer & J. M. Phillips (red.), 40th International Symposium on Computational Geometry, SoCG 2024 Artikel 33 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2024.33

Miltersen, P. B. (2014). Semi-algebraic geometry in computational game theory - A consumer's perspective: Invited Talk. I E. W. Mayr & N. Portier (red.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (s. 11-12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Frederiksen, S. K. S. (2015). Semi-algebraic Geometry for Stochastic Games. Department of Computer Science, Aarhus University.

Banerjee, A., Danvy, O., Doh, K.-G. & Hatcliff , J. (red.) (2013). Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday : Festschrift for Dave Schmidt, Manhattan, Kansas, USA, 19-20th September 2013. http://published.eptcs.org/. Electronic Proceedings in Theoretical Computer Science Bind 129 https://doi.org/10.4204/EPTCS.129

Nielsen, B. B., Torp, M. T. & Møller, A. (2021). Semantic Patches for Adaptation of JavaScript Programs to Evolving Libraries. I Proceedings - 2021 IEEE/ACM 43rd International Conference on Software Engineering, ICSE 2021 (s. 74-85). IEEE. https://doi.org/10.1109/ICSE43902.2021.00020

Tomlein, M. & Grønbæk, K. (2016). Semantic Model of Variability and Capabilities of IoT Applications for Embedded Software Ecosystems. I Proceedings - 2016 13th Working IEEE/IFIP Conference on Software Architecture, WICSA 2016 (s. 247-252). Artikel 7516835 IEEE Press. https://doi.org/10.1109/WICSA.2016.17

Chen, P. P., Wang, Z. Y., Yu, S. W., Hong, J. M., Poulsen, P. R., Ji, Y. L., Miao, B. Y., Han, M. & Wang, G. H. (1998). Self-organization of Te clusters in nanofilm by low energy beam deposition. Physics Letters, Section A: General, Atomic and Solid State Physics, 244(5), 407-412. https://doi.org/10.1016/S0375-9601(98)00346-6

Nunes, F., Verdezoto, N., Fitzpatrick, G., Kyng, M., Grönvall, E. & Storni, C. (2015). Self-Care Technologies in HCI: Trends, Tensions, and Opportunities. A C M Transactions on Computer - Human Interaction, 22(6), Artikel 33. https://doi.org/10.1145/2803173

Neerbek, J., Dolog, P. & Assent, I. (2019). Selective Training: A Strategy for Fast Backpropagation on Sentence Embeddings. I Q. Yang, M.-L. Zhang, Z. Gong, S.-J. Huang & Z.-H. Zhou (red.), Advances in Knowledge Discovery and Data Mining - 23rd Pacific-Asia Conference, PAKDD 2019, Proceedings: PAKDD '19 (s. 40-53). Springer. https://doi.org/10.1007/978-3-030-16142-2_4

Mic, V., Novak, D., Vadicamo, L. & Zezula, P. (2018). Selecting Sketches for Similarity Search. I A. Benczur, T. Horvath & B. Thalheim (red.), Advances in Databases and Information Systems - 22nd European Conference, ADBIS 2018, Proceedings (s. 127-141). Springer Verlag. https://doi.org/10.1007/978-3-319-98398-1_9

Khurana, A., Logins, A. & Karras, P. (2020). Selecting Influential Features by a Learnable Content-Aware Linear Threshold Model. I CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management (s. 635-644). Association for Computing Machinery. https://doi.org/10.1145/3340531.3411886

Kölker, J. (2012). Selected Slither Link Variants are NP-complete. Journal of Information Processing, 20(3), 709-712 . https://doi.org/10.2197/ipsjjip.20.709

Aronov, B., Driemel, A., Van Kreveld, M., Löffler, M. & Staals, F. (2015). Segmentation of trajectories on nonmonotone criteria. A C M Transactions on Algorithms, 12(2), Artikel 26. https://doi.org/10.1145/2660772

Abram, D., Waters, B. & Zhandry, M. (2023). Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles. I H. Handschuh & A. Lysyanskaya (red.), Advances in Cryptology: CRYPTO 2023, Proceedings (Bind Part I, s. 489-514). Springer. https://doi.org/10.1007/978-3-031-38557-5_16

Farshim, P., Orlandi, C. & Rosie, R. (2017). Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Trans. Symmetric Cryptol., 2017(1), 449-473. https://doi.org/10.13154/tosc.v2017.i1.449-473

Giacomelli, I., Olimid, R. & Ranellucci, S. (2015). Security of Linear Secret-Sharing Schemes Against Mass Surveillance. I M. Reiter & D. Naccache (red.), Cryptology and Network Security : 14th International Conference, CANS 2015, Marrakesh, Morocco, December 10-12, 2015, Proceedings (Bind 9476, s. 43-58). Springer. https://doi.org/10.1007/978-3-319-26823-1

Aranha, D. F., Orlandi, C., Takahashi, A. & Zaverucha, G. (2020). Security of Hedged Fiat–Shamir Signatures under Fault Attacks. I A. Canteaut & Y. Ishai (red.), Advances in Cryptology – EUROCRYPT 2020 (s. 644-674). Springer. https://doi.org/10.1007/978-3-030-45721-1_23

Nelson, B. & Olovsson, T. (2016). Security and privacy for big data: A systematic literature review. I R. Ak, G. Karypis, Y. Xia, X. T. Hu, P. S. Yu, J. Joshi, L. Ungar, L. Liu, A.-H. Sato, T. Suzumura, S. Rachuri, R. Govindaraju & W. Xu (red.), Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 (s. 3693-3702). Artikel 7841037 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigData.2016.7841037

Kingo Mogensen, T. & Aranha, D. F. (2022). Security analysis of the passwordless MitID digital identity system. Abstract fra 27th Nordic Conference on Secure IT Systems (NordSec 2022), Reykjavik, Island.

Dalskov, A. P. K., Orlandi, C., Keller, M., Shrishak, K. & Shulman, H. (2020). Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. I L. Chen, S. Schneider, N. Li & K. Liang (red.), European Symposium on Research in Computer Security : Computer Security – ESORICS 2020 (Bind I, s. 654-673). Springer. https://doi.org/10.1007/978-3-030-59013-0_32

Damgård, I. B., Faust, S. & Hazay, C. (2011). Secure Two-Party Computation with Low Communication. http://eprint.iacr.org/2011/508

Damgård, I. B., Kölker, J., Faust, S. & Hazay, C. (2012). Secure Two-Party Computation with Low Communication. Lecture Notes in Computer Science, 7194, 54-74 . https://doi.org/10.1007/978-3-642-28914-9_4

Keller, H., Möllering, H., Schneider, T., Tkachenko, O. & Zhao, L. (2024). Secure Noise Sampling for DP in MPC with Finite Precision. I ARES '24: Proceedings of the 19th International Conference on Availability, Reliability and Security Artikel 25 Association for Computing Machinery. https://doi.org/10.1145/3664476.3664490

Goel, A., Hall-Andersen, M., Hegde, A. & Jain, A. (2022). Secure Multiparty Computation with Free Branching. I O. Dunkelman & S. Dziembowski (red.), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (s. 397-426). Springer. https://doi.org/10.1007/978-3-031-06944-4_14

Braun, L., Damgård, I. B. & Orlandi, C. (2023). Secure Multiparty Computation from Threshold Encryption Based on Class Groups. I H. Handschuh & A. Lysyanskaya (red.), Advances in Cryptology: CRYPTO 2023 (s. 613-645). Springer. https://doi.org/10.1007/978-3-031-38557-5_20

Cramer, R., Damgård, I. B. & Nielsen, J. B. (2015). Secure Multiparty Computation and Secret Sharing. Cambridge University Press.

Choudhury, A., Patra, A., Ashwinkumar, B. V., Srinathan, K. & Pandu Rangan, C. (2011). Secure message transmission in asynchronous networks. Journal of Parallel and Distributed Computing, 71(8), 1067-1074. https://doi.org/10.1016/j.jpdc.2011.03.004

Damgård, I. B., Jakobsen, T. P., Nielsen, J. B. & Pagter, J. I. (2013). Secure Key Management in the Cloud. I M. Stam (red.), Cryptography and Coding: 14th IMA International Conference, IMACC 2013, Oxford, UK, December 17-19, 2013. Proceedings (s. 270-289 ). Springer VS. https://doi.org/10.1007/978-3-642-45239-0_16

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Lucani Rötter, D. E., Nielsen, L., Orlandi, C., Pagnin, E. & Vestergaard, R. (2020). Secure generalized deduplication via multi-key revealing encryption. I C. Galdi & V. Kolesnikov (red.), Security and Cryptography for Networks (s. 298-318). Springer. https://doi.org/10.1007/978-3-030-57990-6_15

Dalskov, A. P. K., Escudero Ospina, D. E. & Keller, M. (2020). Secure Evaluation of Quantized Neural Networks. Proceedings on Privacy Enhancing Technologies, 2020(4), 355-375. https://doi.org/10.2478/popets-2020-0077

Lipmaa, H. & Toft, T. (2013). Secure equality and greater-than tests with sublinear online complexity. I F. V. Fomin , R. Freivalds, M. Kwiatkowska & D. Peleg (red.), Automata, Languages, and Programming: Proceedings, 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Part II (s. 645-656). Springer Publishing Company. https://doi.org/10.1007/978-3-642-39212-2_56

Toft, T. (2011). Secure data structures based on multi-party computation. I Proceedings of the 30th Annual ACM SIGACT-SIGOPS ACM Symposium on Principles of Distributed Computing, PODC 2011 (s. 291-292). Association for Computing Machinery. https://doi.org/10.1145/1993806.1993859

Damgård, I. B., Kölker, J. & Toft, T. (2012). Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. Lecture Notes in Computer Science, 7178, 278-295 . https://doi.org/10.1007/978-3-642-27954-6_18

Zakarias, S. N. H. (2014). Secure Computation in the Preprocessing Model. Department of Computer Science, Aarhus University.

Ghosh, S. (2019). Secure Computation Based On Oblivious Linear Function Evaluation. Århus Universitet.

Damgård, I., Ravi, D., Tschudi, D. & Yakoubov, S. (2023). Secure Communication in Dynamic Incomplete Networks. I K.-M. Chung (red.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (s. 13:1--13:21). Artikel 13 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.13

Applebaum, B., Damgård, I., Ishai, Y., Nielsen, M. & Zichron, L. (2017). Secure Arithmetic Computation with Constant Computational Overhead. I H. Shacham & J. Katz (red.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Bind 10401, s. 223-254). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_8

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. I C. Galdi & V. Kolesnikov (red.), Security and Cryptography for Networks (s. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Nielsen, M., Elmqvist, N. & Grønbæk, K. (2016). Scribble query: fluid touch brushing for multivariate data visualization. I Proceedings of the 28th Australian Computer-Human Interaction Conference, OzCHI 2016 (s. 381-390). Association for Computing Machinery. https://doi.org/10.1145/3010915.3010951

Schnell, I. B., Thomsen, P. F., Wilkinson, N., Rasmussen, M., Jensen, L. R. D., Willerslev, E., Bertelsen, M. F. & Gilbert, M. T. P. (2012). Screening mammal biodiversity using DNA from leeches. Current Biology, 22(8), R262-R263. https://doi.org/10.1016/j.cub.2012.02.058

Rasmussen, T. A., Stensgaard, A., Winding, T. & Merritt, T. R. (2021). scrAPP: Enabling Reuse of Scrap Materials with a Smartphone. I Extended Abstracts of MobileHCI 2021 - ACM International Conference on Mobile Human-Computer Interaction: Mobile Apart, Mobile Together (s. 1-6). Artikel 10 Association for Computing Machinery. https://doi.org/10.1145/3447527.3474856

Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (s. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24

Berger, C. P., Lutze, M. C. D., Elmqvist, N., Madsen, M. & Klokmose, C. N. (2024). Scientists and Code: Programming as a Tool. Afhandling præsenteret på PLATEAU, Berkeley, California, USA. https://kilthub.cmu.edu/articles/conference_contribution/Scientists_and_Code_Programming_as_a_Tool/25587726?backTo=/collections/PLATEAU_2024/7093870

Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A. & Srinivasan, S. (2023). Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Computational Complexity, 32(1), Artikel 3. https://doi.org/10.1007/s00037-023-00236-x

Viser resultater 651 til 700 ud af 2825

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series