Time and again, attribute-based encryption has been shown to be the natural cryptographic
tool for building various types of conditional access systems with far-reaching applications …

We propose a new way to obfuscate programs, via composite-order multilinear maps. Our
construction operates directly on straight-line programs (arithmetic circuits), rather than …

We propose a new generic framework for achieving fully secure attribute based encryption
(ABE) in prime-order bilinear groups. Previous generic frameworks by Wee (TCC'14) and …

We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman
Assumption. Given some matrix A sampled from some distribution D, the kernel assumption …

Pair encodings and predicate encodings, recently introduced by Attrapadung [2] and Wee
[36] respectively, greatly simplify the process of designing and analyzing predicate and …

Abstract Wee (TCC'14) and Attrapadung (Eurocrypt'14) introduced predicate and pair
encodings, respectively, as a simple way to construct and analyze attribute-based …

We show a framework for constructing identity-based encryption (IBE) schemes that are
(almost) tightly secure in the multi-challenge and multi-instance setting. In particular, we …

We construct an efficient two-level homomorphic public-key encryption in prime-order
bilinear groups. Such a scheme supports polynomially many homomorphic additions and …

The two-volume proceedings LNCS 9056+ 9057 constitutes the proceedings of the 34th
Annual International Conference on the Theory and Applications of Cryptographic …

Black-box accumulation (BBA) has recently been introduced as a building-block for a variety
of user-centric protocols such as loyalty, refund, and incentive systems. Loosely speaking …