Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: A Framework for Efficient and Composable Oblivious Transfer
Founding Cryptography on Oblivious Transfer
C ∅ C ∅ : A Framework for Building Composable Zero-Knowledge Proofs
Universally composable two-party and multi-party secure computation
Verifiable Oblivious Storage
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Oblivious Dynamic Searchable Encryption via Distributed PIR and ORAM
Protocols for secure computations
Practical Secure Computation Outsourcing: A Survey
Multiparty computation from somewhat homomorphic encryption
Software protection and simulation on oblivious RAMs
Secure Multiparty Computation and Secret Sharing
Zero-knowledge from secure multiparty computation
Publicly Auditable Secure Multi-Party Computation
S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing
Asymptotically tight bounds for composing ORAM with PIR
Airtnt: Fair Exchange Payment for Outsourced Secure Enclave Computations
Multiparty Computation from Threshold Homomorphic Encryption
A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols
Computing Blindfolded: New Developments in Fully Homomorphic Encryption
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound
A Formal Theory of Inductive Inference . Part II
A Classification-Based Perspective on GAN Distributions
CFLRU: a replacement algorithm for flash memory
Exploring the Roles of Information in the Manual Control of Vehicular Locomotion: From Kinematics and Dynamics to Cybernetics
how to play any mental game or a completeness theorem for protocols with honest majority .