Javascript must be enabled for the correct page display

Implementing U-prove extension protocols in Magma

Linschoten, ML van (2014) Implementing U-prove extension protocols in Magma. Master's Thesis / Essay, Mathematics.

Marjolein_van_Linschoten_WM_2014.pdf - Published Version

Download (1MB) | Preview
[img] Text
LinschotenAkkoordTop.pdf - Other
Restricted to Registered users only

Download (40kB)


Implementing pairings seems easier than it actually is. The aim of this research was to implement the extension protocols of U-prove, designed by Erik Weitenberg, which contain a pairing. The ambition was to find out how difficult it is to implement a pairing. Another reason was to determine whether the extension protocols are applicable and not only work on paper. The implementations are executed in Magma. To understand how Magma works basic protocols are implemented. The theory needed for the implementations is explained. Both extension protocols are successfully implemented with the suitable example that is found. The obstacles that need to be overcome, for this single example, show the difficulty of implementing a pairing.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:56
Last Modified: 15 Feb 2018 07:56

Actions (login required)

View Item View Item