Department of Computer Science

Aarhus University Seal
 Department of Computer Science Research Cryptography and Cyber Security BCM Publications

BCM Publications

BCM Publications

Below a list of publications by computer scientist researchers at AU related to "Center for Blockchains and Electronic Markets" (BCM). For further information about the research center, please see the center website: https://bcm.ku.dk/

2023

Conference Proceedings

  • Jakob Burkhardt, Ivan Damgård, Tore Kasper Frederiksen, Satrajit Ghosh, Claudio Orlandi: Improved Distributed RSA Key Generation Using the Miller-Rabin Test. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, November 2023, pp. 2501–2515. https://doi.org/10.1145/3576915.3623163
  • Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi. MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In: 4th Conference on Information-Theoretic Cryptography, ITC 2023, Leibniz International Proceedings in Informatics (LIPIcs), vol. 267, pp. 11:1-11:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023). https://doi.org/10.4230/LIPIcs.ITC.2023.11
  • Lennart Braun, Ivan Damgård, Claudio Orlandi: Secure Multiparty Computation from Threshold Encryption Based on Class Groups. In: Handschuh, H., Lysyanskaya, A. (eds) Advances in Cryptology – CRYPTO 2023, Lecture Notes in Computer Science, vol. 14081, Springer, Cham. https://doi.org/10.1007/978-3-031-38557-5_20 
  • Yashvanth Kondi, Claudio Orlandi, Lawrence Roy: Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. In: Handschuh, H., Lysyanskaya, A. (eds) Advances in Cryptology – CRYPTO 2023, Lecture Notes in Computer Science, vol. 14081, Springer, Cham. https://doi.org/10.1007/978-3-031-38557-5_21
  • Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi: Witness-Succinct Universally-Composable SNARKs. In: Hazay, C., Stam, M. (eds) Advances in Cryptology – EUROCRYPT 2023, Lecture Notes in Computer Science, vol. 14005, Springer, Cham. https://doi.org/10.1007/978-3-031-30617-4_11 
  • Matteo Campanelli, Danilo Francati, Claudio Orlandi: Structure-Preserving Compilers from New Notions of Obfuscations. In: Boldyreva, A., Kolesnikov, V. (eds) Public-Key Cryptography – PKC 2023, Lecture Notes in Computer Science, vol. 13941, Springer, Cham. https://doi.org/10.1007/978-3-031-31371-4_23
  • Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov: Secure Communication in Dynamic Incomplete Networks. In: 4th Conference on Information-Theoretic Cryptography, ITC 2023, Leibniz International Proceedings in Informatics (LIPIcs), vol. 267, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023). https://doi.org/10.4230/LIPIcs.ITC.2023.13 
  • Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov: Minimizing Setup in Broadcast-Optimal Two Round MPC. In: Hazay, C., Stam, M. (eds) Advances in Cryptology – EUROCRYPT 2023, Lecture Notes in Computer Science, vol. 14005, Springer, Cham. https://doi.org/10.1007/978-3-031-30617-4_5 
  • Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov: Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. In: Aly, A., Tibouchi, M. (eds) Progress in Cryptology – LATINCRYPT 2023, Lecture Notes in Computer Science, vol. 14168, Springer, Cham. https://doi.org/10.1007/978-3-031-44469-2_5 
  • Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov: Broadcast-Optimal Four-Round MPC in the Plain Model. In: Rothblum, G., Wee, H. (eds) Theory of Cryptography, TCC 2023, Lecture Notes in Computer Science, vol. 14370, Springer, Cham. https://doi.org/10.1007/978-3-031-48618-0_1 
  • Orestis Alpos, Christian Cachin, Simon Holmgaard Kamp, Jesper Buus Nielsen: Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast. In: 5th Conference on Advances in Financial Technologies, AFT 2023, Leibniz International Proceedings in Informatics (LIPIcs), vol. 282, pp. 31:1-31:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023). https://doi.org/10.4230/LIPIcs.AFT.2023.31
  • Mathias Hall-Andersen, Jesper Buus Nielsen: On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles. In: Hazay, C., Stam, M. (eds) Advances in Cryptology – EUROCRYPT 2023, Lecture Notes in Computer Science, vol. 14005, Springer, Cham. https://doi.org/10.1007/978-3-031-30617-4_15
  • Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner: CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. In: Boldyreva, A., Kolesnikov, V. (eds) Public-Key Cryptography – PKC 2023, Lecture Notes in Computer Science, vol. 13940, Springer, Cham. https://doi.org/10.1007/978-3-031-31368-4_16

  • Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin: Ramen: Souper Fast Three-Party Computation for RAM Programs. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, November 2023, pp.3284–3297. https://doi.org/10.1145/3576915.3623115

  • Lennart Braun, Moritz Huppert, Nora Khayata, Thomas Schneider, Oleksandr Tkachenko: FUSE - Flexible File Format and Intermediate Representation for Secure Multi-Party Computation.  In: Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, ASIA CCS 2023, July 2023, pp. 649–663. https://doi.org/10.1145/3579856.3590340

  • Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang: Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity - (Revisiting Space-Based Security in the Adaptive Setting). In: Boldyreva, A., Kolesnikov, V. (eds) Public-Key Cryptography – PKC 2023, Lecture Notes in Computer Science, vol. 13941, Springer, Cham. https://doi.org/10.1007/978-3-031-31371-4_3

  • Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi: Multi-key and Multi-input Predicate Encryption from Learning with Errors. In: Hazay, C., Stam, M. (eds) Advances in Cryptology – EUROCRYPT 2023, Lecture Notes in Computer Science, vol. 14006, Springer Cham. https://doi.org/10.1007/978-3-031-30620-4_19

  • Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi: Registered (Inner-Product) Functional Encryption. In: Guo, J., Steinfeld, R. (eds) Advances in Cryptology – ASIACRYPT 2023, Lecture Notes in Computer Science, vol. 14442, Springer, Singapore. https://doi.org/10.1007/978-981-99-8733-7_4

2022

Jounal Articles

  • Ivan Damgård, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi:  Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. J Cryptol 35, 14 (2022). https://doi.org/10.1007/s00145-022-09425-3 
  • Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard: Fast threshold ECDSA with honest majority. Journal of Computer Security, vol. 30, no. 1, pp. 167-196, 2022. https://doi.org/10.3233/JCS-200112 
  • Lennart Braun, Daniel Demmler, Thomas Schneider, Oleksandr Tkachenko: MOTION - A Framework for Mixed-Protocol Multi-Party Computation. ACM Transactions on Privacy and Security, vol. 25, Issue 2, Article No.: 8, pp. 1–35. https://doi.org/10.1145/3490390 

Conference Proceedings

  • Diego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin: Laconic Private Set-Intersection From Pairings. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, November 2022, pp. 111–124. https://doi.org/10.1145/3548606.3560642
  • Damiano Abram, Ivan Damgård, Claudio Orlandi, Peter Scholl: An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology – CRYPTO 2022, Lecture Notes in Computer Science, vol. 13510, Springer, Cham. https://doi.org/10.1007/978-3-031-15985-5_15
  • Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi: Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology – EUROCRYPT 2022, Lecture Notes in Computer Science, vol. 13276, Springer, Cham. https://doi.org/10.1007/978-3-031-07085-3_14
  • Claudio Orlandi, Divya Ravi, Peter Scholl: On the Bottleneck Complexity of MPC with Correlated Randomness. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds) Public-Key Cryptography – PKC 2022, Lecture Notes in Computer Science, vol 13177, Springer, Cham. https://doi.org/10.1007/978-3-030-97121-2_8
  • Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi: ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds) Public-Key Cryptography – PKC 2022, Lecture Notes in Computer Science, vol. 13177, Springer, Cham. https://doi.org/10.1007/978-3-030-97121-2_21
  • Cecilia Boschini, Ivan Damgård, Claudio Orlandi: On Access Control Encryption Without Sanitization. In: Galdi, C., Jarecki, S. (eds) Security and Cryptography for Networks (SCN 2022), Lecture Notes in Computer Science, vol 13409, Springer, Cham. https://doi.org/10.1007/978-3-031-14791-3_10
  • Matteo Campanelli, Felix Engelmann, Claudio Orlandi: Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. In: Galdi, C., Jarecki, S. (eds) Security and Cryptography for Networks, SCN 2022, Lecture Notes in Computer Science, vol. 13409, Springer, Cham. https://doi.org/10.1007/978-3-031-14791-3_33
  • Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits: Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. In: 2022 IEEE Symposium on Security and Privacy, S&P 2022, San Francisco, CA, USA, 2022, pp. 2554-2572. https://doi.org/10.1109/SP46214.2022.9833559.
  • Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero: Vector Commitments over Rings and Compressed $\varSigma $-Protocols. In: Kiltz, E., Vaikuntanathan, V. (eds) Theory of Cryptography. TCC 2022, Lecture Notes in Computer Science, vol. 13747, Springer, Cham. https://doi.org/10.1007/978-3-031-22318-1_7 
  • Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders Konring, Jesper Buus Nielsen: Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. In: Agrawal, S., Lin, D. (eds) Advances in Cryptology – ASIACRYPT 2022, Lecture Notes in Computer Science, vol. 13793, Springer, Cham. https://doi.org/10.1007/978-3-031-22969-5_6
  • Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi: GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, November 2022, pp. 683–696. https://doi.org/10.1145/3548606.3559375
  • Jesper Buus Nielsen, João Ribeiro, Maciej Obremski: Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology – CRYPTO 2022, Lecture Notes in Computer Science, vol. 13507, Springer, Cham. https://doi.org/10.1007/978-3-031-15802-5_5
  • Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen: Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology – CRYPTO 2022, Lecture Notes in Computer Science, vol. 13508, Springer, Cham. https://doi.org/10.1007/978-3-031-15979-4_14
  • Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi: Universally Composable Subversion-Resilient Cryptography. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology – EUROCRYPT 2022, Lecture Notes in Computer Science, vol. 13275, Springer, Cham. https://doi.org/10.1007/978-3-031-06944-4_10 
  • Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh: Succinct Zero-Knowledge Batch Proofs for Set Accumulators. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, November 2022, pp. 455–469. https://doi.org/10.1145/3548606.3560677
  • Matteo Campanelli, Mathias Hall-Andersen: Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2022, May 2022, pp. 652–666https://doi.org/10.1145/3488932.3517424
  • Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl: Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology – CRYPTO 2022, Lecture Notes in Computer Science, vol. 13510, Springer, Cham. https://doi.org/10.1007/978-3-031-15985-5_12
  • Diego F. Aranha, Felix Engelmann, Sebastian Kolby, Sophia Yakoubov: The State of the Union: Union-Only Signatures for Data Aggregation. In: Galdi, C., Jarecki, S. (eds) Security and Cryptography for Networks, SCN 2022, Lecture Notes in Computer Science, vol. 13409, Springer, Cham. https://doi.org/10.1007/978-3-031-14791-3_17
  • Felix Engelmann, Thomas Kerber, Markulf Kohlweiss, Mikhail Volkhov: Zswap: zk-SNARK Based Non-Interactive Multi-Asset Swaps. In: Proceedings Privacy Enhancing Technology, Volume: 2022, Issue: 4, pp. 507–527. https://doi.org/10.56553/popets-2022-0120
  • Dario Pasquini, Danilo Francati, Giuseppe Ateniese: Eluding Secure Aggregation in Federated Learning via Model Inconsistency. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, November 2022, pp. 2429–2443. https://doi.org/10.1145/3548606.3560557
  • Thomas Espitau, Pierre-Alain Fouque, François Gérard, Mélissa Rossi, Akira Takahashi, Mehdi Tibouchi, Alexandre Wallet, Yang Yu: Mitaka: A Simpler, Parallelizable, Maskable Variant of Falcon. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology – EUROCRYPT 2022, Lecture Notes in Computer Science, vol. 13277, Springer, Cham. https://doi.org/10.1007/978-3-031-07082-2_9
  • Cecilia Boschini, Akira Takahashi, Mehdi Tibouchi: MuSig-L: Lattice-Based Multi-signature with Single-Round Online Phase. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology – CRYPTO 2022, Lecture Notes in Computer Science, vol. 13508, Springer, Cham. https://doi.org/10.1007/978-3-031-15979-4_10

2021

Jounal Articles

  • Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart: High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. J Cryptol 34, 34 (2021). https://doi.org/10.1007/s00145-021-09403-1 

Conference Proceedings

  • Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi: Balancing Privacy and Accountability in Blockchain Identity Management. In: Paterson, K.G. (eds) Topics in Cryptology – CT-RSA 2021, Lecture Notes in Computer Science, vol. 12704, Springer, Cham. https://doi.org/10.1007/978-3-030-75539-3_23 
  • Chaya Ganesh, Claudio Orlandi, Daniel Tschudi, Aviv Zohar: Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. In: Garcia-Alfaro, J., Muñoz-Tapia, J.L., Navarro-Arribas, G., Soriano, M. (eds) Data Privacy Management, Cryptocurrencies and Blockchain Technology, DPM CBT 2021, Lecture Notes in Computer Science, vol. 13140, Springer, Cham. https://doi.org/10.1007/978-3-030-93944-1_12 
  • Claudio Orlandi, Peter Scholl, Sophia Yakoubov: The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In: Canteaut, A., Standaert, FX. (eds) Advances in Cryptology – EUROCRYPT 2021, Lecture Notes in Computer Science, vol. 12696, Springer, Cham. https://doi.org/10.1007/978-3-030-77870-5_24  
  • Alexander Munch-Hansen, Claudio Orlandi, Sophia Yakoubov. Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. In: Longa, P., Ràfols, C. (eds) Progress in Cryptology – LATINCRYPT 2021, Lecture Notes in Computer Science, vol. 12912, Springer, Cham. https://doi.org/10.1007/978-3-030-88238-9_18 
  • Diego Aranha, Anders Dalskov, Daniel Escudero, Claudio Orlandi. Improved Threshold Signatures, Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In: Longa, P., Ràfols, C. (eds) Progress in Cryptology – LATINCRYPT 2021, Lecture Notes in Computer Science, vol. 12912, Springer, Cham. https://doi.org/10.1007/978-3-030-88238-9_19 
  • Ivan Damgård, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi: Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. In: Garay, J.A. (eds) Public-Key Cryptography – PKC 2021, Lecture Notes in Computer Science, vol. 12710, Springer, Cham. https://doi.org/10.1007/978-3-030-75245-3_5  
  • Yashvanth Kondi, Bernardo Magri, Claudio Orlandi, Omer Shlomovits. Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. In: 2021 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 2021, pp. 608-625. https://doi.org/10.1109/SP40001.2021.00067  
  • Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing: Improved Single-Round Secure Multiplication Using Regenerating Codes. In: Tibouchi, M., Wang, H. (eds) Advances in Cryptology – ASIACRYPT 2021, Lecture Notes in Computer Science, vol. 13091, Springer, Cham. https://doi.org/10.1007/978-3-030-92075-3_8 
  • Ivan Bjerre Damgård, Boyang Li, Nikolaj Ignatieff Schwartzbach: More Communication Lower Bounds for Information-Theoretic MPC. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021, Leibniz International Proceedings in Informatics (LIPIcs), vol.199, pp. 2:1-2:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.ITC.2021.2 
  • Ivan Bjerre Damgård, Kasper Green Larsen, Sophia Yakoubov: Broadcast Secret-Sharing, Bounds and Applications. In: 2nd Conference on Information-Theoretic Cryptography (ITC 2021), Leibniz International Proceedings in Informatics (LIPIcs), vol. 199, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.ITC.2021.10 
  • Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov: Broadcast-Optimal Two Round MPC with an Honest Majority. In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021, Lecture Notes in Computer Science, vol. 12826, Springer, Cham. https://doi.org/10.1007/978-3-030-84245-1_6  
  • Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger: Oblivious TLS via Multi-party Computation. In: Paterson, K.G. (eds) Topics in Cryptology – CT-RSA 2021, Lecture Notes in Computer Science, vol 12704, Springer, Cham. https://doi.org/10.1007/978-3-030-75539-3_3  
  • Ivan Damgård, Daniel Escudero, Divya Ravi: Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. In: Nissim, K., Waters, B. (eds) Theory of Cryptography, TCC 2021, Lecture Notes in Computer Science, vol. 13042, Springer, Cham. https://doi.org/10.1007/978-3-030-90459-3_20 
  • Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov: YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021, Lecture Notes in Computer Science, vol. 12826, Springer, Cham. https://doi.org/10.1007/978-3-030-84245-1_3 
  • Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner: TARDIS: A Foundation of Time-Lock Puzzles in UC. In: Canteaut, A., Standaert, FX. (eds) Advances in Cryptology – EUROCRYPT 2021, Lecture Notes in Computer Science, vol 12698, Springer, Cham. https://doi.org/10.1007/978-3-030-77883-5_15 
  • Simon Holmgaard Kamp, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen, Daniel Tschudi: Weight-Based Nakamoto-Style Blockchains. In: Longa, P., Ràfols, C. (eds) Progress in Cryptology – LATINCRYPT 2021, Lecture Notes in Computer Science, vol. 12912, Springer, Cham. https://doi.org/10.1007/978-3-030-88238-9_15 
  • Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, Sophia Yakoubov: Random-Index PIR and Applications. In: Nissim, K., Waters, B. (eds) Theory of Cryptography, TCC 2021, Lecture Notes in Computer Science, vol 13044, Springer, Cham. https://doi.org/10.1007/978-3-030-90456-2_2 
  • Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez: Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. In: Canteaut, A., Standaert, FX. (eds) Advances in Cryptology – EUROCRYPT 2021, Lecture Notes in Computer Science, vol. 12698, Springer, Cham. https://doi.org/10.1007/978-3-030-77883-5_2 
  • Daniel Escudero, Eduardo Soria-Vazquez: Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings. In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021, Lecture Notes in Computer Science, vol 12826, Springer, Cham. https://doi.org/10.1007/978-3-030-84245-1_12  
  • Matteo Campanelli, Hamidreza Khoshakhlagh: Succinct Publicly-Certifiable Proofs - Or, Can a Blockchain Verify a Designated-Verifier Proof? In: Adhikari, A., Küsters, R., Preneel, B. (eds) Progress in Cryptology – INDOCRYPT 2021, Lecture Notes in Computer Science, vol. 13143, Springer, Cham. https://doi.org/10.1007/978-3-030-92518-5_27 
  • Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet, Peter Scholl: Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, November 2021, pp. 192–211. https://doi.org/10.1145/3460120.3484812
  • Felix Engelmann, Lukas Müller, Andreas Peter, Frank Kargl, Christoph Bösch: SwapCT: Swap Confidential Transactions for Privacy-Preserving Multi-Token Exchanges. In: Proceedings Privacy Enhancing Technology, vol. 2021, Issue: 4, pp. 270–290. https://doi.org/10.2478/popets-2021-0070
  • Danilo Francati, Alessio Guidi, Luigi Russo, Daniele Venturi: Identity-Based Matchmaking Encryption Without Random Oracles. In: Adhikari, A., Küsters, R., Preneel, B. (eds) Progress in Cryptology – INDOCRYPT 2021, Lecture Notes in Computer Science, vol. 13143, Springer, Cham. https://doi.org/10.1007/978-3-030-92518-5_19

2020

Journal Articles

  • Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi: Continuously Non-malleable Codes in the Split-State Model. J Cryptol 33, 2034–2077 (2020). https://doi.org/10.1007/s00145-020-09362-z 

Conference Proceedings

  • Ivan Damgård, Claudio Orlandi, Mark Simkin: Black-Box Transformations from Passive to Covert Security with Public Verifiability. In: Micciancio, D., Ristenpart, T. (eds) Advances in Cryptology – CRYPTO 2020, Lecture Notes in Computer Science, vol. 12171, Springer, Cham. https://doi.org/10.1007/978-3-030-56880-1_23 
  • Anders P. K. Dalskov, Claudio Orlandi, Marcel Keller, Kris Shrishak, Haya Schulmann: Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds) Computer Security – ESORICS 2020, Lecture Notes in Computer Science, vol. 12309, Springer, Cham. https://doi.org/10.1007/978-3-030-59013-0_32 
  • Diego F. Aranha, Claudio Orlandi, Akira Takahashi, Greg Zaverucha: Security of Hedged Fiat-Shamir Signatures Under Fault Attacks. In: Canteaut, A., Ishai, Y. (eds) Advances in Cryptology – EUROCRYPT 2020, Lecture Notes in Computer Science, vol. 12105, Springer, Cham. https://doi.org/10.1007/978-3-030-45721-1_23
  • Markus Brandt, Claudio Orlandi, Kris Shrishak, Haya Schulmann: Optimal Transport Layer for Secure Computation. In: Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT, SciTePress, pp. 130-141. https://doi.org/10.5220/0009826801300141 
  • Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin: Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security. In: 1st Conference on Information-Theoretic Cryptography, ITC 2020, Leibniz International Proceedings in Informatics (LIPIcs), vol. 163, pp. 5:1-5:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.ITC.2020.5 
  • Daniel E. Lucani, Lars Nielsen, Claudio Orlandi, Elena Pagnin, Rasmus Vestergaard: Secure Generalized Deduplication via Multi-Key Revealing Encryption. In: Galdi, C., Kolesnikov, V. (eds) Security and Cryptography for Networks, SCN 2020, Lecture Notes in Computer Science, vol 12238, Springer, Cham. https://doi.org/10.1007/978-3-030-57990-6_15 
  • Ivan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov: Stronger Security and Constructions of Multi-designated Verifier Signatures. In: Pass, R., Pietrzak, K. (eds) Theory of Cryptography, TCC 2020, Lecture Notes in Computer Science, vol 12551, Springer, Cham. https://doi.org/10.1007/978-3-030-64378-2_9
  • Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan: Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. In: Moriai, S., Wang, H. (eds) Advances in Cryptology – ASIACRYPT 2020, Lecture Notes in Computer Science, vol. 12493, Springer, Cham. https://doi.org/10.1007/978-3-030-64840-4_6 
  • Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård: Fast Threshold ECDSA with Honest Majority. In: Galdi, C., Kolesnikov, V. (eds) Security and Cryptography for Networks, SCN 2020, Lecture Notes in Computer Science, vol. 12238, Springer, Cham. https://doi.org/10.1007/978-3-030-57990-6_19 
  • Suvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen: Reverse Firewalls for Actively Secure MPCs. In: Micciancio, D., Ristenpart, T. (eds) Advances in Cryptology – CRYPTO 2020, Lecture Notes in Computer Science, vol. 12171, Springer, Cham. https://doi.org/10.1007/978-3-030-56880-1_26 
  • Jesper Buus Nielsen, Mark Simkin: Lower Bounds for Leakage-Resilient Secret Sharing. In: Canteaut, A., Ishai, Y. (eds) Advances in Cryptology – EUROCRYPT 2020, Lecture Notes in Computer Science, vol. 12105, Springer, Cham. https://doi.org/10.1007/978-3-030-45721-1_20 
  • Thomas Dinsdale-Young, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi: Afgjort: A Partially Synchronous Finality Layer for Blockchains. In: Galdi, C., Kolesnikov, V. (eds) Security and Cryptography for Networks, SCN 2020, Lecture Notes in Computer Science, vol. 12238, Springer, Cham. https://doi.org/10.1007/978-3-030-57990-6_2 
  • Anders Dalskov, Eysa Lee and Eduardo Soria-Vazquez: Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation. In: Moriai, S., Wang, H. (eds) Advances in Cryptology – ASIACRYPT 2020, Lecture Notes in Computer Science, vol. 12493, Springer, Cham. https://doi.org/10.1007/978-3-030-64840-4_8
  • Carsten Baum, Emanuela Orsini, Peter Scholl and Eduardo Soria Vazquez: Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. In: Micciancio, D., Ristenpart, T. (eds) Advances in Cryptology – CRYPTO 2020, Lecture Notes in Computer Science, vol. 12171, Springer, Cham. https://doi.org/10.1007/978-3-030-56880-1_20

2019

Journal Articles

  • Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi: Continuously non-malleable codes with split-state refresh. In: Theoretical Computer Science, vol. 759, 2019, February 2029, pp. 98-132, Elsevier. https://doi.org/10.1016/j.tcs.2018.12.028.

Conference Proceedings

  • Elena Pagnin, Gunnar Gunnarsson, Pedram Talebi, Claudio Orlandi, Andrei Sabelfeld: TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. In: Proc. Priv. Enhancing Technology, vol. 4, pp. 93-111. https://doi.org/10.2478/popets-2019-0060
  • Prastudy Fauzi, Sarah Meiklejohn, Rebekah Mercer, Claudio Orlandi: Quisquis: A New Design for Anonymous Cryptocurrencies. In: Galbraith, S., Moriai, S. (eds) Advances in Cryptology – ASIACRYPT 2019, Lecture Notes in Computer Science, vol. 11921, Springer, Cham. https://doi.org/10.1007/978-3-030-34578-5_23
  • Ivan Damgård, Chaya Ganesh, Claudio Orlandi: Proofs of Replicated Storage Without Timing Assumptions. In: Boldyreva, A., Micciancio, D. (eds) Advances in Cryptology – CRYPTO 2019, Lecture Notes in Computer Science, vol. 11692, Springer, Cham. https://doi.org/10.1007/978-3-030-26948-7_13
  • Chaya Ganesh, Claudio Orlandi, Daniel Tschudi: Proof-of-Stake Protocols for Privacy-Aware Blockchains. In: Ishai, Y., Rijmen, V. (eds) Advances in Cryptology – EUROCRYPT 2019, Lecture Notes in Computer Science, vol. 11476, Springer, Cham. https://doi.org/10.1007/978-3-030-17653-2_23
  • Ivan Damgård, Helene Haagh, Michael Nielsen, Claudio Orlandi: Commodity-Based 2PC for Arithmetic Circuits. In: Albrecht, M. (eds) Cryptography and Coding, IMACC 2019, Lecture Notes in Computer Science, vol. 11929,  Springer, Cham. https://doi.org/10.1007/978-3-030-35199-1_8

  • Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli: Efficient UC Commitment Extension with Homomorphism for Free (and Applications). In: Galbraith, S., Moriai, S. (eds) Advances in Cryptology – ASIACRYPT 2019, Lecture Notes in Computer Science, vol. 11922, Springer, Cham. https://doi.org/10.1007/978-3-030-34621-8_22 

  • Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen: Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In: Boldyreva, A., Micciancio, D. (eds) Advances in Cryptology – CRYPTO 2019, Lecture Notes in Computer Science, vol. 11693, Springer, Cham. https://doi.org/10.1007/978-3-030-26951-7_3

  • Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin: Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. In: Boldyreva, A., Micciancio, D. (eds) Advances in Cryptology – CRYPTO 2019, Lecture Notes in Computer Science, vol. 11693, Springer, Cham. https://doi.org/10.1007/978-3-030-26951-7_18

Contact

Claudio Orlandi

Professor
M
H 5335, 283
P +4521433249

Malene Bisgaard Blaabjerg Andersen

Section Manager
M
H 5335, 287
P +4522980802
Revised 01.09.2025
-
Malene Bisgaard Blaabjerg Andersen