Mark Simkin
YOU?
Author Swipe
View article: Foundations of Data Availability Sampling
Foundations of Data Availability Sampling Open
Towards building more scalable blockchains, an approach known as data availability sampling (DAS) has emerged over the past few years. Even large blockchains like Ethereum are planning to eventually deploy DAS to improve their scalability.…
View article: Invertible Bloom Lookup Tables with Less Memory and Randomness
Invertible Bloom Lookup Tables with Less Memory and Randomness Open
In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities. IBLTs are highly versatile data structures that have found applications in set reconciliation protocols, error-correcting codes, and even the de…
View article: Ramen: Souper Fast Three-Party Computation for RAM Programs
Ramen: Souper Fast Three-Party Computation for RAM Programs Open
Secure RAM computation allows a number of parties to evaluate a function represented as a random-access machine (RAM) program in a way that reveals nothing about the private inputs of the parties except from what is already revealed by the…
View article: Invertible Bloom Lookup Tables with Less Memory and Randomness
Invertible Bloom Lookup Tables with Less Memory and Randomness Open
In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities. IBLTs are highly versatile data structures that have found applications in set reconciliation protocols, error-correcting codes, and even the de…
View article: Distributed Shuffling in Adversarial Environments
Distributed Shuffling in Adversarial Environments Open
We study mix-nets in the context of cryptocurrencies. Here we have many computationally weak shufflers that speak one after another and want to joinlty shuffle a list of ciphertexts (c₁, … , c_n). Each shuffler can only permute k << n ciph…
View article: Squirrel
Squirrel Open
The focus of this work are multi-signatures schemes in the synchronized setting. A multi-signature scheme allows multiple signatures for the same message but from independent signers to be compressed into one short aggregated signature, wh…
View article: Multiparty Computation with Covert Security and Public Verifiability
Multiparty Computation with Covert Security and Public Verifiability Open
Multiparty computation protocols (MPC) are said to be secure against covert adversaries if the honest parties are guaranteed to detect any misbehavior by the malicious parties with a constant probability. Protocols that, upon detecting a c…
View article: Optimal Oblivious Priority Queues
Optimal Oblivious Priority Queues Open
In this work, we present the first asymptotically optimal oblivious priority queue, which matches the lower bound of Jacob, Larsen, and Nielsen (SODA'19). Our construction is conceptually simple and statistically secure. We illustrate the …
View article: Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security
Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security Open
Secure multiparty computation (MPC) allows a set of mutually distrustful parties to compute a public function on their private inputs without revealing anything beyond the output of the computation. This paper focuses on the specific case …
View article: Functional Credentials
Functional Credentials Open
A functional credential allows a user to anonymously prove possession of a set of attributes that fulfills a certain policy. The policies are arbitrary polynomially computable predicates that are evaluated over arbitrary attributes. The ke…
View article: How Can Universities Best Encourage Women to Major in Information Systems?
How Can Universities Best Encourage Women to Major in Information Systems? Open
Despite both government and industry initiatives, the under-representation of women in information systems (IS) continues. Can academia help right this imbalance by helping fill the pipeline for technically qualified female employees? We a…