Highlights
Task 1:
A graph is a network of lines joining points. We say that two graphs are isomorphic if they are structurally the same aside from a re-ordering of the labels. That is, the two graphs should have the same number of edges and vertices, and the same connectivity between the edges.
A graph isomorphism is a mapping between the vertices of the first graph to the vertices of the second graph that preserves the structure of the graphs. [In mathematical language, we say that an isomorphism between graphs G and H is a function f: G → H such that whenever e is an edge in G between vertices v1 and v2 then there is a corresponding edge in H between vertices f(v1) and f(v2).]
Are the two graphs below isomorphic? Construct another graph with vertices u1,u2,u3,u4 and u5 isomorphic to either of these two graphs.
Task 2:
In the Week 1 workshop, we came across a problem where a colour blind person was convinced by their partner that they had two apples - one red and the other green.
Outline what a zero-knowledge proof is and how the story of the colour blind person qualifies to be a zero-knowledge proof.
Task 3:
Outline how the Graph Isomorphism Problem can be used to construct zero-knowledge proof.
Marking Key:
Task 1: Brief justification of your answer and correct graph. (You do not need to give a rigorous mathematical argument or provide an isomorphism, but your answer should convince somebody why the graphs are or are not isomorphic.)
Task 2: Brief explanation of what a zero-knowledge proof is.
Justification of why the story of the colour blind person meets the requirements for being a zero-knowledge proof.
Task 3: Description of the setup of the Graph Isomorphism Problem is a zero-knowledge proof.
Justification for why your scenario meets the requirements for being a zero-knowledge proof.
This CSI2108: Cyber Security Assignment has been solved by our Cyber Security Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.
© Copyright 2026 My Uni Papers – Student Hustle Made Hassle Free. All rights reserved.