Folgen
Vassilis Zikas
Titel
Zitiert von
Zitiert von
Jahr
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
2452018
Bitcoin as a transaction ledger: A composable treatment
C Badertscher, U Maurer, D Tschudi, V Zikas
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
2062017
Universally composable synchronous computation
J Katz, U Maurer, B Tackmann, V Zikas
Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013
1772013
Fair and robust multi-party computation using a global transaction ledger
A Kiayias, HS Zhou, V Zikas
Cryptology ePrint Archive, Report 2015/574, 2015
1702015
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
952013
Secure Multi-Party Computation with Identifiable Abort
Y Ishai, R Ostrovsky, V Zikas
Advances in Cryptology–CRYPTO 2014, 369-386, 2014
922014
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
802019
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
772018
Byzantine agreement with a rational adversary
A Groce, J Katz, A Thiruvengadam, V Zikas
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
642012
Adaptively secure broadcast
M Hirt, V Zikas
Advances in Cryptology–EUROCRYPT 2010, 466-485, 2010
602010
Efficient three-party computation from cut-and-choose
SG Choi, J Katz, AJ Malozemoff, V Zikas
Advances in Cryptology–CRYPTO 2014, 513-530, 2014
382014
Constant-round asynchronous multi-party computation based on one-way functions
S Coretti, J Garay, M Hirt, V Zikas
Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the …, 2016
372016
MPC vs. SFE: Unconditional and computational security
M Hirt, U Maurer, V Zikas
Advances in Cryptology-ASIACRYPT 2008, 1-18, 2008
342008
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
332016
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
312015
Incoercible multi-party computation and universally composable receipt-free voting
J Alwen, R Ostrovsky, HS Zhou, V Zikas
Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015
312015
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
302019
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
302015
MPC vs. SFE: Perfect security in a unified corruption model
Z Beerliová-Trubíniová, M Fitzi, M Hirt, U Maurer, V Zikas
Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008
302008
Collusion-preserving computation
J Alwen, J Katz, U Maurer, V Zikas
Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa …, 2012
292012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20