Nikhil Panpalia
Artificial Intelligence · 2012
A researcher in the Science corpus: 1 paper; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 18 citations into it
- Computational Theory and Mathematics — 11 citations into it
- Privacy & Security — 6 citations into it
Whom Nikhil Panpalia trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Nikhil Panpalia overall
Papers from Nikhil Panpalia's perspective
Ordered by how strongly the researchers Nikhil Panpalia trusts endorse each paper. Same corpus, a different order for every researcher.
- Fairplay - Secure Two-Party Computation System
- Improved Delegation of Computation using Fully Homomorphic Encryption
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Computationally Sound Proofs
- Probabilistic checking of proofs: a new characterization of NP
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Making argument systems for outsourced computation practical (sometimes)
- Checking computations in polylogarithmic time
- Efficient Arguments without Short PCPs
- Pinocchio: Nearly Practical Verifiable Computation
Their papers
- Taking Proof-Based Verified Computation a Few Steps Closer to Practicality (2012) — 195 citations