Publications

List of publications

Sort by: Date | Author | Title

Brandt, J., Damgård, I. B. & Landrock, P. (1988). Anonymous and verifiable registration in databases. In Advances in cryptology - EUROCRYPT '88 (pp. 167-176). Springer. https://doi.org/10.1007/3-540-45961-8_14

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. P. (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (extended abstract). In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 583-588). Springer. https://doi.org/10.1007/0-387-34799-2_43

Brandt, M., Orlandi, C., Shrishak, K. & Shulman, H. (2020). Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.), ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library. https://doi.org/10.5220/0009826801300141

Boyle, E., Kohl, L. & Scholl, P. (2019). Homomorphic Secret Sharing from Lattices Without FHE. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings: EUROCRYPT 2019 (pp. 3-33). Springer VS. https://doi.org/10.1007/978-3-030-17656-3_1

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2019). Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In D. Micciancio & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings: CRYPTO 2019 (pp. 489-518). Springer. https://doi.org/10.1007/978-3-030-26954-8_16

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P. & Scholl, P. (2019). Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In L. Cavallaro, J. Kinder, X. Wang & J. Katz (Eds.), CCS 2019 - Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (pp. 291-308). Association for Computing Machinery. https://doi.org/10.1145/3319535.3354255

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Efficient pseudorandom correlation generators from ring-lpn. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 387-416). Springer. https://doi.org/10.1007/978-3-030-56880-1_14

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Correlated Pseudorandom Functions from Variable-Density LPN. In S. Irani (Ed.), Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 1069-1080). Article 9317926 IEEE. https://doi.org/10.1109/FOCS46700.2020.00103

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2021). Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV (pp. 487-516). Springer. https://doi.org/10.1007/978-3-030-84259-8_17

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 603-633). Springer. https://doi.org/10.1007/978-3-031-15979-4_21

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

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

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 and Business Media Deutschland GmbH. 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

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

Displaying results 451 to 500 out of 567

Revised 07.03.2025

Marianne Dammand Iversen