| Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability C Badertscher, P Gaži, A Kiayias, A Russell, V Zikas Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 349 | 2018 |
| Bitcoin as a transaction ledger: A composable treatment C Badertscher, U Maurer, D Tschudi, V Zikas Journal of Cryptology 37 (2), 18, 2024 | 268 | 2024 |
| Universally composable synchronous computation J Katz, U Maurer, B Tackmann, V Zikas Theory of Cryptography Conference, 477-498, 2013 | 231 | 2013 |
| Fair and robust multi-party computation using a global transaction ledger A Kiayias, HS Zhou, V Zikas Cryptology ePrint Archive, Report 2015/574, 2015 | 213 | 2015 |
| Secure Multi-Party Computation with Identifiable Abort Y Ishai, R Ostrovsky, V Zikas Advances in Cryptology–CRYPTO 2014, 369-386, 2014 | 128 | 2014 |
| Ouroboros crypsinous: Privacy-preserving proof-of-stake T Kerber, A Kiayias, M Kohlweiss, V Zikas 2019 IEEE Symposium on Security and Privacy (SP), 157-174, 2019 | 118 | 2019 |
| Rational protocol design: Cryptography against incentive-driven adversaries J Garay, J Katz, U Maurer, B Tackmann, V Zikas 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 648-657, 2013 | 114 | 2013 |
| But why does it work? A rational protocol design treatment of bitcoin C Badertscher, J Garay, U Maurer, D Tschudi, V Zikas Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 98 | 2018 |
| Adaptively secure broadcast M Hirt, V Zikas Advances in Cryptology–EUROCRYPT 2010, 466-485, 2010 | 75 | 2010 |
| Byzantine agreement with a rational adversary A Groce, J Katz, A Thiruvengadam, V Zikas Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 73 | 2012 |
| Constant-round asynchronous multi-party computation based on one-way functions S Coretti, J Garay, M Hirt, V Zikas International Conference on the Theory and Application of Cryptology and …, 2016 | 49 | 2016 |
| Efficient three-party computation from cut-and-choose SG Choi, J Katz, AJ Malozemoff, V Zikas Advances in Cryptology–CRYPTO 2014, 513-530, 2014 | 45 | 2014 |
| Efficient MPC via program analysis: A framework for efficient optimal mixing M Ishaq, AL Milanova, V Zikas Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 40 | 2019 |
| Probabilistic termination and composability of cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016 | 40 | 2016 |
| MPC vs. SFE: Unconditional and computational security M Hirt, U Maurer, V Zikas Advances in Cryptology-ASIACRYPT 2008, 1-18, 2008 | 39 | 2008 |
| Universal composition with global subroutines: Capturing global setup within plain UC C Badertscher, R Canetti, J Hesse, B Tackmann, V Zikas Theory of Cryptography Conference, 1-30, 2020 | 38 | 2020 |
| Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting J Alwen, R Ostrovsky, HS Zhou, V Zikas Advances in Cryptology--CRYPTO 2015, 763-780, 2015 | 38 | 2015 |
| Fairmm: A fast and frontrunning-resistant crypto market-maker M Ciampi, M Ishaq, M Magdon-Ismail, R Ostrovsky, V Zikas International Symposium on Cyber Security, Cryptology, and Machine Learning …, 2022 | 37 | 2022 |
| The price of low communication in secure multi-party computation J Garay, Y Ishai, R Ostrovsky, V Zikas Annual International Cryptology Conference, 420-446, 2017 | 35 | 2017 |
| The hidden graph model: Communication locality and optimal resiliency with adaptive faults N Chandran, W Chongchitmate, JA Garay, S Goldwasser, R Ostrovsky, ... Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 35 | 2015 |
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringVerified email at TAMU.EDU
