Skip to main content

and
  1. Chapter and Conference Paper

    Verifiable and Private Oblivious Polynomial Evaluation

    It is a challenging problem to delegate the computation of a polynomial on encrypted data to a server in an oblivious and verifiable way. In this paper, we formally define Verifiable and Private Oblivious Polyno...

    Hardik Gajera, Matthieu Giraud, David Gérault in Information Security Theory and Practice (2020)

  2. No Access

    Chapter and Conference Paper

    Secure and Efficient Matrix Multiplication with MapReduce

    MapReduce is one of the most popular distributed programming paradigms that allows processing big data sets in parallel on a cluster. MapReduce users often outsource data and computations to a public cloud, wh...

    Radu Ciucanu, Matthieu Giraud, Pascal Lafourcade in E-Business and Telecommunications (2020)

  3. No Access

    Chapter and Conference Paper

    No Such Thing as a Small Leak: Leakage-Abuse Attacks Against Symmetric Searchable Encryption

    Symmetric Searchable Encryption ( \(\mathrm {SSE}\) ) schemes enable clients to securely outsource their data while maintaining t...

    Alexandre Anzala-Yamajako, Olivier Bernard in E-Business and Telecommunications (2019)

  4. No Access

    Chapter and Conference Paper

    Verifiable Private Polynomial Evaluation

    Delegating the computation of a polynomial to a server in a verifiable way is challenging. An even more challenging problem is ensuring that this polynomial remains hidden to clients who are able to query such...

    Xavier Bultel, Manik Lal Das, Hardik Gajera, David Gérault in Provable Security (2017)