Beyond Trusted Authorities: Registered Functional Encryption and Access Control

continuing

Funding/hosting acknowledgements: Topic Engineering Secure Systems of the Helmholtz Association (HGF) and supported by KASTEL Security Research Labs, Karlsruhe  ·  NTT Social Informatics Laboratories Japan

Redefining trust in advanced encryption systems: Eliminating centralized key-issuing authorities through decentralized registration-based architectures. (Image generated using Gemini-image-AI)

Modern cryptographic systems increasingly need to support secure computation and fine-grained access control in environments where trust is distributed across many parties. Traditional functional encryption (FE) and attribute-based encryption (ABE) often rely on a central authority that generates and manages users’ secret keys. While powerful, this trust model creates practical challenges: a compromised authority can undermine security, and deploying such systems at scale requires managing sensitive key-generation infrastructure.

Registration-based cryptography (Garg et al., TCC 2018, Hohenberger et al., Eurocrypt 2023) provides a new paradigm that addresses these limitations. In registered FE and registered ABE, users generate their own key pairs and register their public information with a transparent curator or registration mechanism. This removes the need for a fully trusted key-issuing authority while preserving expressive encryption capabilities. Such designs are particularly relevant for modern applications involving cloud computing, decentralized infrastructures, privacy-preserving data sharing, and collaborative computation.

My research explores the foundations and constructions of registered FE/ABE systems, focusing on improving their expressiveness, efficiency, and security guarantees. The project investigates new approaches for building registered encryption systems from modern cryptographic assumptions, including lattice-based assumptions, and studies how registration mechanisms can enable scalable support for complex access policies and computation.

Through these works, my goal is to advance practical and theoretically robust cryptographic frameworks where users can participate in secure computation ecosystems without relying on centralized trust.

The project is running, and the results have appeared at Asiacrypt (Datta et al., 2024), (Pal & Schädlich, 2025), at PKC (Pal & Schädlich, 2026), and a pre-print (Pal et al., 2025).

References

2026

  1. PKC
    Registered Functional Encryption for Attribute-Weighted Sums with Access Control
    Tapas Pal and Robert Schädlich
    In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC), 2026

2025

  1. ASIACRYPT
    A General Framework for Registered Functional Encryption via User-Specific Pre-Constraining
    Tapas Pal and Robert Schädlich
    In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), 2025
  2. ePrint
    Registered Functional Encryption for Pseudorandom Functionalities from Lattices: Registered ABE for Unbounded Depth Circuits and Turing Machines, and More
    Tapas Pal, Robert Schädlich, and Erkan Tairi
    2025

2024

  1. ASIACRYPT
    Registered FE beyond Predicates: (Attribute-Based) Linear Functions and more
    Pratish Datta, Tapas Pal, and Shota Yamada
    In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), 2024