Publications

List of publications

Sort by: Date | Author | Title

Mikkelsen, G. L. (2011). On the Protection of Digital Identities Through Threshold Cryptography. Department of Computer Science, Aarhus University.

Mikkelsen, G. L., Keller, M. & Rupp, A. (2012). Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols. Lecture Notes in Computer Science, 7412, 147-166 . https://doi.org/10.1007/978-3-642-32284-6_9

melo, A. C. M. A., Silva, N. S. B., Mendes, H. C. & Aranha, D. F. (2006). Obtaining possible execution histories on multiple memory consistency models. In XXV International Conference of the Chilean Computer Science Society (SCCC'05) IEEE. https://doi.org/10.1109/SCCC.2005.1587870

Meldgaard, S. T. (2013). Unconditionally Secure Protocols. Institut for Datalogi, Aarhus Universitet.

Meiklejohn, S. & Orlandi, C. (2015). Privacy-enhancing overlays in bitcoin. In M. Brenner , N. Christin , B. Johnson & K. Rohloff (Eds.), Financial Cryptography and Data Security : FC 2015 International Workshops, BITCOIN, WAHC, and Wearable, San Juan, Puerto Rico, January 30, 2015, Revised Selected Papers (Vol. 8976, pp. 127-141). Springer. https://doi.org/10.1007/978-3-662-48051-9_10

Matt, C., Nielsen, J. B. & Thomsen, S. E. (2022). Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. In Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings: 42nd Annual International Cryptology Conference, CRYPTO 2022, Procerdings (pp. 400-430). Springer, Cham. https://doi.org/10.1007/978-3-031-15979-4_14

Matias, P., Y. S. Barbosa, P., N. C. Cardoso, T., Mariano, D. & Aranha, D. F. (2018). NIZKCTF: A Non-Interactive Zero-Knowledge Capture the Flag Platform. IEEE Security & Privacy, 16(6), 42-51. Article 8636460. https://doi.org/10.1109/MSEC.2018.2875324

Marcedone , A. & Orlandi, C. (2014). Obfuscation ⇒ (IND-CPA Security ⇏ Circular Security). 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. 77-90). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_5

Maitin-Shepard, J., Tibouchi, M. & Aranha, D. F. (2016). Elliptic Curve Multiset Hash. The Computer Journal, 60(4), 476-490. https://doi.org/10.1093/comjnl/bxw053

Maia Neto, A. L., Souza, A. L. F., Cunha, I., Nogueira, M., Oliveira Nunes, I., Cotta, L., Gentille, N., Loureido, A. A. F., Aranha, D. F., Kupwade Patil, H. & Oliveira, L. B. (2016). AoT: Authentication and Access Control for the Entire IoT Device Life-Cycle. In Proceedings of the 14th ACM Conference on Embedded Networked Sensor Systems, SenSys 2016 (pp. 1-15). ACM. https://doi.org/10.1145/2994551.2994555

Lunemann, C. & Nielsen, J. B. (2011). Fully simulatable quantum-secure coin-flipping and applications. Lecture Notes in Computer Science, 6737, 21-40. https://doi.org/10.1007/978-3-642-21969-6_2

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

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

Lindell, Y., Nissim, K. & Orlandi, C. (2013). Hiding the Input-Size in Secure Two-Party Computation. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (Vol. 8197, pp. 421-440). Springer VS. https://doi.org/10.1007/978-3-642-41019-2_6

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_18

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

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Kulik, T., Boudjadar, J. & Aranha, D. F. (2020). Towards Formally Verified Key Management for Industrial Control Systems. 119-129. Paper presented at 8th International Conference on Formal Methods in Software Engineering, Seoul, Korea, Republic of. https://doi.org/10.1145/3372020.3391555

Kulik, T., Boudjadar, J. & Aranha, D. F. (2021). Formally Verified Credentials Management for Industrial Control Systems. In Proceedings - 2021 IEEE/ACM 9th International Conference on Formal Methods in Software Engineering, FormaliSE 2021: 9th IEEE/ACM International Conference on Formal Methods in Software Engineering (pp. 75-85). IEEE. https://doi.org/10.1109/FormaliSE52586.2021.00014

Koti, N., Suresh, A., Rachuri, S. R. & Patra, A. (2022). Tetrad: Actively Secure 4PC for Secure Training and Inference. Paper presented at Network and Distributed Systems Security (NDSS) Symposium 2022, San Diego ,Calif., United States. https://doi.org/10.14722/ndss.2022.24058

Kondi, Y., Magri, B., Orlandi, C. & Shlomovits, O. (2021). Refresh when you wake up: Proactive threshold wallets with offline devices. In 2021 IEEE Symposium on Security and Privacy (SP) (pp. 608-625). IEEE. https://doi.org/10.1109/SP40001.2021.00067

Kolesnikov, V., Nielsen, J. B., Rosulek, M., Trieu, N. & Trifiletti, R. (2017). DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 3-20). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133991

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

Kingo, T. & Aranha, D. F. (2023). User-centric security analysis of MitID: the Danish passwordless digital identity solution. Computers & Security, 132, Article 103376. https://doi.org/10.1016/j.cose.2023.103376

Khoshakhlagh, H. (2022). Cryptography for Scalability and Identity in Blockchain Applications. Aarhus Universitet.

Khoshakhlagh, H. (2022). (Commit-and-Prove) Predictable Arguments with Privacy. In G. Ateniese & D. Venturi (Eds.), Applied Cryptography and Network Security: 20th International Conference, ACNS 2022, Proceedings (pp. 542-561). Springer. https://doi.org/10.1007/978-3-031-09234-3_27

Keller, M. (2012). Theory and practice of cryptographic protocols -or- cryptography: will it blend? Department of Computer Science, Aarhus University.

Keller, H., Orlandi, C., Paskin-Cherniavsky, A. & Ravi, D. (2023). MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In K-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 (pp. 11:1-11:22). Article 11 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.11

Kamp, S. H., Magri, B., Matt, C., Nielsen, J. B., Thomsen, S. E. & Tschudi, D. (2021). Weight-Based Nakamoto-Style Blockchains. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America Bogotá, Colombia, October 6–8, 2021, Proceedings (pp. 299-319). Springer International Publishing. https://doi.org/10.1007/978-3-030-88238-9_15

Junio da Cruz, R., Guimaraes, A. & Aranha, D. F. (2020). Efficient and secure software implementations of Fantomas. Journal of Cryptographic Engineering, 10(3), 211–228. https://doi.org/10.1007/s13389-019-00218-2

Jensen, C. (Ed.), Lind Olsen, E. (Ed.), Mikkelsen, G. L., Syberg , L., Nielsen, L. L., Hansen, M. A. E., Hjortlund, M., Madsen, O. L., Høngaard Andersen, P. & Duvold, T. (2018). The future market for cybersecurity in Denmark.

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. In A-R. Sadeghi , V. Gligor & M. Yung (Eds.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (pp. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. In G-J. Ahn , A. Oprea & R. Safavi-Naini (Eds.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (pp. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://arxiv.org/pdf/1502.05273v1

Jakobsen, S. K. & Orlandi, C. (2015). How to Bootstrap Anonymous Communication. http://eprint.iacr.org/2015/130

Jakobsen, J. & Orlandi, C. (2015). On the CCA (in)security of MTProto. http://eprint.iacr.org/2015/1177

Jakobsen, J. & Orlandi, C. (2016). On the CCA (in)security of MTProto. In Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices: SPSM '16 (pp. 113-116). Association for Computing Machinery. https://doi.org/10.1145/2994459.2994468

Jakobsen, S. K. & Orlandi, C. (2016). How To Bootstrap Anonymous Communication. In ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (pp. 333-344). Association for Computing Machinery. https://doi.org/10.1145/2840728.2840743

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2016). A Framework for Outsourcing of Secure Computation. http://eprint.iacr.org/2016/037

Jafargholi, Z. & Oechsner, S. (2020). Adaptive Security of Practical Garbling Schemes. In K. Bhargavan, E. Oswald & M. Prabhakaran (Eds.), Progress in Cryptology – INDOCRYPT 2020 - 21st International Conference on Cryptology in India 2020, Proceedings: INDOCRYPT 2020 (pp. 741-762). Springer VS. https://doi.org/10.1007/978-3-030-65277-7_33

Jafargholi, Z., Larsen, K. G. & Simkin, M. (2021). Optimal oblivious priority queues. In D. Marx (Ed.), ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (pp. 2366-2383). Association for Computing Machinery.

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Ishai, Y., Kumarasubramanian, A., Orlandi, C. & Sahai, A. (2011). On Invertible Sampling and Adaptive Security. Lecture Notes in Computer Science, 6477, 466-482. https://doi.org/10.1007/978-3-642-17373-8_27

Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34

Ishai, Y., Patra, A., Patranabis, S., Ravi, D. & Srinivasan, A. (2022). Fully-Secure MPC with Minimal Trust. In Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings (pp. 470–501). Springer. https://doi.org/10.1007/978-3-031-22365-5_17

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2023). High-assurance field inversion for curve-based cryptography. In 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (pp. 111-126). IEEE. https://doi.org/10.1109/CSF57540.2023.00008

Hvass, B. S. (2023). Foundational Verification of Cryptographic Primitives. Aarhus Universitet.

Displaying results 101 to 150 out of 617

Revised 02.06.2023

Marianne Dammand Iversen