Cryptocurrencies without proof of work I Bentov, A Gabizon, A Mizrahi International Conference on Financial Cryptography and Data Security, 142-157, 2016 | 224 | 2016 |

Narratives of human plight: A conversation with Jerome Bruner J Bruner Stories matter, 17-23, 2004 | 158* | 2004 |

Deterministic extractors for bit-fixing sources by obtaining an independent seed A Gabizon, R Raz, R Shaltiel SIAM Journal on Computing 36 (4), 1072-1094, 2006 | 102 | 2006 |

Deterministic extractors for affine sources over large fields A Gabizon, R Raz Combinatorica 28 (4), 415-440, 2008 | 95 | 2008 |

Extractors and rank extractors for polynomial sources Z Dvir, A Gabizon, A Wigderson Computational Complexity 18 (1), 1-58, 2009 | 57 | 2009 |

Computational integrity with a public random string from quasi-linear PCPs E Ben-Sasson, I Bentov, A Chiesa, A Gabizon, D Genkin, M Hamilis, ... Annual International Conference on the Theory and Applications of …, 2017 | 50 | 2017 |

A multi-party protocol for constructing the public parameters of the pinocchio zk-snark S Bowe, A Gabizon, MD Green International Conference on Financial Cryptography and Data Security, 64-77, 2018 | 49 | 2018 |

Non-interactive secure multiparty computation A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ... Annual Cryptology Conference, 387-404, 2014 | 46 | 2014 |

Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model. S Bowe, A Gabizon, I Miers IACR Cryptology ePrint Archive 2017, 1050, 2017 | 34 | 2017 |

Subspace polynomials and cyclic subspace codes E Ben-Sasson, T Etzion, A Gabizon, N Raviv IEEE Transactions on Information Theory 62 (3), 1157-1165, 2016 | 34 | 2016 |

Quasi-linear size zero knowledge from linear-algebraic PCPs E Ben-Sasson, A Chiesa, A Gabizon, M Virza Theory of Cryptography Conference, 33-64, 2016 | 27 | 2016 |

Bitcoin beacon I Bentov, A Gabizon, D Zuckerman arXiv preprint arXiv:1605.04559, 2016 | 22 | 2016 |

Simple affine extractors using dimension expansion M DeVos, A Gabizon 2010 IEEE 25th Annual Conference on Computational Complexity, 50-57, 2010 | 19 | 2010 |

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. E Ben-Sasson, A Chiesa, A Gabizon, M Riabzev, N Spooner Electronic Colloquium on Computational Complexity (ECCC) 23, 46, 2016 | 18 | 2016 |

Interactive oracle proofs with constant rate and query complexity E Ben-Sasson, A Chiesa, A Gabizon, M Riabzev, N Spooner 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 17 | 2017 |

Fast algorithms for parameterized problems with relaxed disjointness constraints A Gabizon, D Lokshtanov, M Pilipczuk Algorithms-ESA 2015, 545-556, 2015 | 16 | 2015 |

Increasing the output length of zero-error dispersers A Gabizon Deterministic Extraction from Weak Random Sources, 91-122, 2011 | 14 | 2011 |

Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model. S Bowe, A Gabizon IACR Cryptology ePrint Archive 2018, 187, 2018 | 13 | 2018 |

On probabilistic checking in perfect zero knowledge E Ben-Sasson, A Chiesa, MA Forbes, A Gabizon, M Riabzev, N Spooner arXiv preprint arXiv:1610.03798, 2016 | 13 | 2016 |

On r-simple k-path H Abasi, NH Bshouty, A Gabizon, E Haramaty International Symposium on Mathematical Foundations of Computer Science, 1-12, 2014 | 13 | 2014 |