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 条
  • [31] BOUNDED PARIKH AUTOMATA
    Cadilhac, Michael
    Finkel, Alain
    Mckenzie, Pierre
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1691 - 1709
  • [32] Relations approximated by continuous functions
    Holá, L
    McCoy, RA
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2005, 133 (07) : 2173 - 2182
  • [33] Minimizing finite automata is computationally hard
    Malcher, A
    THEORETICAL COMPUTER SCIENCE, 2004, 327 (03) : 375 - 390
  • [34] Minimizing finite automata is computationally hard
    Malcher, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 386 - 397
  • [35] On bounded languages and reversal-bounded automata
    Ibarra, Oscar H.
    Ravikumar, Bala
    INFORMATION AND COMPUTATION, 2016, 246 : 30 - 42
  • [36] Pushdown automata with bounded nondeterminism and bounded ambiguity
    Herzog, C
    THEORETICAL COMPUTER SCIENCE, 1997, 181 (01) : 141 - 157
  • [37] Bounded Rationality in Las Vegas: Probabilistic Finite Automata Play Multi-Armed Bandits
    Liu, Xinming
    Halpern, Joseph Y.
    CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI 2020), 2020, 124 : 1298 - 1307
  • [38] Modal characterisation of simulation relations in probabilistic concurrent games
    Zhang, Chenyi
    Pang, Jun
    SCIENCE OF COMPUTER PROGRAMMING, 2022, 215
  • [39] On stackelberg pricing with computationally bounded customers
    Briest, Patrick
    Guala, Luciano
    Hoefer, Martin
    Ventre, Carmine
    NETWORKS, 2012, 60 (01) : 31 - 44
  • [40] On Stackelberg Pricing with Computationally Bounded Consumers
    Briest, Patrick
    Hoefer, Martin
    Guala, Luciano
    Ventre, Carmine
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 42 - +
12345