Cryptography Reference
In-Depth Information
Protocol:
perform
1. the prover picks a random r and sends T
r
v
mod
n,
=
2. the verifier sends random d among
1
,...,v
−
1
,
rB
d
3. the prover sends D
=
mod
n,
D
v
J
d
4. the verifier checks that T
≡
(mod
n
)
.
Prove that this is a zero-knowledge proof of knowledge of B.
2
Exercise 11.5.
Construct a perfect secret sharing scheme with the following access
structure
={
P
1
}
,
{
P
2
,
P
3
}
,
{
P
2
,
P
4
,
P
5
}
,
{
P
3
,
P
4
,
P
5
}
.
2
This exercise was inspired by Ref. [82].
Search WWH ::
Custom Search