Publications

List of publications

Damgård, I., Escudero, D. & Ravi, D. (2021). Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. In Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 591-622). Springer. https://doi.org/10.1007/978-3-030-90459-3_20

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

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

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

Damgård, I. B., Li, B. & Schwartzbach, N. I. (2021). More communication lower bounds for information-theoretic MPC. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2021.2

Abram, D., Damgård, I., Scholl, P. & Trieflinger, S. (2021). Oblivious TLS via Multi-party Computation. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 51-74). Springer. https://doi.org/10.1007/978-3-030-75539-3_3

Fleischhacker, N. & Simkin, M. (2021). On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments. 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 II (pp. 618-648). Springer. https://doi.org/10.1007/978-3-030-75248-4_22

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.

Braun, L., Pancholi, M. R., Rachuri, R. & Simkin, M. (2021). Ramen: Souper Fast Three-Party Computation for RAM Programs. In CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3284-3297). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623115

Gentry, C., Halevi, S., Magri, B., Nielsen, J. B. & Yakoubov, S. (2021). Random-Index PIR and Applications. In K. Nissim & B. Waters (Eds.), Theory of Cryptography : 19th International Conference, TCC 2021, Proceedings (pp. 32-61). Springer. https://doi.org/10.1007/978-3-030-90456-2_2

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

Guimaraes, A., Borin, E. & Aranha, D. F. (2021). Revisiting the functional bootstrap in TFHE. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2021(2), 229-253. https://doi.org/10.46586/tches.v2021.i2.229-253

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

Abdolmaleki, B., Khoshakhlagh, H. & Lipmaa, H. (2021). Smooth Zero-Knowledge Hash Functions. In A. Adhikari, R. Küsters & B. Preneel (Eds.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 510-535). Springer. https://doi.org/10.1007/978-3-030-92518-5_23

Munch-Hansen, A., Orlandi, C. & Yakoubov, S. (2021). Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 363-381). Springer. https://doi.org/10.1007/978-3-030-88238-9_18

Campanelli, M. & Khoshakhlagh, H. (2021). Succinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof? In A. Adhikari, R. Küsters & B. Preneel (Eds.), Progress in Cryptology – INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, 2021, Proceedings: 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings (pp. 607-631). Springer. https://doi.org/10.1007/978-3-030-92518-5_27

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

Nayara Ortiz, J., Ricardo de Araujo, R., Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021). The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings. Entropy, 23(9), Article 1108. https://doi.org/10.3390/e23091108

Orlandi, C., Scholl, P. & Yakoubov, S. (2021). The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In A. Canteaut & F.-X. Standaert (Eds.), Advances in Cryptology – EUROCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 678-708). Springer. https://doi.org/10.1007/978-3-030-77870-5_24

Reyzin, L., Smith, A. & Yakoubov, S. (2021). Turning HATE Into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. In Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings: Proceedings (Vol. 12716, pp. 361-378). Springer. https://doi.org/10.1007/978-3-030-78086-9_27

Damgård, I. B., Orlandi, C., Takahashi, A. & Tibouchi, M. (2021). Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, 2021, Proceedings: 24rd IACR International Conference on Practice and Theory of Public-Key Cryptography, proceedings part 1 (pp. 99-130). Springer. https://doi.org/10.1007/978-3-030-75245-3_5

Aranha, D. F., Baum, C., Gjøsteen, K. & Silde, T. (2021). 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

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

Gentry, C., Halevi, S., Krawczyk, H., Magri, B., Nielsen, J. B., Rabin, T. & Yakoubov, S. (2021). YOSO: You Only Speak Once: Secure MPC with Stateless Ephemeral Roles. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: Annual International Cryptology Conference (pp. 64-93). Springer. https://doi.org/10.1007/978-3-030-84245-1_3

Dinsdale-Young, T., Magri, B., Matt, C., Nielsen, J. B. & Tschudi, D. (2020). Afgjort: A partially synchronous finality layer for blockchains. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 24-44). Springer. https://doi.org/10.1007/978-3-030-57990-6_2

Simkin, M. (2020). Alice, Bits, and Bob.

Abspoel, M., Cramer, R., Damgård, I., Escudero, D., Rambaud, M., Xing, C. & Yuan, C. (2020). Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/pkZ. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings (Vol. III, pp. 151-180). Springer. https://doi.org/10.1007/978-3-030-64840-4_6

Damgård, I., Orlandi, C. & Simkin, M. (2020). Black-box transformations from passive to covert security with public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (Vol. Cham, pp. 647-676). Springer. https://doi.org/10.1007/978-3-030-56880-1_23

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

Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2020). Continuously Non-malleable Codes in the Split-State Model. Journal of Cryptology, 33(4), 2034-2077. https://doi.org/10.1007/s00145-020-09362-z

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

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

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

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

Napoli, O., Martins do Rosario, V., Aranha, D. F. & Borin, E. (2020). Evaluation and Mitigation of Timing Side-channel Leakages on Multiple-target Dynamic Binary Translators. In C. Bianchini, C. Osthoff, P. Souza & R. Ferreira (Eds.), High Performance Computing Systems: WSCAD 2018 (pp. 152-167). Springer. https://doi.org/10.1007/978-3-030-41050-6_10

Damgård, I., Jakobsen, T. P., Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2020). Fast threshold ECDSA with honest majority. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 382-400). Springer. https://doi.org/10.1007/978-3-030-57990-6_19

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

Escudero, D., Ghosh, S., Keller, M., Rachuri, R. & Scholl, P. (2020). Improved primitives for mpc over mixed arithmetic-binary circuits. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 823-852). Springer. https://doi.org/10.1007/978-3-030-56880-1_29

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

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. https://doi.org/10.1007/s00145-020-09355-y

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

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

Brian, G., Faonio, A., Obremski, M., Simkin, M. & Venturi, D. (2020). Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 127-155). Springer. https://doi.org/10.1007/978-3-030-56877-1_5

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

Díaz Cardell, S., Aranha, D. F. & Fuster-Sabater, A. (2020). Recovering decimation-based cryptographic sequences by means of linear CAs. Logic Journal of the IGPL, 28(4), 430–448. https://doi.org/10.1093/jigpal/jzz051

Chakraborty, S., Dziembowski, S. & Nielsen, J. B. (2020). Reverse firewalls for actively secure mpcs. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 732-762). Springer. https://doi.org/10.1007/978-3-030-56880-1_26

Displaying results 151 to 200 out of 592

Revised 02.09.2025

Marianne Dammand Iversen