research
∙
02/24/2023
Maximizing Miner Revenue in Transaction Fee Mechanism Design
Transaction fee mechanism design is a new decentralized mechanism design...
share
research
∙
01/31/2023
XCRYPT: Accelerating Lattice Based Cryptography with Memristor Crossbar Arrays
This paper makes a case for accelerating lattice-based post quantum cryp...
research
∙
12/10/2022
Adore: Differentially Oblivious Relational Database Operators
There has been a recent effort in applying differential privacy on memor...
research
∙
10/18/2022
STAMP: Lightweight TEE-Assisted MPC for Efficient Privacy-Preserving Machine Learning
In this paper, we propose STAMP, an end-to-end 3-party MPC protocol for ...
research
∙
09/28/2022
What Can Cryptography Do For Decentralized Mechanism Design
Recent works of Roughgarden (EC'21) and Chung and Shi (SODA'23) initiate...
research
∙
12/07/2021
Locally Differentially Private Sparse Vector Aggregation
Vector mean estimation is a central primitive in federated analytics. In...
research
∙
11/04/2021
Foundations of Transaction Fee Mechanism Design
In blockchains such as Bitcoin and Ethereum, users compete in a transact...
research
∙
06/01/2021
Differentially Private Densest Subgraph
Given a graph, the densest subgraph problem asks for a set of vertices s...
research
∙
03/14/2021
Selfish Mining Attacks Exacerbated by Elastic Hash Supply
Several attacks have been proposed against Proof-of-Work blockchains, wh...
research
∙
02/23/2021
Optimal Sorting Circuits for Short Keys
A long-standing open question in the algorithms and complexity literatur...
research
∙
10/15/2020
Sorting Short Keys in Circuits of Size o(n log n)
We consider the classical problem of sorting an input array containing n...
research
∙
08/04/2020
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
We propose a conceptually simple oblivious sort and oblivious random per...
research
∙
08/01/2020
Data Oblivious Algorithms for Multicores
As secure processors such as Intel SGX (with hyperthreading) become wide...
research
∙
02/26/2020
Improved Extension Protocols for Byzantine Broadcast and Agreement
Byzantine broadcast (BB) and Byzantine agreement (BA) are two most funda...
research
∙
10/27/2019
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
We revisit the problem of low-memory robust simulation of interactive pr...
research
∙
11/04/2018
Lower Bounds for External Memory Integer Sorting via Network Coding
Sorting extremely large datasets is a frequently occuring task in practi...
research
∙
09/04/2018
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
The problem of Oblivious RAM (ORAM) has traditionally been studied in a ...
research
∙
05/09/2018
