![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Secret-Shared Shuffle
Generating additive secret shares of a shuffled dataset - such that neither party knows the order in which it is permuted - is a fundamental building block in many protocols, such as secure collaborative filterin...
-
Chapter and Conference Paper
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
We propose a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving (zero-knowledge) queries. We give efficient constructions supporting this model for order...
-
Chapter and Conference Paper
Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
An order query takes as input a set of elements from a list (ordered sequence) \(\mathcal {L}\) , and asks for this se...