Publications

List of publications

Sort by: Date | Author | Title

Baum, C., David, B., Dowsley, R., Nielsen, J. B. & Oechsner, S. (2021). TARDIS: A Foundation of Time-Lock Puzzles in UC. In Advances in Cryptology – EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 429-459|). Springer. https://doi.org/10.1007/978-3-030-77883-5_15

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2022). Efficient protocols for oblivious linear function evaluation from ring-LWE. Journal of Computer Security, 30(1), 39-78. https://doi.org/10.3233/JCS-200116

Baum, C., Braun, L., Munch-Hansen, A. & Scholl, P. (2022). MozZ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z2k. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 329-358). Springer. https://doi.org/10.1007/978-3-031-15985-5_12

Baum, C., Jadoul, R., Orsini, E., Scholl, P. & Smart, N. P. (2022). Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. In CCS'22 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 293-306). Association for Computing Machinery. https://doi.org/10.1145/3548606.3559354

Baum, C., David, B. & Dowsley, R. (2022). (Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. In C. Ge & F. Guo (Eds.), Provable and Practical Security - 16th International Conference, ProvSec 2022, Proceedings (pp. 249-272). Springer. https://doi.org/10.1007/978-3-031-20917-8_17

Baum, C., Dittmer, S., Scholl, P. & Wang, X. (2023). Sok: vector OLE-based zero-knowledge protocols. Designs, Codes, and Cryptography, 91(11), 3527-3561. https://doi.org/10.1007/s10623-023-01292-8

Baum, C., Chiang, J. H. Y., David, B. & Frederiksen, T. K. (2023). SoK: Privacy-Enhancing Technologies in Finance. Leibniz International Proceedings in Informatics, LIPIcs. https://doi.org/10.4230/LIPIcs.AFT.2023.12

Barcellos, M. & Aranha, D. F. (2018). 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

Baena, J., Cabarcas, D., Escudero, D. E., Khathuria, K. & Verbel, J. (2018). Rank Analysis of Cubic Multivariate Cryptosystems. In T. Lange & R. Steinwandt (Eds.), Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings (Vol. 10786, pp. 355-374). Springer VS. https://doi.org/10.1007/978-3-319-79063-3_17

Backes, M., Goldberg, I., Kate, A. & Toft, T. (2011). Adding Query Privacy to Robust DHTs. http://arxiv.org/abs/1107.1072

Backes, M., Goldberg, I., Kate, A. & Toft, T. (2012). Adding query privacy to robust DHTs. In ASIACCS '12 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security (pp. 30-31 ). Association for Computing Machinery. https://doi.org/10.1145/2414456.2414473

Backes, M., Kate, A. & Patra, A. (2011). Computational Verifiable Secret Sharing Revisited. In D. H. Lee & X. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings (pp. 590-609). Springer. https://doi.org/10.1007/978-3-642-25385-0_32

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

Ateniese, G., Francati, D., Magri, B. & Venturi, D. (2019). Public immunization against complete subversion without random oracles. In R. H. Deng, V. Gauthier-Umanã, M. Ochoa & M. Yung (Eds.), Applied Cryptography and Network Security (pp. 465-485). Springer. https://doi.org/10.1007/978-3-030-21568-2_23

Ateniese, G., Magri, B. & Venturi, D. (2020). Subversion-resilient signatures: Definitions, constructions and applications. Theoretical Computer Science, 820, 91-122. https://doi.org/10.1016/j.tcs.2020.03.021

Ateniese, G., Francati, D., Magri, B. & Venturi, D. (2021). Immunization against complete subversion without random oracles. Theoretical Computer Science, 859, 1-36. https://doi.org/10.1016/j.tcs.2021.01.002

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

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. (2018). 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., 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., 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

Displaying results 551 to 600 out of 624

Revised 04.10.2023

Marianne Dammand Iversen