Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2013).
MiniLEGO: Efficient secure two-party computation from general assumptions. I T. Johansson & P. Q. Nguyen (red.),
Advances in Cryptology – EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (s. 537-556). Springer VS.
https://doi.org/10.1007/978-3-642-38348-9_32
Frandsen, J., Hobolth, A., Østergaard, L., Vestergaard-Poulsen, P. & Vedel, E. B. (2006).
Regularization of Diffusion Tensor Fields in Axonal Fibre Tracking. Poster session præsenteret på PhD Day 2006, The Faculty of Health Sciences, Aarhus, Danmark.
Frandsen, G. S., Husfeldt, T.
, Miltersen, P. B., Rauhe, T. & Skyum, S. (1995).
Dynamic algorithms for the Dyck languages. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.),
Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 98-108). Springer.
https://doi.org/10.1007/3-540-60220-8_54
Francati, D., Friolo, D., Malavolta, G.
& Venturi, D. (2023).
Multi-key and Multi-input Predicate Encryption from Learning with Errors. I C. Hazay & M. Stam (red.),
Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III (s. 573-604). Springer.
https://doi.org/10.1007/978-3-031-30620-4_19
Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A.
& Venturi, D. (2023).
Registered (Inner-Product) Functional Encryption. I J. Guo & R. Steinfeld (red.),
Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part V (s. 98-133). Springer.
https://doi.org/10.1007/978-981-99-8733-7_4
Francati, D. & Venturi, D. (2024).
Non-malleable Fuzzy Extractors. I C. Pöpper & L. Batina (red.),
Applied Cryptography and Network Security: 22nd International Conference, ACNS 2024, Abu Dhabi, United Arab Emirates, March 5–8, 2024, Proceedings, Part I (s. 135-155). Springer.
https://doi.org/10.1007/978-3-031-54770-6_6
Fournier, H., Limaye, N., Malod, G.
, Srinivasan, S. & Tavenas, S. (2023).
Towards Optimal Depth-Reductions for Algebraic Formulas. I A. Ta-Shma (red.),
38th Computational Complexity Conference, CCC 2023 Artikel 28 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.CCC.2023.28
Fortune, S., Hopcroft, J.
& Schmidt, E. M. (1978).
The complexity of equivalence and containment for free single variable program schemes. I G. Ausiello & C. Böhm (red.),
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17–21, 1978 (s. 227-240). Springer.
https://doi.org/10.1007/3-540-08860-1_17
Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D.
& Simkin, M. (2018).
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Information Security,
12(3), 166-183.
https://doi.org/10.1049/iet-ifs.2017.0041
Fleischhacker, N.
, Larsen, K. G. & Simkin, M. (2023).
How to Compress Encrypted Data. I C. Hazay & M. Stam (red.),
Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I (s. 551-577). Springer.
https://doi.org/10.1007/978-3-031-30545-0_19
Fitzi, M., Garay, J. A., Gollakota, S., Rangan, C. P. & Srinathan, K. (2006).
Round-optimal and Efficient Verifiable Secret Sharing. I S. Halevi & T. Rabin (red.),
Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006 Proceedings (s. 329-342). Springer.
https://doi.org/10.1007/11681878_17