Madars Virza

Madars Virza

About me

I'm a graduate student in computer science at MIT CSAIL, working with Professor Ronald L. Rivest and supported by NSF Center for Science of Information. I obtained my B.Sc. degree from University of Latvia, where I was fortunate to be advised by Professor Andris Ambainis.


The best way to contact me is via email: ; my CSAIL office is 32-G580 (Stata Center, Gates Tower). My calendar is also available.

Publications (also on DBLP and Google Scholar )

E. Ben-Sasson, A. Chiesa, A. Gabizon, M. Virza Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs // In proceedings of 13th IACR Theory of Cryptography Conference (TCC 2016-A) [ePrint] [ECCC] [doi]

E. Ben-Sasson, A. Chiesa, M. Green, E. Tromer, M.Virza Secure sampling of public parameters for succinct zero knowledge proofs // In proceedings of the IEEE Symposium on Security & Privacy (Oakland) 2015 [doi]

A. Chiesa, E. Tromer and M. Virza. Cluster computing in zero knowledge // In proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2015) [ePrint] [doi]

E. Ben-Sasson, A. Chiesa, E. Tromer and M. Virza. Scalable Zero Knowledge via Cycles of Elliptic Curves // In proceedings of the 34th International Cryptology Conference (CRYPTO 2014) [ePrint] [doi]

E. Ben-Sasson, A. Chiesa, E. Tromer and M. Virza. Succinct Non-Interactive Arguments for a von Neumann Architecture // In proceedings of the 23rd USENIX Security Symposium (USENIX Security 2014) [ePrint] [conference version]

E. Ben-Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer and M. Virza. Zerocash: Decentralized Anonymous Payments from Bitcoin // In proceedings of the IEEE Symposium on Security & Privacy (Oakland) 2014 [ePrint]

E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer and M. Virza. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge // In proceedings of the 33rd International Cryptology Conference (CRYPTO 2013) [ePrint] [doi] [talk @ YouTube/TheIACR]

A. Ambainis, D. Kravchenko, N. Nahimov, A. Rivosh and M. Virza. On symmetric nonlocal games // Theoretical Computer Science 494 (2013), pp. 36–48. [doi]

A. Ambainis, A. Bačkurs, K. Balodis, A. Škuškovniks, J. Smotrovs and M. Virza. Worst case analysis of non-local games // In proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013) [arXiv] [doi]

A. Ambainis, J. Iraids, D. Kravchenko and M. Virza. Advantage of Quantum Strategies in Random Symmetric XOR Games // In proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods (MEMICS 2012) [doi]

A. Ambainis, A. Bačkurs, K. Balodis, D. Kravchenko, R. Ozols, J. Smotrovs and M. Virza. Quantum strategies are better than classical in almost any XOR game // In proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012); earlier version presented at QIP 2012 poster session [arXiv] [doi]

M. Virza. Sensitivity versus block sensitivity of Boolean functions // Information Processing Letters 111, 9 (2011), pp. 433–435. [arXiv] [doi]


E. Ben-Sasson, I. Bentov, A. Chiesa, A. Gabizon, D. Genkin, M. Hamilis, E.Pergament, M. Riabzev, M. Silberstein, E. Tromer and M. Virza Computational integrity with a public random string from quasi-linear PCPs [ePrint]

Other works

I. Ivan, M. Virza and H. Yuen. Algebraic Algorithms for Matching // Final project in MIT's 6.854 (Advanced Algorithms) [pdf]

M. Virza. Dažu kvantu spēļu analīze (Analysis of certain quantum games) // B.Sc. thesis, University of Latvia, Department of Computer Science, June 2011 [thesis] [slides] (both in Latvian)

M. Virza. Galuā lauku realizācija, izmantojot vispārējās programmēšanas paradigmu (Generic programming implementation of Galois fields) // Term project at University of Latvia [pdf] (in Latvian)

In popular press

“Detecting program-tampering in the cloud”: A new version of ‘zero-knowledge proofs’ allows cloud customers to verify the proper execution of their software with a single packet of data. [MIT News Office]

“EECS graduate students Alessandro Chiesa, Madars Virza devise new system to detect program tampering in the cloud” [MIT EECS News]


Q: How do you pronounce your name?
A: Madars is pronounced as MA-dars with stress on the first syllable and each “a” as in “drama”. However, most Americans find it easier to pronounce it as ma-DARS with stress on the second syllable and the second “a” like in “hard”, which I don't mind and actually like. My surname is pronounced as veehr-za with rolled “r” and “za” as in “plaza” but I prefer to be called by my first name.