Project Overview

Research Goals & Work Packages

Develop efficient and scalable secure computation protocols with silent preprocessing, focusing on building protocols tailored to useful functions and overcoming current barriers in scaling to n-party settings.

  • Silent preprocessing for useful functions (set operations, comparisons)
  • Scaling to n-party setting over small rings
  • Linear computational complexity protocols

Study the feasibility of secure computation through non-interactive protocols, focusing on silent preprocessing and zero-knowledge proofs with better concrete efficiency.

  • Non-interactive silent preprocessing protocols
  • Efficient NIZKs for real-world applications
  • Post-quantum secure constructions

Investigate new paradigms for low-communication secure computation protocols without relying on fully-homomorphic encryption, targeting sublinear communication complexity.

  • n-party computation with sublinear communication
  • Alternatives to FHE-based approaches
  • Breaking the s/log s communication barrier

Team Members

Publications associated to the project

Previous Publications

Publications directly related to OBELiSC posterior to the first draft of the project, but prior to its starting date. The project OBELiSC was drafted in July-October 2022, the official acceptance was announced in September 2023, and OBELiSC started officially a year later, in September 2024. Over the two years between the first draft and the official start of the project, several milestones of OBELiSC were already reached by the PI and its team.