Madars Virza

According to our database1, Madars Virza authored at least 22 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Hamilton: A High-Performance Transaction Processor for Central Bank Digital Currencies.
Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

2022
A High Performance Payment Processing System Designed for Central Bank Digital Currencies.
IACR Cryptol. ePrint Arch., 2022

2019
Cryptanalysis of Curl-P and Other Attacks on the IOTA Cryptocurrency.
IACR Cryptol. ePrint Arch., 2019

2018
zkLedger: Privacy-Preserving Auditing for Distributed Ledgers.
IACR Cryptol. ePrint Arch., 2018

Aurora: Transparent Succinct Arguments for R1CS.
IACR Cryptol. ePrint Arch., 2018

Interventions over Predictions: Reframing the Ethical Debate for Actuarial Risk Assessment.
Proceedings of the Conference on Fairness, Accountability and Transparency, 2018

2017
On deploying succinct zero-knowledge proofs.
PhD thesis, 2017

Scalable Zero Knowledge Via Cycles of Elliptic Curves.
Algorithmica, 2017

2016
Computational integrity with a public random string from quasi-linear PCPs.
IACR Cryptol. ePrint Arch., 2016

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs.
Electron. Colloquium Comput. Complex., 2016

2015
Cluster Computing in Zero Knowledge.
IACR Cryptol. ePrint Arch., 2015

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

2014
Zerocash: Decentralized Anonymous Payments from Bitcoin.
IACR Cryptol. ePrint Arch., 2014

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture.
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

2013
On symmetric nonlocal games.
Theor. Comput. Sci., 2013

Succinct Non-Interactive Arguments for a von Neumann Architecture.
IACR Cryptol. ePrint Arch., 2013

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge.
IACR Cryptol. ePrint Arch., 2013

Worst Case Analysis of Non-local Games.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012
Advantage of Quantum Strategies in Random Symmetric XOR Games.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Quantum Strategies Are Better Than Classical in Almost Any XOR Game.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Sensitivity versus block sensitivity of Boolean functions.
Inf. Process. Lett., 2011

Quantum strategies are better than classical in almost any XOR game
CoRR, 2011


  Loading...