# HW 25 - Spring 2024
# Pablo Blanco. OK to post.

# 2.
VerifyOpt1:=proc(n,G,B1,B2) local Gpr,e,i:
 # B1 is a vertex relabeling. 
 Gpr:= {seq({ B1[e[1]], B1[e[2]] },e in G)}: # Gpr is the graph under the relabeling
 
 for i in indices(B2) do:
  if member(op(i),Gpr) and B2[op(i)]<>1 then
   return(false):
  elif not(member(op(i),Gpr)) and B2[op(i)]<>0 then
   return(false):
  fi:

 od:
 true:
end:


#ZKP1(n,G,pi,Opt): Does ONE ROUND of the Blum protocol. Inputs a graph n,G,
#a Hamiltonian pi, and Opt=1 or 2 Opt=1 you show all the n+binomial(n,2) boxes
#Opt2, you show the contents of the n boxes correponsing to the mapping of
#your Hamiltonian
ZKP1:=proc(n,G,pi,Opt) local B1,B2,i,j,sig:
sig:=randperm(n):
for i from 1 to n do
 B1[i]:=sig[i]:
od:

for i from 1 to n do
 for j from i+1 to n do
   if member ({i,j},G) then
     B2[{sig[i],sig[j]}]:=1:
   else
    B2[{sig[i],sig[j]}]:=0:
   fi:
od:
od:

if Opt=1 then
 #[op(B1),op(B2)]:
 return(VerifyOpt1(n,G,B1,B2)):
elif Opt=2 then
 if {seq(B2[{sig[pi[i]],sig[pi[i+1]]}],i=1..n-1),B2[{sig[pi[n]],sig[pi[1]]}]} = {1} then
  return(true):
 fi:
 return(false):
else:
 return(FAIL):
fi:
end:

#3.

ZKP:=proc(n,G,pi,K) local i,ra,chk:
ra:=rand(1..2):
for i from 1 to k do:
  if ra()=1 then
   chk:=ZKP1(n,G,pi,1):
  else:
   chk:=ZKP1(n,G,pi,2):
  fi:

 if chk = false then  
  return(false):
 fi:
od:

true:
end:


#C25.txt: Zero-Knowledge Proofs. April 18, 2024
Help:=proc(): print(`LD(p), RG(n,p), RHG(n,p), ZKP1(n,G,pi,Opt)`): end:
with(combinat):
#LD(p): inputs a pos. rational number from 0 to 1 and  outputs true with prob. p
LD:=proc(p) local i:i:=rand(1..denom(p))(): if i<=numer(p) then true:else false:fi:end:

#RG(n,p): inputs a pos. integer n and outputs a simple graph on n vertices where the
#prob of an edge is p (independetly)
RG:=proc(n,p) local i,j,G:
G:={}:
for i from 1 to n do
 for j from i+1 to n do
  if LD(p) then
    G:=G union {{i,j}}:
  fi:
 od:
od:
G:  
end:


#RHG(n,p): inputs a pos. integer n and outputs a simple  HAMILTONIAN graph on n vertices 
#where the
#prob of an edge is p (independetly) together with the Hamiltonian path
#The output is a pair [G,permutation] where the permutation of {1,...,n}
#is the Hamiltonian cycle that you know and you don't want anyone else to know
#BUT you do want to convince them that you DO know
RHG:=proc(n,p) local i,j,G,pi:
pi:=randperm(n):
G:={seq({pi[i],pi[i+1]},i=1..n-1), {pi[n],pi[1]}}:

for i from 1 to n do
 for j from i+1 to n do
  if LD(p) then
    G:=G union {{i,j}}:
  fi:
 od:
od:
[G, pi]:  
end: