Anonymous Broadcast Encryption [more]
This project focuses on protecting the identities of the recipients in content distribution scenarios. A common cryptographic tool for secure multi-recipient data distribution is broadcast encryption. In the standard setting of broadcast encryption, information about the recipients is transmitted as part of the ciphertext, and is thus readily obtained even by a passive eavesdropper. This project investigates techniques tailored for scenarios where the identities of the users authorized to access the content may be as sensitive as the content itself.
Provable Cryptography from Non-commutative Groups [more]
The goal of this project is to establish a framework to formulate computational problems from combinatorial group-theory that are suitable for cryptographic applications. An essential aspect of this framework is its amenability to the provable security approach. This trait differentiates our work from other proposals of group-theoretic platforms for cryptographic applications. For instance, whereas earlier approaches employed infinite groups without putting forth the necessary protocols for efficient sampling of the underlying distributions, our framework has a solid probabilistic modelling component. A further aim of this project is the investigation of efficient cryptographic primitives and protocols based on the conjectured hardness of the group-theoretic computational problems that arise from our framework.
This project focuses on protecting the identities of the recipients in content distribution scenarios. A common cryptographic tool for secure multi-recipient data distribution is broadcast encryption. In the standard setting of broadcast encryption, information about the recipients is transmitted as part of the ciphertext, and is thus readily obtained even by a passive eavesdropper. This project investigates techniques tailored for scenarios where the identities of the users authorized to access the content may be as sensitive as the content itself.
Provable Cryptography from Non-commutative Groups [more]
The goal of this project is to establish a framework to formulate computational problems from combinatorial group-theory that are suitable for cryptographic applications. An essential aspect of this framework is its amenability to the provable security approach. This trait differentiates our work from other proposals of group-theoretic platforms for cryptographic applications. For instance, whereas earlier approaches employed infinite groups without putting forth the necessary protocols for efficient sampling of the underlying distributions, our framework has a solid probabilistic modelling component. A further aim of this project is the investigation of efficient cryptographic primitives and protocols based on the conjectured hardness of the group-theoretic computational problems that arise from our framework.