Peer-reviewed journals and conference proceedings:

  1. Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains

    by Elli Androulaki, Christian Cachin, Angelo De Caro, Eleftherios Kokoris-Kogias.
    In proceedings part I of  23rd European Symposium on Research in Computer Security, ESORICS 2018, Barcelona, Spain, September 3-7, 2018, pages 111-131.
  2. Combining private set-intersection with secure two-party computation

    by Michele Ciampi and Claudio Orlandi.
    In proceedings of International Conference on Security and Cryptography for Networks, SCN 2018, Amalfi, Italy, September 5-7, 2018, pages 464-482. Available at
  3. Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability.

    by Christian Badertscher, Peter Gazi, Aggelos Kiayias, Alexander Russell, and Vassilis Zikas.
    In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pages 913–930, 2018. Available at
  4. On the Security Properties of e-Voting Bulletin Boards.

    by Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias.
    In Catalano D., De Prisco R. (eds) Security and Cryptography for Networks. SCN 2018. Lecture Notes in Computer Science, vol 11035. Springer, Cham. Available at
  5. On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards

    by Sven Heiberg, Ivo Kubjas, Janno Siim and Jan Willemson.
    In proceedings of the Third International Joint Conference on Electronic Voting E-Vote-ID 2018, 2–5 October 2018, Lochau/Bregenz, Austria, TUT press, pp. 259-276. Available at
  6. Non-Interactive Secure Computation from One-Way Functions

    by Saikrishna Badrinarayanan, Abhishek Jain; Rafail Ostrovsky and Ivan Visconti.
    In proceedings Part III of 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018.

  7. Publicly Verifiable Proofs from Blockchains

    by Alessandra Scafuro; Luisa Siniscalchi; Ivan Visconti 
    In proceedings Part I of 2nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019

  8. DL-Extractable UC-Commitment Schemes

    by Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim and Michal Zajac
    In Robert Deng and Moti Yung, editors, ACNS 2019, Lecture Notes in Computer Science, Bogotá , Colombia, June 5-7, 2019. Springer, Heidelberg.

  9. UC-Secure CRS Generation for SNARKs

    by Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim and Michal Zajac
    In Johannes Buchmann, Abderrahmane Nitaj and Tajjeeddine Rachidi, editors, Africacrypt 2019, Notes in Computer Science, Rabat, Morocco, July 9-11, 2019. Springer, Heidelberg

  10. On the Efficiency of Privacy-Preserving Smart Contract Systems

    by Karim Baghery
    In Johannes Buchmann, Abderrahmane Nitaj and Tajjeeddine Rachidi, editors, Africacrypt 2019, Lecture Notes in Computer Science, Rabat, Morocco, July 9-11, 2019. Springer, Heidelberg

  11. Simulation Extractability in Groth's zk-SNARK

    By Shahla Atapoor and Karim Baghery
    In ESORICS International Workshop on Cryptocurrencies and Blockchain Technology - CBT 2019, volume 11737 of Lecture Notes in Computer Science, Luxembourg, September 26--27, 2019. Springer, Heidelberg. Available on

Technical reports

  1. New Protocols for Secure Linear Algebra: Pivoting-Free Elimination and Fast Block Recursive Matrix Decomposition. By Niek J. Bouman and Niels de Vreede. Cryptology ePrint Archive, Report 2018/703. Available at
  2. SoK: A consensus taxonomy in the blockchain era. By Juan Garay and Aggelos Kiayias. Cryptology ePrint Archive, Report 2018/754, 2018. Available at
  3. On QA-NIZK in the BPK Model. By Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. Cryptology ePrint Archive, Report 2018/877, 2018. Available at
  4. Proof-of-work sidechains. By Aggelos Kiayias and Dionysis Zindros. Cryptology ePrint Archive, Report 2018/1048, 2018. Available at
  5. Ouroboros-BFT: A simple Byzantine fault tolerant consensus protocol. By Aggelos Kiayias and Alexander Russell. Cryptology ePrintArchive, Report 2018/1049, 2018. Available at
  6. Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks. By Mark Abspoel and Niek J. Bouman and Berry Schoenmakers and Niels de Vreede. Cryptology ePrint Archive, Report 2018/1236, 2018. Available at
  7. Multi-Protocol UC and its Use for Building Modular and Efficient Protocols. By Jan Camenisch and Manu Drijvers and Björn Tackmann. Cryptology ePrint Archive, Report 2019/065, 2019. Available at
  8. Round Optimal Secure Multiparty Computation from Minimal Assumptions. By Arka Rai Choudhuri and Michele Ciampi and Vipul Goyal and Abhishek Jain and Rafail Ostrovsky. Cryptology ePrint Archive, Report 2019/216, 2019. Available at
  9. Key-and-argument-updatable QA-NIZKs. By Helger Lipmaa. Cryptology ePrintAarchive, Report 2019/333, 2019. Available at
  10. Simple yet efficient knowledge-sound and non-black-box any-simulation extractable
    ZK-SNARKs. By Helger Lipmaa. Cryptology ePrint Archive, Report 2019/612, 2019. Available at
  11. The Rush Dilemma: Attacking and Repariring Smart Contracts on Forking Blockchains. by Vincenzo Botta and Daniele Friolo and Daniele Venturi and Ivan Visconti. Cryptology ePrint Archive, Report 2019/891, 2019. Available at



MPyC for Secure Multiparty Computation in Python. Available at