Ganesh, C.
, Orlandi, C., Tschudi, D. & Zohar, A. (2022).
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. In J. Garcia-Alfaro, J. L. Muñoz-Tapia, G. Navarro-Arribas & M. Soriano (Eds.),
Data Privacy Management, Cryptocurrencies and Blockchain Technology : ESORICS 2021 International Workshops, DPM 2021 and CBT 2021 (pp. 173-191). Springer.
https://doi.org/10.1007/978-3-030-93944-1_12
Ganesh, C.
, Kondi, Y. M., Orlandi, C., Pancholi, M. R., Takahashi, A. & Tschudi, D. (2023).
Witness-Succinct Universally-Composable SNARKs. In C. Hazay & M. Stam (Eds.),
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 II (pp. 315–346). Springer.
https://doi.org/10.1007/978-3-031-30617-4_11
Ganardi, M., Majumdar, R.
, Pavlogiannis, A., Schütze, L. & Zetzsche, G. (2022).
Reachability in Bidirected Pushdown VASS. In M. Bojanczyk, E. Merelli & D. P. Woodruff (Eds.),
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Article 124 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.ICALP.2022.124
Gambs, S.
, Ranellucci, S. & Tapp, A. (2015).
The crypto-democracy and the trustworthy (position paper). In
Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance: 9th International Workshop, DPM 2014, 7th International Workshop, SETOP 2014, and 3rd International Workshop, QASA 2014, Wroclaw, Poland, September 10-11, 2014. Revised Selected Papers (Vol. 8872, pp. 58-76). Springer VS.
https://doi.org/10.1007/978-3-319-17016-9_5
Gal, A.
& Miltersen, P. B. (2003).
The Cell Probe Complexity of Succinct Data Structures. In J. C. M. Baeten, J. K. Lenstra, J. Parrow & G. J. Wöeginger (Eds.),
Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings (pp. 442-453). Springer.
https://doi.org/10.1007/3-540-45061-0_28
Gal, A.
, Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E. (2013).
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
I E E E Transactions on Information Theory,
59(10), 6611-6627.
https://doi.org/10.1109/TIT.2013.2270275
Fuchsberger, V., Murer, M., Tscheligi, M., Lindtner, S., Reiter, A.
, Bardzell, S., Bardzell, J. & Bjørn, P. (2015).
The Future of Making: Where Industrial and Personal Fabrication Meet.
Aarhus Series on Human Centered Computing,
1(1).
http://ojs.statsbiblioteket.dk/index.php/ashcc/article/view/21394/18857
Fuchsbauer, G., Gay, R., Kowalczyk, L.
& Orlandi, C. (2017).
Access Control Encryption for Equality, Comparison, and More. In S. Fehr (Ed.),
Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (Vol. 10175, pp. 88-118). Springer VS.
https://doi.org/10.1007/978-3-662-54388-7_4
Frølunde, A. S., Ohlenbusch, M. E., Berg-Hansen, K., Jessen, N., Kim, S. & Boedtkjer, E. (2018).
Murine breast cancer feed arteries are thin-walled with reduced α1A-adrenoceptor expression and attenuated sympathetic vasocontraction.
Breast Cancer Research,
20(1), Article 20.
https://doi.org/10.1186/s13058-018-0952-8
Fritsch, J., Iversen, O. S., Dindler, C., Nielsen, C. & Nørregaard, P. (2003).
NetWorking News: A Method for Engaging Children Actively in Design. Paper presented at IRIS, Haikko Manor, Porvoo, Finland.
Fritchman, K., Saminathan, K.
, Dowsley, R., Hughes, T., De Cock, M., Nascimento, A. & Teredesai, A. (2019).
Privacy-Preserving Scoring of Tree Ensembles: A Novel Framework for AI in Healthcare. In Y. Song, B. Liu, K. Lee, N. Abe, C. Pu, M. Qiao, N. Ahmed, D. Kossmann, J. Saltz, J. Tang, J. He, H. Liu & X. Hu (Eds.),
Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018 (pp. 2413-2422). Article 8622627 IEEE.
https://doi.org/10.1109/BigData.2018.8622627
Frederiksen, S. K. S. & Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. In L. Cai, S.-W. Cheng & T.-W. Lam (Eds.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 457-467 ). Springer VS.
https://doi.org/10.1007/978-3-642-45030-3_43
Frederiksen, T. K., Jakobsen, T. P. & Nielsen, J. B. (2014).
Faster Maliciously Secure Two-Party Computation Using the GPU. In M. Abdalla & R. D. Prisco (Eds.),
Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 358-379 ). Springer.
https://doi.org/10.1007/978-3-319-10879-7_21
Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2015).
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. In E. Oswald & M. Fischlin (Eds.),
Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (pp. 191-219). Springer VS.
https://doi.org/10.1007/978-3-662-46803-6_7