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., Nielsen, J. B., Fitzi, M. & Desmedt, Y. (2007).
Secure Protocols with Asymmetric Trust. I
Advances in Cryptology - ASIACRYPT 2007: 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings (s. 357-375). Springer.
https://doi.org/10.1007/978-3-540-76900-2_22
Bøgetoft, P., Lund Christensen, D.
, Damgård, I. B., Geisler, M., Jacobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K.
, Pagter, J. I., Schwartzbach, M. I., Toft, T. & Nielsen, K. (2009).
Secure Multiparty Computation Goes Live.
Lecture Notes in Computer Science,
5628, 325-343.
https://doi.org/10.1007/978-3-642-03549-4_20
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., Salvail, L., Schaffner, C. & Fehr, S. (2007).
Secure Identification and QKD in the Bounded-Quantum-Storage Model. I A. Menezes (red.),
Advances in Cryptology - CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings (s. 342-359). Springer.
https://doi.org/10.1007/978-3-540-74143-5_19
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
Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005).
Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications.
B R I C S Report Series, (RS-05-18), 1-35.
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
Arge, L., Rav, M., Revsbæk, M.
, Shin, Y. & Yang, J. (2020).
Sea-rise flooding on massive dynamic terrains. I S. Albers (red.),
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020 (s. 6:1-6:19). Schloss Dagstuhl--Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SWAT.2020.6
Barrington, D. A. M., Lu, C.-J.
, Miltersen, P. B. & Skyum, S. (1998).
Searching constant width mazes captures the AC0 hierarchy. I M. Morvan, C. Meinel & D. Krob (red.),
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25-27, 1998 Proceedings (s. 73-83). Springer.
https://doi.org/10.1007/BFb0028550
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
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
Bødker, S. & Christiansen, E. (1997).
Scenarios as springboards in design. I G. Bowker, S. L. Star, L. Gasser & W. Turner (red.),
Social Science Research, Technical Systems and Cooperative Work (s. 217-234). Lawrence Erlbaum Associates.