Key substitution in the symbolic analysis of cryptographic protocols

被引:0
|
作者
Chevalier, Yannick [1 ]
Kourjieh, Mounira [1 ]
机构
[1] Univ Toulouse, IRIT, Toulouse, France
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be signed with the new signature key. Schemes vulnerable to this attack thus permit an active intruder to claim to be the issuer of a signed message. In this paper, we investigate and solve positively the problem of the decidability of symbolic cryptographic protocol analysis when the signature schemes employed in the concrete realisation have this property.
引用
收藏
页码:121 / 132
页数:12
相关论文
共 50 条
  • [1] Symbolic trace analysis of cryptographic protocols
    Boreale, M
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 667 - 681
  • [2] Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings
    Pankova, Alisa
    Laud, Peeter
    2012 IEEE 25TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2012, : 63 - 77
  • [3] A Symbolic Logic with Exact Bounds for Cryptographic Protocols
    Mitchell, John C.
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, WOLLIC 2011, 2011, 6642 : 3 - 3
  • [4] Computing symbolic models for verifying cryptographic protocols
    Fiore, M
    Abadi, M
    14TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2001, : 160 - 173
  • [5] Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
    Meseguer, Jose
    Thati, Prasanna
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 117 : 153 - 182
  • [6] ASAP: Algorithm Substitution Attacks on Cryptographic Protocols
    Berndt, Sebastian
    Wichelmann, Jan
    Pott, Claudius
    Traving, Tim-Henrik
    Eisenbarth, Thomas
    ASIA CCS'22: PROCEEDINGS OF THE 2022 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2022, : 712 - 726
  • [7] A symbolic decision procedure for cryptographic protocols with time stamps
    Bozga, L
    Ene, C
    Lakhnech, Y
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 177 - 192
  • [8] A symbolic decision procedure for cryptographic protocols with time stamps
    Bozga, L
    Ene, C
    Lakhnech, Y
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2005, 65 (01): : 1 - 35
  • [9] Suitable Symbolic Models for Cryptographic Verification of Secure Protocols in ProVerif
    Okazaki, Hiroyuki
    Futa, Yuichi
    Arai, Kenichi
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 326 - 330
  • [10] Collusion analysis of cryptographic protocols
    Low, SH
    Maxemchuk, NF
    IEEE GLOBECOM 1996 - CONFERENCE RECORD, VOLS 1-3: COMMUNICATIONS: THE KEY TO GLOBAL PROSPERITY, 1996, : 1 - 5