-
The Art of Covert Communications
How a ciphertext can secretly carry a second message that even a key-holding "dictator" cannot detect — the intuition behind multi-message anamorphic encryption and signatures.
-
Computing on Encrypted Data Without a Central Authority
How registered functional encryption lets users learn a function of encrypted data with no trusted key authority — and a general framework that builds it from pairings via "user-specific pre-constraining."
-
Registration Model for Functional Encryption: Linear Functions with Access Control
How to evaluate linear functions on encrypted data — with optional attribute-based access control — and no trusted key authority. A four-attempt build-up to registered (AB-)IPFE from pairings.
-
Computing on Unbounded Data with Attributes spanning Multiple Authorities
Evaluating linear functions on encrypted data when the attributes that gate access are issued by many independent authorities — with no preset bound on vectors, attributes, or authorities, in fast prime-order groups.
-
Linear Computations with Predicates Hiding Attributes
Evaluating weighted statistics on encrypted medical records — gated by a hidden policy, with no preset bound on data or attribute size. The ideas behind unbounded, attribute-hiding predicate IPFE from pairings.