Michael Riabzev

According to our database1, Michael Riabzev authored at least 14 papers between 2016 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Cairo - a Turing-complete STARK-friendly CPU architecture.
IACR Cryptol. ePrint Arch., 2021

2019
Computation Verification for Noobs.
PhD thesis, 2019

Linear-Size Constant-Query IOPs for Delegating Computation.
IACR Cryptol. ePrint Arch., 2019

Scalable Zero Knowledge with No Trusted Setup.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

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

Scalable, transparent, and post-quantum secure computational integrity.
IACR Cryptol. ePrint Arch., 2018

2017
Fast Reed-Solomon Interactive Oracle Proofs of Proximity.
Electron. Colloquium Comput. Complex., 2017

Zero Knowledge Protocols from Succinct Constraint Detection.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Interactive Oracle Proofs with Constant Rate and Query Complexity.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

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

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.
Electron. Colloquium Comput. Complex., 2016

On Probabilistic Checking in Perfect Zero Knowledge.
Electron. Colloquium Comput. Complex., 2016

A security analysis of Probabilistically Checkable Proofs.
Electron. Colloquium Comput. Complex., 2016

Improved concrete efficiency and security analysis of Reed-Solomon PCPPs.
Electron. Colloquium Comput. Complex., 2016


  Loading...