Publications

List of publications

Sort by: Date | Author | Title

Baum, C., Berlips, J., Chen, W., Cozzarini, H., Cui, H., Damgård, I., Dong, J., Esvelt, K. M., Foner, L., Gao, M., Gretton, D., Kysel, M., Li, J., Li, X., Paneth, O., Rivest, R. L., Sage-Ling, F., Shamir, A., Shen, Y. ... Zhang, K. (2026). A system capable of verifiably and privately screening global DNA synthesis. National Science Review, 13(14), Article nwag103. https://doi.org/10.1093/nsr/nwag103

Barcellos, M. & Aranha, D. F. (2019). Research in Security and Privacy in Brazil. IEEE Security & Privacy, 16(6), 14-21. Article 8636416. https://doi.org/10.1109/MSEC.2018.2874855

Barak, B., Canetti, R., Nielsen, J. B., Pass, R. & IEEE (Ed.) (2004). Universally Composable Protocols with Relaxed Set-Up Assumptions. In Ikke angivet (pp. 186-195). IEEE Press.

Barak, B., Canetti, R., Nielsen, J. B. & Pass, R. (2004). Universally composable protocols with relaxed set-up assumptions. In 45th Annual IEEE Symposium on Foundations of Computer Science, 2004. Proceedings. (pp. 186-195). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2004.71

Bang Mbiang, N., Aranha, D. F. & Fouotsa, E. (2020). Computing the optimal Ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. International Journal of Applied Cryptography, 4(1), 45-59. https://doi.org/10.1504/IJACT.2020.107167

Bai, G., Damgård, I., Orlandi, C. & Xia, Y. (2016). Non-Interactive Verifiable Secret Sharing for Monotone Circuits. In D. Pointcheval, A. Nitaj & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2016 - 8th International Conference on Cryptology in Africa, Proceedings (Vol. 9646, pp. 225-244). Springer VS. https://doi.org/10.1007/978-3-319-31517-1_12

Attema, T., Cascudo, I., Cramer, R., Damgård, I. & Escudero, D. (2022). Vector Commitments over Rings and Compressed Σ -Protocols. In E. Kiltz & V. Vaikuntanathan (Eds.), Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings (Vol. Part 1, pp. 173-202). Springer. https://doi.org/10.1007/978-3-031-22318-1_7

Ateniese, G., Dagdelen, Ö., Damgård, I. B. & Venturi, D. (2012). Entangled Cloud Storage. http://eprint.iacr.org/2012/511

Ateniese, G., Dagdelen, Ö., Damgård, I. B. & Venturi, D. (2015). Entangled Encodings and Data Entanglement. In SCC '15: Proceedings of the 3rd International Workshop on Security in Cloud Computing (pp. 3-12). Association for Computing Machinery. https://doi.org/10.1145/2732516.2732524

Ateniese, G., Dagdelen, Ö., Damgård, I. & Venturi, D. (2016). Entangled cloud storage. Future Generation Computer Systems - The International Journal of eScience, 62(9), 104-118. https://doi.org/10.1016/j.future.2016.01.008

Asharov, G. & Orlandi, C. (2012). Calling Out Cheaters : Covert Security with Public VerifiabilitySecurity. Lecture Notes in Computer Science, 7658, 681-698 . https://doi.org/10.1007/978-3-642-34961-4_41

Argo, S., Venema, M., Riepel, D., Güneysu, T. & Aranha, D. F. (2025). ABE Cubed: Advanced Benchmarking Extensions for ABE Squared. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2025(4), 544-587. https://doi.org/10.46586/tches.v2025.i4.544-587

Årdal, M. A., Aranha, D. F., Boudgoust, K., Kolby, S. & Takahashi, A. (2024). Aggregating Falcon Signatures with LaBRADOR. In L. Reyzin & D. Stebila (Eds.), Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings (pp. 71-106) https://doi.org/10.1007/978-3-031-68376-3_3

Årdal, M. A., Adj, G., Alblooshi, A., Aranha, D. F., A. Canales-Martínez, I., Chavez-Saab, J., Gazzoni Filho, D. L., Reijnders, K. & Rodriguez-Henriquez, F. (2025). Optimized One-Dimensional SQIsign Verification on Intel and Cortex-M4. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2025(1), 497-522. https://doi.org/10.46586/tches.v2025.i1.497-522

Årdal, M. A., Aranha, D. F., Feng, Y., Gao, Y. & Pan, Y. (2026). Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith’s Method. In J. Daemen & E. Thomé (Eds.), Advances in Cryptology – EUROCRYPT 2026 - 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 541-572) https://doi.org/10.1007/978-3-032-25327-9_19

Årdal, M. A., Basso, A., Feo, L. D., Patranabis, S. & Wesolowski, B. (2025). A Complete Security Proof of SQIsign. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 190-222) https://doi.org/10.1007/978-3-032-01887-8_7

Årdal, M. A., Basso, A. & Riepel, D. (2026). The Algebraic Isogeny Model: A General Model with Applications to SQIsign and Key Exchanges. In J. Daemen & E. Thomé (Eds.), Advances in Cryptology – EUROCRYPT 2026 - 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 604-635) https://doi.org/10.1007/978-3-032-25327-9_21

Aranha, D. F., Azarderakhsh, R. & Karabina, K. (2017). Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. In S. S. Ali, J.-L. Danger & T. Eisenbarth (Eds.), Security, Privacy, and Applied Cryptography Engineering - 7th International Conference, SPACE 2017, Proceedings: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 74-92). Springer. https://doi.org/10.1007/978-3-319-71501-8_5

Aranha, D. F., Ribeiro, H. & Ogando Paraense, A. L. (2016). Crowdsourced integrity verification of election results. Annals of Telecommunications, 71(7-8), 287-297. https://doi.org/10.1007/s12243-016-0511-1

Aranha, D. F., Dahab, R., Lopez, J. & Oliveira, L. B. (2010). Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 4(2), 169-187. https://doi.org/10.3934/amc.2010.4.169

Aranha, D. F., Fouque, P.-A., Gerard, B., Kammerer, J.-G., Tibouchi, M. & Zapalowicz, J.-C. (2014). GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias. In P. Sarkar & T. Iwata (Eds.), Advances in Cryptology – ASIACRYPT 2014 (pp. 262-281). Springer. https://doi.org/10.1007/978-3-662-45611-8_14

Aranha, D. F., Fouque, P.-A., Qian, C., Tibouchi, M. & Zapalowicz, J.-C. (2014). Binary Elligator Squared. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 Springer. https://doi.org/10.1007/978-3-319-13051-4_2

Aranha, D. F., Barreto, P. S. L. M., Longa, P. & Ricardini, J. E. (2014). The Realm of the Pairings. In T. Lange, K. Lauter & P. Lisonek (Eds.), Selected Areas in Cryptography -- SAC 2013 (pp. 3-25). Springer. https://doi.org/10.1007/978-3-662-43414-7_1

Aranha, D. F., Fuentes-Castañeda, L., Knapp, E., Menezes, A. & Rodriguez-Henriquez, F. (2013). Implementing Pairings at the 192-Bit Security Level. In M. Abdalla & T. Lange (Eds.), Pairing-Based Cryptography – Pairing 2012 (pp. 177-195). Springer. https://doi.org/10.1007/978-3-642-36334-4_11

Aranha, D. F., Faz-Hernandez, A., Lopez, J. & Rodriguez-henriquez, F. (2012). Faster Implementation of Scalar Multiplication on Koblitz Curves. In A. Hevia & G. Neven (Eds.), Progress in Cryptology – LATINCRYPT 2012 (pp. 177-193). Springer. https://doi.org/10.1007/978-3-642-33481-8_10

Aranha, D. F., Beuchat, J.-L., Detrey, J. & Estibals, N. (2012). Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves. In O. Dunkelman (Ed.), Topics in Cryptology – CT-RSA 2012 (pp. 98-115). Springer. https://doi.org/10.1007/978-3-642-27954-6_7

Aranha, D. F., Knapp, E., Menezes, A. & Rodriguez-henriquez, F. (2011). Parallelizing the Weil and Tate Pairings. In L. Chen (Ed.), Cryptography and Coding (pp. 275-295). Springer. https://doi.org/10.1007/978-3-642-25516-8_17

Aranha, D. F., Karabina, K., Longa, P., Gebotys, C. H. & Lopez, J. (2011). Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In K. G. Paterson (Ed.), Advances in Cryptology – EUROCRYPT 2011 (pp. 48-68). Springer. https://doi.org/10.1007/978-3-642-20465-4_5

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In M. Abdalla & P. S. L. M. Barreto (Eds.), Progress in Cryptology – LATINCRYPT 2010 (pp. 144-161). Springer. https://doi.org/10.1007/978-3-642-14712-8_9

Aranha, D. F., Lopez, J. & Hankerson, D. (2010). High-Speed Parallel Software Implementation of the ηT Pairing. In J. Pieprzyk (Ed.), Topics in Cryptology - CT-RSA 2010 (pp. 89-105). Springer. https://doi.org/10.1007/978-3-642-11925-5_7

Aranha, D. F. & van de Graaf, J. (2019). The Good, the Bad, and the Ugly: Two Decades of E-Voting in Brazil. IEEE Security & Privacy, 16(6), 22-30. Article 8636417. https://doi.org/10.1109/MSEC.2018.2875318

Aranha, D. F., J. Dominguez Perez, L., Mrabet, A. & Swchabe, P. (2016). Software Implementation. In N. El Mrabet & M. Joye (Eds.), Guide to Pairing-Based Cryptography Chapman & Hall/CRC.

Aranha, D. F. & Menezes, A. (2015). Progress in cryptology – LATINCRYPT 2014: Third International conference on cryptology and information security in Latin America Florianópolis, Brazil, september 17-19, 2014 revised selected papers. Springer Verlag. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 8895 https://doi.org/10.1007/978-3-319-16295-9

Aranha, D. F., Barbosa, P. Y. S., Cardoso, T. N. C., Araújo, C. L. & Matias, P. (2019). The return of software vulnerabilities in the Brazilian voting machine. Computers & Security, 86, 335-349. https://doi.org/10.1016/j.cose.2019.06.009

Aranha, D. F. & Pagnin, E. (2019). The simplest multi-key linearly homomorphic signature scheme. In P. Schwabe & N. Thériault (Eds.), Progress in Cryptology – LATINCRYPT 2019 (pp. 280-300). Springer. https://doi.org/10.1007/978-3-030-30530-7_14

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

Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M. & Yarom, Y. (2020). LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage. In CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 225-242). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417268

Aranha, D. F., Baum, C., Gjøsteen, K., Silde, T. & Tunge, T. (2021). Lattice-Based Proof of Shuffle and Applications to Electronic Voting. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 227-251). Springer. https://doi.org/10.1007/978-3-030-75539-3_10

Aranha, D. F., Berndt, S., Eisenbarth, T., Seker, O., Takahashi, A., Wilke, L. & Zaverucha, G. (2021). Side-Channel Protections for Picnic Signatures. Abstract from Third PQC Standardization Conference, Washington, United States.

Aranha, D. F., Berndt, S., Eisenbarth, T., Seker, O., Takahashi, A., Wilke, L. & Zaverucha, G. (2021). Side-Channel Protections for Picnic Signatures. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2021(4), 239-282. https://doi.org/10.46586/tches.v2021.i4.239-282

Aranha, D. F., Pagnin, E. & Rodriguez-Henriquez, F. (2021). LOVE a Pairing. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 320-340). Springer. https://doi.org/10.1007/978-3-030-88238-9_16

Aranha, D. F., Dalskov, A., Orlandi, C. & Escudero Ospina, D. E. (2021). Improved Threshold Signatures, Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 (pp. 382-404). Springer. https://doi.org/10.1007/978-3-030-88238-9_19

Aranha, D. F., Bennedsen, E., Campanelli, M., Ganesh, C., Orlandi, C. & Takahashi, A. (2022). ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022 : 25th IACR International Conference on Practice and Theory of Public-Key Cryptography (pp. 584-614). Springer. https://doi.org/10.1007/978-3-030-97121-2_21

Aranha, D. F., Hall-Andersen, M. N., Nitulescu, A., Pagnin, E. & Yakoubov, S. (2022). Count Me In! Extendability for Threshold Ring Signatures. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022 : 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings, Part II (pp. 379-406). Springer. https://doi.org/10.1007/978-3-030-97131-1_13

Aranha, D. F., Engelmann, F. T., Kolby, S. & Yakoubov, S. (2022). The State of the Union: Union-Only Signatures for Data Aggregation. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 387-410). Springer. https://doi.org/10.1007/978-3-031-14791-3_17

Aranha, D. F., Lin, C., Orlandi, C. & Simkin, M. (2022). Laconic Private Set-Intersection From Pairings. In CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 111-124). Association for Computing Machinery. https://doi.org/10.1145/3548606.3560642

Aranha, D. F., El Housni, Y. & Guillevic, A. (2023). A survey of elliptic curves for proof systems. Designs, Codes and Cryptography, 91(11), 3333–3378. https://doi.org/10.1007/s10623-022-01135-y

Aranha, D. F., Baum, C., Gjøsteen, K. & Silde, T. (2023). Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 1467-1481). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616683

Aranha, D. F., Hvass, B. S., Spitters, B. & Tibouchi, M. (2023). Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3228-3238). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616597

Aranha, D. F., Battagliola, M. & Roy, L. D. (2024). Faster coercion-resistant e-voting by encrypted sorting. In E-Vote-ID 2023 (pp. 53-70). Gesellschaft fur Informatik (GI). https://doi.org/10.18420/e-vote-id2023_03

Displaying results 551 to 600 out of 649

Revised 04.08.2026

Marianne Dammand Iversen