Skip to main content

and
  1. 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...

    Melissa Chase, Esha Ghosh, Oxana Poburinnaya in Advances in Cryptology – ASIACRYPT 2020 (2020)

  2. No Access

    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...

    Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko in Security and Cryptography for Networks (2016)

  3. 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...

    Esha Ghosh, Olga Ohrimenko, Roberto Tamassia in Applied Cryptography and Network Security (2015)