Switch branches/tags
Nothing to show
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
..
Failed to load latest commit information.
Lab05Code.py
Lab05Tests.py
README.md

README.md

GA17 Privacy Enhancing Technologies -- Lab 05

Reminder of basic repository operations and testing

To update your local version in the virtual machine, go to the directory called PET-Exercises and type:

$ git pull

To update your version of petlib type:

$ sudo pip install petlib --upgrade

Structure of Labs

The structure of all the labs will be similar: two python files will be provided.

  • The first is named Lab0XCode.py and contains the structure of the code you need to complete.
  • The second is named Lab0XTests.py and contains unit tests (written for the pytest library) that you may execute to partially check your answers.

Note that the tests passing is a necessary but not sufficient condition to fulfill each task. There are programs that would make the tests pass that would still be invalid (or blatantly insecure) implementations.

The only dependency your Python code should have, besides pytest and the standard library, is the petlib library, which we specifically developed for this course (and also for our own use!).

The petlib documentation is available on-line here.

Working with unit tests

Unit tests are run from the command line by executing the command:

$ py.test -v Lab01Tests.py

Note the -v flag toggles a more verbose output. If you wish to inspect the output of the full tests run you may pipe this command to the less utility (execute $ man less for a full manual of less):

$ py.test -v Lab01Tests.py | less

You can also run a selection of tests associated with each task, by executing the command. the argument to the -m flag may be a task (from task1 to task5 for Lab 1).

$ py.test -v Lab01Tests.py -m task1

You may also select tests to run based on their name using the -k flag. Have a look at the test file to find out the function names of each test. For example the following command executes the very first test of Lab 1, since it matches its name test_petlib_present:

$ py.test -v Lab01Tests.py -k petlib

The full documentation of pytest is available here.

Lab 05 -- Selective Disclosure (Anonymous) Credentials

Big picture

  • This lab takes you step-by-step through building a simple credential based pseudonym system.

  • A user registers a secret value with an identity provider that issues them with a credential. The secret value is encrypted using the Benaloh encryption scheme we have studied before, and a the ciphertext proven correct. The issuer then obliviously issues a credential with the secret value as the only attribute. The user may verify the issuing was indeed correct. Finally, the user may use this credential to prove its possession. More interestingly the user may derive a stable, service specific pseudonym bound to their secret value v, but that is unlinkable across services.

  • What is the point of this system? You may use the techniques in this exercise to implement a simple identity provider. Other services use the issued credentials to authenticate users to service specific pseudonyms. These pseudonyms are not linkable across services. This way a user can establish long term relations with each service without fearing being profiled across services. For example a UCL student issued with a credential may create a different pseudonym when using different university libraries; they all know, and can authenticate, the student under a different stable ID; however, even if they collate their records they cannot not get a full picture of all the books the student read.

  • This exercise makes extensive use of the MAC_GGM construction of credentials as described in "Algebraic MACs and Keyed-Verification Anonymous Credentials" pages 8-9. Have it at hand while you do this lab.

Task 1 -- User encrypts secret attribute v

  • In this task the user derives a fresh random attribute v, and encrypts it using a homomorphic encryption scheme under their own public key. The ciphertext will be used by the issuer to issue a credential on this attribute blindly, i.e. without ever learning the attribute.

  • The encryption is performed for you, but you have to provide a Zero-knowledge proof of knowledge on a number of statements: You need to prove knowledge of the encryption randomess k, the secret v and the private key for he used public key.

  • Note the verification of the proof above is provided: study it and ensure your proof may be verified correctly. The comment in task 1 also describes the statements to be proved.

  • The method used for issuing a credential on an encrypted (hidden) attribute is different from the one we covered in the lectures, where we looked at public / disclosed attributes. The technique used here is described in the last paragraph (page 8) of the paper on algebraic MACs.

Task 2 -- Issuing and issuing verification

  • In this task an issuer uses the provided ciphertext of the attribute to MAC it, thus providing a credential with 1 attribute. This is done using the ciphertext of v provided therefore keeping v secret from the issuer.

  • The steps necessary to issue a credential on a single blinded attribute are listed in the code file. They map to the hidden attribute "Issuance" protocol described in the last paragraph of page 8 in the aMAC paper.

  • Not only the issuer provides a MAC (u, u_prime) (where u_prime is encrypted), but also a proof of correct issuing. The statement that needs to be proved is provided in the code, and you may use it to further understand what computations are necessary as part of the issuance protocol.

  • The credential issuance verification and decryption procedures are provided. Study them to ensure they can verify the issuance and proof you construct.

  • Note that is a real-world application the issuer would first authenticate the user, before issuing the credential.

Task 3 -- Showing and verifying a showing of a credential.

  • In this task a user issued with a credential (u, u_prime) with a single attribute v, proves that they hold such a credential on a secret value v without revealing v, and in a manner that is unlinkable to previous showings or the issuing.

  • The steps necessary to prove possession are commented in the code. It is important to blind the credential, and then compute all necessary values described in page 9 of the algebraic MACs paper under the "Show" protocol.

  • A ZK proof of correct construction has to be computed. The exact statement to be proven is provided, and follows closely a 1 attribute Showing protocol from the paper.

  • For this task you need to implement the verification of the credential showing. This is the protocol "ShowVerify" page 9 of the reference paper. Note that you have to re-compute V on the verifier side, without transmitting it.

  • In a real setting, the output of the Showing protocol would be reflected by a service back to the identity provider, that would verify it and return whether it is a valid proof. This on-line check makes it imperative for the issuing and showing protocols to be unlinkable, so that the issuer may not track which services are used by users.

Task 4 -- Bind to a pseudonym

  • In the previous task the user Shows the credential therefore proving they are some user of the system (eg. some student at UCL). In this task the secret value v is used to derive a service specific pseudonym that is stable in the long term. The pseudonym is H(service name)^v.

  • Your task is to modify the protocols of task 3 (above) to not only prove possession of a credential when showing it, but also proving that a credential's secret attribute v maps to the pseudonym claimed.

  • Feel free to re-use code from Task 3 -- the modification to also support pseudonyms is small. Note that the paper presents proving arbitrary predicates on attributes when Showing as a predicate phi(m_1, ..., m_n). Showing that the attribute v leads to a pseudonym H(.)^v is a simple case of such a predicate.

Task Q1 -- e-cash question

  • Answer the question in the space provided.