Approximated computationally bounded simulation relations for probabilistic automata

被引:10
|
作者
Segala, Roberto [1 ]
Turrini, Andrea [1 ]
机构
[1] Univ Verona, Dipartimento Informat, I-37100 Verona, Italy
关键词
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 条
  • [41] Coalitions among computationally bounded agents
    Sandholm, TW
    Lesser, VR
    ARTIFICIAL INTELLIGENCE, 1997, 94 (1-2) : 99 - 137
  • [42] On probabilistic analog automata
    Ben-Hur, A
    Roitershtein, A
    Siegelmann, HT
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 449 - 464
  • [43] Probabilistic Interface Automata
    Pavese, Esteban
    Braberman, Victor
    Uchitel, Sebastian
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2016, 42 (09) : 843 - 865
  • [44] Abstract Probabilistic Automata
    Delahaye, Benoit
    Katoen, Joost-Pieter
    Larsen, Kim G.
    Legay, Axel
    Pedersen, Mikkel L.
    Sher, Falak
    Wasowski, Andrzej
    INFORMATION AND COMPUTATION, 2013, 232 : 66 - 116
  • [45] On probabilistic pushdown automata
    Hromkovic, Juraj
    Schnitger, Georg
    INFORMATION AND COMPUTATION, 2010, 208 (08) : 982 - 995
  • [46] On probabilistic timed automata
    Beauquier, D
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 65 - 84
  • [47] PROBABILISTIC GAME AUTOMATA
    CONDON, A
    LADNER, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 223 : 144 - 162
  • [48] PROBABILISTIC GRAMMARS AND AUTOMATA
    SANTOS, ES
    INFORMATION AND CONTROL, 1972, 21 (01): : 27 - &
  • [49] Probabilistic Cellular Automata
    Agapie, Alexandru
    Andreica, Anca
    Giuclea, Marius
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2014, 21 (09) : 699 - 708
  • [50] Probabilistic Weighted Automata
    Chatterjee, Krishnendu
    Doyen, Laurent
    Henzinger, Thomas A.
    CONCUR 2009 - CONCURRENCY THEORY, PROCEEDINGS, 2009, 5710 : 244 - 258