Skip to main navigation Skip to search Skip to main content

Personal profile

Research Interests

My research focuses on theory of Cryptography. More specifically, I am interested in zero-Knowledge proofs, multi-party computation protocols and Blockchain.

Biography

Michele took the Bachelor's Degree cum laude in Computer Science from the University of Salerno in 2012 before completing his Master's Degree cum laude in Computer Science from the University of Salerno in 2014.

In 2018 Michele completed his Ph.D. in Computer Science at the University of Salerno. He was supervised by Prof. Giuseppe Persiano and Prof. Ivan Visconti.

His thesis on "Round and Computational Efficiency of Two-Party Protocols" was rewarded with the  "Best Ph.D. Thesis in Theoretical Computer Science Award 2018", from the European Association for Theoretical Computer Science (Italian Chapter).

In 2016 Michele was a Visiting Graduate Researcher at UCLA (University of California, Los Angeles) under the supervision of Professor Rafail Ostrovsky. He spent the summer of 2017 at Aarhus University hosted by Prof. Ivan Damgaard and Prof. Claudio Orlandi.

From 2018 to 2021 has worked as a research associate at the blockchain technology laboratory at the University of Edinburgh, and in April 2021 he became Chancellor's Fellow.

Michele's research focuses on cryptography, in particular, on theoretical aspects of secure multi-party computation, zero-knowledge proofs, and blockchain protocols.

Fingerprint

Dive into the research topics where Michele Ciampi is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • Round and Computational Efficiency of Multi-party Protocols

    Ciampi, M. & Siniscalchi, L., 21 Aug 2025, Springer. 295 p. (Information Security and Cryptography; vol. Part F791)

    Research output: Book/ReportBook

    Open Access
  • Universally composable SNARKs with transparent setup without programmable random oracle

    Badertscher, C., Campanelli, M., Ciampi, M., Russo, L. & Siniscalchi, L., 17 Aug 2025, Advances in Cryptology – CRYPTO 2025 - 45th Annual International Cryptology Conference, Proceedings. Tauman Kalai, Y. & Kamara, S. F. (eds.). Springer, p. 225-258 34 p. (Lecture Notes in Computer Science; vol. 16006 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • Delayed-input multi-party computation

    Ciampi, M., Sternad, J. & Xia, Y., 22 Jun 2025, Applied Cryptography and Network Security - 23rd International Conference, ACNS 2025, Proceedings. Fischlin, M. & Moonsamy, V. (eds.). Springer, p. 339-368 30 p. (Lecture Notes in Computer Science; vol. 15825 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Black-box constant-round secure 2PC with succinct communication

    Ciampi, M., Kumar Misra, A., Ostrovsky, R. & Shah, A., 28 Apr 2025, Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2025, Proceedings. Fehr, S. & Fouque, P.-A. (eds.). Springer, p. 360-389 30 p. (Lecture Notes in Computer Science; vol. 15605 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Round-optimal black-box multiparty computation from polynomial-time assumptions

    Ciampi, M., Ostrovsky, R., Siniscalchi, L. & Waldner, H., 28 Apr 2025, Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2025, Proceedings. Fehr, S. & Fouque, P.-A. (eds.). Springer, p. 331-359 29 p. (Lecture Notes in Computer Science; vol. 15605 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution