You are now leaving the website that is under the control and management of DARPA. The appearance of hyperlinks does not constitute endorsement by DARPA of non-U.S. Government sites or the information, products, or services contained therein. Although DARPA may or may not use these sites as additional distribution channels for Department of Defense information, it does not exercise editorial control over all of the information that you may find at these locations. Such links are provided consistent with the stated purpose of this website.

After reading this message, click to continue immediately.

Go Back

/ Information Innovation Office (I2O)

PROgramming Computation on EncryptEd Data (PROCEED)

DARPA's Programming Computation on Encrypted Data (PROCEED) program is a research effort that seeks to develop methods that allow computing with encrypted data without first decrypting that data, making it possible to compute more securely in untrusted environments.

Program Complete

The content below has been generated by organizations that are partially funded by DARPA; the views and conclusions contained therein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA or the U.S. Government.

Report a problem:

Last updated: November 13, 2015

MIT Functional Encryption for Inner Product Predicates from Learning with Errors
University of Virginia Computing on Authenticated Data
Stanford University A Domain-Specific Language for Computing on Encrypted Data
UCLA Deterministic and Energy-Optimal Wireless Synchronization
University of Texas Standard Security Does Not Imply Security Against Selective-Opening
University of Texas Identity-Based (Lossy) Trapdoor Functions and Applications
MIT Program Obfuscation with Leaky Hardware
Stanford University Random Oracles in a Quantum World
Stanford University Homomorphic Signatures for Polynomial Functions
Stanford University Targeted Malleability: Homomorphic Encryption for Restricted Computations
MIT On Sum Coloring and Sum Multi-coloring for Restricted Families of Graphs
MIT Multiparty Computation Secure Against Continual Memory Leakage
MIT Leakage-Resilient Coin Tossing
MIT Fully Homomorphic Encryption without Bootstrapping
Stanford University Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
UCLA Position-Based Quantum Cryptography: Impossibility and Constructions
UCLA Simultaneously Resettable Arguments of Knowledge
University of Virginia The Randomness Complexity of Parallel Repetition
University of Virginia The Knowledge Tightness of Parallel Zero-Knowledge
BBN SIPHER: Scalable Implementation of Primitives for Homomorphic EncRyption - FPGA implementation using Simulink
BBN An Update on Scalable Implementation of Primitives for Homomorphic EncRyption - FPGA implementation using Simulink
UCLA Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
UCLA Leakage-Resilient Zero Knowledge
UCLA Resettable Statistical Zero Knowledge
UCLA Round Optimal Blind Signatures
UCLA Efficient and Explicit Coding for Interactive Communication
IBM Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
IBM FHE with Polylog Overhead
IBM Better Bootstrapping in Fully Homomorphic Encryption
IBM Ring Switching in BGV-Style Homomorphic Encryption
IBM Homomorphic Evaluation of the AES circuit
MIT Bounded-Collusion IBE from Key Homomorphism
University of Virginia Outsourcing the Decryption of ABE Ciphertexts
UCLA Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
UCLA Public Key Locally Decodable Codes with Short Keys
University of Virginia Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
UCLA Constant-Rate Oblivious Transfer from Noisy Channels
UCLA Efficient Non-interactive Secure Computation
UCLA Identifying Cheaters Without an Honest Majority
UCLA Cryptography with Tamperable and Leaky Memory
UCLA On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme
Stanford University Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Georgia Tech Memory-Efficient Garbled Circuit Generation for Mobile Devices
BBN Bi-Deniable Public-Key Encryption
MIT How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption
MIT Computing Blindfolded: New Developments in Fully Homomorphic Encryption
University of Texas Dual Form Signatures: An Approach for Proving Security from Static Assumptions
University of Texas Functional Encryption for Regular Languages
UCLA Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption
University of Texas New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
UCI Fully Homomorphic Encryption for Mathematicians
UCLA Approximating Large Frequency Moments with Pick-and-Drop Sampling
UCLA Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams
UCLA On Linear-Size Pseudorandom Generators and Hardcore Functions
UCLA Cryptography Using Captcha Puzzles
UCLA Concurrent Zero Knowledge in the Bounded Player Model
UCLA Succinct Non-interactive Arguments via Linear Interactive Proofs
UCLA Revisiting Lower and Upper Bounds for Selective Decommitments
UCLA New Techniques for Noninteractive Zero-Knowledge
UCLA The Effectiveness of Lloyd-type Methods for the k-Means Problem
UCLA Impossibility Results for Static Input Secure Computation
UCLA Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
UCLA Unconditionally-Secure Robust Secret Sharing with Compact Shares
UCLA Constructing Non-malleable Commitments: A Black-Box Approach
UCLA Nearly Simultaneously Resettable Black-Box Zero Knowledge
UCLA Edge Fault Tolerance on Sparse Networks
UCLA Multiparty Proximity Testing with Dishonest Majority from Equality Testing
Bristol Multiparty computation from somewhat homomorphic encryption
Bristol Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
Stanford University Classical Hardness of Learning with Errors
BBN A Toolkit for Ring-LWE Cryptography
BBN How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
University of Virginia Zerocoin: Anonymous Distributed e-Cash from Bitcoin
University of Virginia Machine-Generated Algorithms, Proofs and Software for the Batch Verification of Digital Signature Schemes
University of Virginia Vis-a-Vis Cryptography: Private and Trustworthy In-Person Certifications
Stanford University An Equational Approach to Secure Multi-Party Computation
Cybernetica AES block cipher implementation and secure database join on the Sharemind secure multi-party computation framework
University of Virginia Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
University of Virginia On the Power of Many 1-Bit Provers
University of Virginia On The Power of Non-uniform Proofs of Security
University of Virginia UC from OT
University of Virginia Blackbox Construction of Composable Protocols
University of Virginia The Curious Case of Non-interactive Commitments
University of Virginia Billion-gate Secure Two-party Computation
University of Virginia Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security
Stanford University When Homomorphism Becomes a Liability
Stanford University Quantum-secure Message Authentication Codes
IBM Dynamic Proofs of Retrievability via Oblivous RAM
UCLA How to Catch L 2-Heavy-Hitters on Sliding Windows
UCLA Optimal Coding for Streaming Authentication and Interactive Communication
UCLA Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
UCLA How Hard Is Counting Triangles in the Streaming Model?
UCLA Local Correctability of Expander Codes
UCLA Robust Pseudorandom Generators
BBN Practical Bootstrapping with Polylogarithmic Overhead
Stanford University Hardness of SIS and LWE with Small Parameters
BBN Accelerating Computations on Encrypted Data with an FPGA
Cybernetica From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting
Yale University Structural Cloud Audits that Protect Private Information
Georgia Tech Secure Outsourced Garbled Circuit Evaluation for Mobile Devices
University of Virginia PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation
Georgia Tech For Your Phone Only: Custom Protocols for Efficient Secure Function Evaluation on Mobile Devices
UCLA Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
UCLA Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
UCLA Zero Knowledge LTCs and Their Applications
UCLA Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
UCLA Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
MIT Secure Computation Against Adaptive Auxiliary Information
IBM Attribute-Based Encryption for Circuits from Multilinear Maps
University of Virginia Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
IBM Witness encryption and its applications
Bristol Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits
Bristol Estimating Key Sizes For High Dimensional Lattice Based Systems
Bristol Between a Rock and a Hard Place: Interpolating Between MPC and FHE
University of Virginia GPU and CPU Parallelization of Honest-but-Curious Secure Two Party Computation
University of Virginia Using SMT Solvers to Automate Design Tasks for Encryption and Signature Schemes
University of Virginia Fast Two-Party Secure Computation with Minimal Assumptions
University of Virginia Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
University of Virginia Knowledge-Preserving Interactive Coding
University of Virginia Constant-round Concurrent Zero-knowledge from P-Certificates
University of Virginia From Unprovability to Environmentally Friendly Protocols
University of Virginia Simultaneous Resettability From One-way Functions
University of Texas Constrained Pseudorandom Functions and Their Applications
University of Texas New Constructions and Proof Methods for Large Universe Attribute-Based Encryption
University of Texas Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
University of Texas Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
MIT Attribute-Based Encryption for Circuits
MIT Reusable Garbled Circuits and Succinct Functional Encryption
MIT Overcoming the Worst-Case Curse for Cryptographic Constructions
MIT Functional Encryption: New Perspectives and Lower Bounds