References of "Yurkov, Semen 50035137"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailUnlinkability of an Improved Key Agreement Protocol for EMV 2nd Gen Payments
Horne, Ross James UL; Mauw, Sjouke UL; Yurkov, Semen UL

Scientific Conference (2022, August 10)

To address known privacy problems with the EMV standard, EMVCo have proposed a Blinded Diffie-Hellman key establishment protocol, which is intended to be part of a future 2nd Gen EMV protocol. We point ... [more ▼]

To address known privacy problems with the EMV standard, EMVCo have proposed a Blinded Diffie-Hellman key establishment protocol, which is intended to be part of a future 2nd Gen EMV protocol. We point out that active attackers were not previously accounted for in the privacy requirements of this proposal protocol, and demonstrate that an active attacker can compromise unlinkability within a distance of 100cm. Here, we adopt a strong definition of unlinkability that does account for active attackers and propose an enhancement of the protocol proposed by EMVCo. We prove that our protocol does satisfy strong unlinkability, while preserving authentication. [less ▲]

Detailed reference viewed: 42 (1 UL)
Full Text
Peer Reviewed
See detailCompositional Analysis of Protocol Equivalence in the Applied pi-Calculus Using Quasi-open Bisimilarity
Horne, Ross James UL; Mauw, Sjouke UL; Yurkov, Semen UL et al

in Theoretical Aspects of Computing -- ICTAC 2021 (2021)

This paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied pi-calculus. Furthermore, we show that this equivalence is suited to security and privacy problems ... [more ▼]

This paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied pi-calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so. [less ▲]

Detailed reference viewed: 25 (3 UL)