Designated Attribute Proofs with the Camenish-Lysyanskaya Signature

Contains fulltext : 117384.pdf (preprint version ) (Open Access)34th WIC Symposium on Information Theory in the Benelux and The 3rd Joint WIC/IEEE Symposium on Information Theory and Signal Processing in the Benelux, May 30-31, IMEC, Leuven, Belgiu

Self-blindable credentials with revocation

Master Computing Science and Master Mathematics Thesis: http://scripties.fwn.eldoc.ub.rug.nl/scripties/Wiskunde/Masters/2011/Lueks.W./ The use of digital credentials is nowadays common-practice. However, the awareness of the privacy risk associated with their use has caused anonymous credentials to gain popularity over the last decade. Batina et al. showed that the self-blindable credentials from Verheul, which are intrinsically anonymous, can be efficiently implemented on smart cards. Unfortunately, the revocation of these self-blindability credentials is complicated. In this thesis we examine some existing revocation schemes and propose a new self-blindable credential scheme that uses fast revocation. We define a formal model for the anonymity and unforgeability of such a credential scheme and prove the security of our scheme in this model. Furthermore, we show that the existing self-blindable credential protocols with revocation are not anonymous.

Indexing compressed text

We study a method by Ferragina and Manzini for creating an index of a text. This index allows us to find any string in the original text. What is so special about this index is that it is smaller than the original text, while still allowingquick searching and recovery of the original text. In order to understand the performance bounds given by Ferragina and Manzini we first examine the concept of information density, the entropy. Next we examine the details of the method suggested by Ferragina and Manzini. Finally we design an extension to their method. Using this method we are not only able to search for any specific string in the text, but also for some more generalized descriptions of pieces of text. More precisely we can find all matches for a given regular expression. Using this we are able to find answers to the question like ‘give all quoted piece of text’.

Security and Privacy via Cryptography Having your cake and eating it too

Contains fulltext : 176475.pdf (publisher's version ) (Open Access)Radboud University, 9 oktober 2017Promotor : Jacobs, B.P.F. Co-promotor : Hoepman, J.H.xvi, 219 p

On Linkability and Malleability in Self-blindable Credentials

Contains fulltext : 147332.pdf (preprint version ) (Open Access)13 p