On Emulating Interactive Proofs with Public Coins. - Oded Goldreich 001; Maya Leshkowitz (Electron. Colloquium Comput. Complex., 2016)

Round Complexity Versus Randomness Complexity in Interactive Proofs. - Maya Leshkowitz (Electron. Colloquium Comput. Complex., 2017)

A Fair Consensus Protocol for Transaction Ordering. - Avi Asayag; Gad Cohen; Ido Grayevsky; Maya Leshkowitz; Ori Rottenstreich; Ronen Tamari; David Yakira (ICNP, 2018)

Helix: A Scalable and Fair Consensus Algorithm Resistant to Ordering Manipulation. - Avi Asayag; Gad Cohen; Ido Grayevsky; Maya Leshkowitz; Ori Rottenstreich; Ronen Tamari; David Yakira (IACR Cryptol. ePrint Arch., 2018)

Scalable Block Execution via Parallel Validation. - Maya Leshkowitz; Olivia Benattasse; Oded Wertheim; Ori Rottenstreich (IEEE ICBC, 2020)

On Emulating Interactive Proofs with Public Coins. - Oded Goldreich 001; Maya Leshkowitz (Computational Complexity and Property Testing, 2020)

Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation. - David Yakira; Avi Asayag; Gad Cohen; Ido Grayevsky; Maya Leshkowitz; Ori Rottenstreich; Ronen Tamari (IEEE Trans. Netw. Serv. Manag., 2021)

Scalable blockchain execution via parallel block validation. - Maya Leshkowitz; Olivia Benattasse; Oded Wertheim; Ori Rottenstreich (Ann. des Télécommunications, 2022)