| 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 | 207 | 2018 |
| Bitcoin as a transaction ledger: A composable treatment C Badertscher, U Maurer, D Tschudi, V Zikas Annual international cryptology conference, 324-356, 2017 | 185 | 2017 |
| Universally composable synchronous computation J Katz, U Maurer, B Tackmann, V Zikas Theory of Cryptography Conference, 477-498, 2013 | 156 | 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 | 152 | 2015 |
| 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 | 86 | 2013 |
| Secure Multi-Party Computation with Identifiable Abort Y Ishai, R Ostrovsky, V Zikas Advances in Cryptology–CRYPTO 2014, 369-386, 2014 | 79 | 2014 |
| But why does it work? A rational protocol design treatment of bitcoin C Badertscher, J Garay, U Maurer, D Tschudi, V Zikas Annual international conference on the theory and applications of …, 2018 | 68 | 2018 |
| 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 | 66 | 2019 |
| Byzantine agreement with a rational adversary A Groce, J Katz, A Thiruvengadam, V Zikas International Colloquium on Automata, Languages, and Programming, 561-572, 2012 | 60 | 2012 |
| Adaptively secure broadcast M Hirt, V Zikas Advances in Cryptology–EUROCRYPT 2010, 466-485, 2010 | 56 | 2010 |
| Probabilistic termination and composability of cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Journal of Cryptology 32 (3), 690-741, 2019 | 39 | 2019 |
| Efficient three-party computation from cut-and-choose SG Choi, J Katz, AJ Malozemoff, V Zikas Advances in Cryptology–CRYPTO 2014, 513-530, 2014 | 36 | 2014 |
| MPC vs. SFE: Unconditional and computational security M Hirt, U Maurer, V Zikas Advances in Cryptology-ASIACRYPT 2008, 1-18, 2008 | 32 | 2008 |
| 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 | 31 | 2016 |
| 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 | 29 | 2015 |
| Collusion-preserving computation J Alwen, J Katz, U Maurer, V Zikas Annual Cryptology Conference, 124-143, 2012 | 29 | 2012 |
| MPC vs. SFE: Perfect security in a unified corruption model Z Beerliova-Trubiniova, M Fitzi, M Hirt, U Maurer, V Zikas Theory of Cryptography Conference, 231-250, 2008 | 29 | 2008 |
| Incoercible multi-party computation and universally composable receipt-free voting J Alwen, R Ostrovsky, HS Zhou, V Zikas Annual Cryptology Conference, 763-780, 2015 | 28 | 2015 |
| 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 | 28 | 2015 |
| Feasibility and completeness of cryptographic tasks in the quantum world S Fehr, J Katz, F Song, HS Zhou, V Zikas Theory of Cryptography Conference, 281-296, 2013 | 25 | 2013 |
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringVerified email at TAMU.EDU
