Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Universal accumulators with efficient nonmembership proofs
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Zero-knowledge from secure multiparty computation
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
Universally composable two-party and multi-party secure computation
Efficient dynamic provable possession of remote data via balanced update trees
Proofs of retrievability: theory and implementation
A Language-Independent Proof System for Mutual Program Equivalence
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge
VerSum: Verifiable Computations over Large Public Logs
ZKBoo: Faster Zero-Knowledge for Boolean Circuits
Non-interactive zero-knowledge arguments for voting
An Alternative Proof of The Schwartz-Zippel Lemma.
Non-interactive verifiable computing: Outsourcing computation to untrusted workers
Bounded-concurrent secure multi-party computation with a dishonest majority
Zero knowledge in the random oracle model, revisited
Provable data possession at untrusted stores
Multi party computations: past and present
efficient zero knowledge proofs of knowledge for homomorphisms .
Faster Secure Two-Party Computation Using Garbled Circuits
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
agile outsourcing projects : structure and management .
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Design of a new counter-balancing stackable mechanism
Implementation of real time moving object detection and tracking on FPGA for video surveillance applications
Adversarial Learning of Portable Student Networks