Matan Hamilis
Artificial Intelligence · 2017
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 28 citations into it
- Computational Theory and Mathematics — 19 citations into it
Whom Matan Hamilis trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Matan Hamilis's perspective
Ordered by how strongly the researchers Matan Hamilis trusts endorse each paper. Same corpus, a different order for every researcher.
- Checking computations in polylogarithmic time
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- Making argument systems for outsourced computation practical (sometimes)
- Pinocchio: Nearly Practical Verifiable Computation
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
Their papers
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017) — 74 citations