VerifHub
VerifHub allows Verifpal® users to easily share and discuss Verifpal models of cryptographic protocols. The VerifHub service provides unique URIs for each shared model which includes a syntax-highlighted model, an automatically generated diagram and a summary of the analysis results.
DTCP_v1.0.vp
Submitted on 18 Dec 20 16:32 UTC.attacker[active]
principal Bob[
generates rb
knows private b
cert_b = G^b
]
Bob -> Alice: rb, [cert_b]
principal Alice[
generates ra
knows private a
cert_a = G^a
]
Alice -> Bob: ra, [cert_a]
principal Bob[
generates y
knows private textb
yg = G^y
sigb = SIGN(y, CONCAT(ra, textb))
]
Bob -> Alice: yg, textb, sigb
principal Alice[
_ = SIGNVERIF(yg, CONCAT(ra, textb), sigb)?
generates x
knows private texta
xg = G^x
siga = SIGN(x, CONCAT(rb, texta))
]
Alice -> Bob: xg, texta, siga
principal Bob[
_ = SIGNVERIF(xg, CONCAT(rb, texta), siga)?
]
queries[
freshness? rb
unlinkability? rb, cert_b
authentication? Bob -> Alice: yg
]
Analysis Results
The model submitter provided the following analysis results:
- Query 1 (Freshness): FAIL
- Query 2 (Unlinkability): FAIL
- Query 3 (Authentication): FAIL
Please note that these results are not verified to be accurate. The model submitter may choose to provide false analysis results if they so desire. It is strongly recommended that you re-run the analysis of this model locally if you wish to verify the authenticity of the analysis results above.
Discuss This Model
© Copyright 2019- Nadim Kobeissi. All Rights Reserved. “Verifpal” and the “Verifpal” logo/mascot are registered trademarks of Nadim Kobeissi. Verifpal software is provided as free and open source software, licensed under the GPLv3. Verifpal User Manual, as well as this website, are provided under the CC BY-NC-ND 4.0 license. Published by Symbolic Software.