Publications

List of publications

Sort by: Date | Author | Title

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. 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 I (pp. 271-302). Springer. https://doi.org/10.1007/978-3-031-30545-0_10

Boyle, E., Kohl, L., Li, Z. & Scholl, P. (2025). Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. In K.-M. Chung & Y. Sasaki (Eds.), Advances in Cryptology – ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 266-298). Springer Nature. https://doi.org/10.1007/978-981-96-0938-3_9

Boyar, J., Chaum, D., Damgård, I. B. & Pedersen, T. (1990). Convertible Undeniable Signatures. In A. J. Menezez & S. A. Vanstone (Eds.), Advances in Cryptology - CRYPT0' 90: Proceedings (pp. 189-205). Springer. https://doi.org/10.1007/3-540-38424-3_14

Boyar, J., Damgård, I. B. & Peralta, R. (2000). Short Non-Interactive Cryptographic Proofs. Journal of Cryptology, 13(4), 449-472. https://doi.org/10.1007/s001450010011

Boudgoust, K. & Scholl, P. (2023). Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. In J. Guo & R. Steinfeld (Eds.), 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 I (pp. 371-404). Springer. https://doi.org/10.1007/978-981-99-8721-4_12

Boudgoust, K. & Keller, H. (2025). Module Learning with Errors with Truncated Matrices. In R. Niederhagen & M.-J. O. Saarinen (Eds.), Post-Quantum Cryptography - 16th International Workshop, PQCrypto 2025, Proceedings (Vol. Part 1, pp. 255-277). Springer. https://doi.org/10.1007/978-3-031-86599-2_9

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 220-243). Springer. https://doi.org/10.1007/978-3-031-14791-3_10

Bøgetoft, P., Lund Christensen, D., Damgård, I. B., Geisler, M., Jacobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J. I., Schwartzbach, M. I., Toft, T. & Nielsen, K. (2009). Secure Multiparty Computation Goes Live. Lecture Notes in Computer Science, 5628, 325-343. https://doi.org/10.1007/978-3-642-03549-4_20

Blatchley Hansen, A., Eskilden, M. & Nielsen, E. H. (2020). Toolchain for Timing Leakage Analysis of NIST Lightweight Crypto Candidates. Abstract from NIST Lightweight Cryptography Workshop 2020. https://csrc.nist.gov/CSRC/media/Events/lightweight-cryptography-workshop-2020/documents/papers/toolchain-timing-leakage-lwc2020.pdf

Ben-Sasson, E., Ben-Tov, I., Damgård, I., Ishai, Y. & Ron-Zewi, N. (2016). On public key encryption from noisy codewords. In Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 9615, pp. 417-446). Springer VS. https://doi.org/10.1007/978-3-662-49387-8_16

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

Behera, A. R., Meyer, P., Orlandi, C., Roy, L. & Scholl, P. (2026). Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. In B. Applebaum & H. Lin (Eds.), Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings (pp. 301-332). Springer. https://doi.org/10.1007/978-3-032-12287-2_11

Beerliová-Trubíniová, Z., Hirt, M. & Nielsen, J. B. (2010). On the theoretical gap between synchronous and asynchronous MPC protocols. In A. Richa & R. Guerraoui (Eds.), Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. PODC '10 (pp. 211-218). Association for Computing Machinery. https://doi.org/10.1145/1835698.1835746

Baum, C., Damgård, I. B. & Orlandi, C. (2014). Publicly Auditable Secure Multi-Party Computation. 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. 175-196 ). Springer VS. https://doi.org/10.1007/978-3-319-10879-7_11

Baum, C., Damgård, I. B., Toft, T. & Zakarias, R. W. (2016). Better Preprocessing for Secure Multiparty Computation. In M. Manulis, A.-R. Sadeghi & S. Schneider (Eds.), Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings: 14th International Conference on Applied Cryptography and Network Security (Vol. 9696, pp. 327-345). Springer VS. https://doi.org/10.1007/978-3-319-39555-5_18

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 368-385). Springer VS. https://doi.org/10.1007/978-3-319-98113-0_20

Baum, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2020). Efficient constant-round mpc with identifiable abort and public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 562-592). Springer. https://doi.org/10.1007/978-3-030-56880-1_20

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2020). Efficient protocols for oblivious linear function evaluation from ring-LWE. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 130-149). Springer. https://doi.org/10.1007/978-3-030-57990-6_7

Baum, C., de Saint Guilhem, C. D., Kales, D., Orsini, E., Scholl, P. & Zaverucha, G. (2021). Banquet: Short and Fast Signatures from AES. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021: 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part I (pp. 266-297). Springer. https://doi.org/10.1007/978-3-030-75245-3_11

Baum, C., Braun, L., Munch-Hansen, A., Razet, B. & Scholl, P. (2021). Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. In CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (pp. 192-211). Association for Computing Machinery. https://doi.org/10.1145/3460120.3484812

Baum, C., Malozemoff, A. J., Scholl, P. & Rosen, M. (2021). Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings: Proceedings (pp. 92-122). Springer. https://doi.org/10.1007/978-3-030-84259-8_4

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., 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

Baum, C., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Orsini, E., Roy, L. D. & Scholl, P. (2023). Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In H. Handschuh & A. Lysyanskaya (Eds.), Advances in Cryptology: CRYPTO 2023 (pp. 581-615). Springer. https://doi.org/10.1007/978-3-031-38554-4_19

Baum, C., David, B., Dowsley, R., Kishore, R., Nielsen, J. B. & Oechsner, S. (2023). CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part I (Vol. 1, pp. 439-470). Springer Science+Business Media. https://doi.org/10.1007/978-3-031-31368-4_16

Baum, C., Beullens, W., Mukherjee, S., Orsini, E., Ramacher, S., Rechberger, C., Roy, L. & Scholl, P. (2025). One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. In K.-M. Chung & Y. Sasaki (Eds.), Advances in Cryptology - ASIACRYPT 2024 (pp. 463-493). Springer Nature. https://doi.org/10.1007/978-981-96-0875-1_15

Baum, C., Beullens, W., Braun, L., Delpech de Saint Guilhem, C., Klooß, M., Majenz, C., Mukherjee, S., Orsini, E., Ramacher, S., Rechberger, C., Roy, L. & Scholl, P. (2025). Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. In Y. Tauman Kalai & S. F. Kamara (Eds.), Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings (pp. 124-156). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-01887-8_5

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

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

Displaying results 501 to 550 out of 626

Revised 26.01.2026

Marianne Dammand Iversen