Approximated computationally bounded simulation relations for probabilistic automata

被引：10
|
作者：
Segala, Roberto [1 ]
Turrini, Andrea [1 ]
机构：
[1] Univ Verona, Dipartimento Informat, I-37100 Verona, Italy
来源：
20TH IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSFS20), PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/CSF.2007.8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. These relations are meant to provide rigorous grounds to parts of correctness proofs for cryptographic protocols that are usually carried out by semi-formal arguments. We illustrate our ideas by recasting a correctness proof of Bellare and Rogaway based on the notion of matching conversation.
引用
收藏
页码：140 / +
页数：2
相关论文
共 50 条
  • [1] Probabilistic automata of bounded ambiguity
    Fijalkow, Nathanael
    Riveros, Cristian
    Worrell, James
    INFORMATION AND COMPUTATION, 2022, 282
  • [2] SPACE-BOUNDED PROBABILISTIC GAME AUTOMATA
    CONDON, A
    JOURNAL OF THE ACM, 1991, 38 (02) : 472 - 494
  • [3] PROBABILISTIC-AUTOMATA AND SIMULATION
    YAROVITSKII, NV
    KOSTINA, NI
    CYBERNETICS AND SYSTEMS ANALYSIS, 1993, 29 (03) : 321 - 329
  • [4] BOUNDED QUANTIFICATION AND RELATIONS RECOGNIZABLE BY FINITE AUTOMATA
    LAURINOLLI, T
    ACTA INFORMATICA, 1978, 10 (01) : 67 - 78
  • [5] Decision Problems for Probabilistic Finite Automata on Bounded Languages
    Bell, Paul C.
    Halava, Vesa
    Hirvensalo, Mika
    FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 1 - 14
  • [6] Simulation and Bisimulation for Probabilistic Timed Automata
    Sproston, Jeremy
    Troina, Angelo
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2010, 6246 : 213 - 227
  • [7] Freeness properties of weighted and probabilistic automata over bounded languages
    Bell, Paul C.
    Chen, Shang
    Jackson, Lisa
    INFORMATION AND COMPUTATION, 2019, 269
  • [8] Simulation relations for alternating Buchi automata
    Fritz, C
    Wilke, T
    THEORETICAL COMPUTER SCIENCE, 2005, 338 (1-3) : 275 - 314
  • [9] Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
    Berendsen, Jasper
    Chen, Taolue
    Jansen, David N.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 128 - +
  • [10] A PROBABILISTIC SIMULATION OF PRAMS ON A BOUNDED DEGREE NETWORK
    LUCCIO, F
    PIETRACAPRINA, A
    PUCCI, G
    INFORMATION PROCESSING LETTERS, 1988, 28 (03) : 141 - 147
12345