Task-structured probabilistic I/O automata

DOI10.1016/j.jcss.2017.09.007zbMath1390.68382OpenAlexW2170634995MaRDI QIDQ1745718

Roberto Segala, Olivier Pereira, Ling Cheung, Moses Liskov, Dilsun Kaynar, Ran Canetti, Nancy A. Lynch

Publication date: 18 April 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.09.007

zbMATH Keywords

I/O automatacryptographic protocolsprobabilistic automataformal modeling

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ Information hiding in probabilistic concurrent systems ⋮ Relationship of Three Cryptographic Channels in the UC Framework ⋮ Proving Approximate Implementations for Probabilistic I/O Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Switched PIOA: parallel composition via distributed scheduling
• On the fly authentication and signature schemes based on groups of unknown order
• The choice coordination problem
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• The reactive simulatability (RSIM) framework for asynchronous systems
• Finite state Markovian decision processes
• On the Translocation of Masses
• Proving Approximate Implementations for Probabilistic I/O Automata
• Polylog randomized wait-free consensus
• Fast randomized consensus using shared memory
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• The knowledge complexity of interactive proof-systems
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Randomized protocols for asynchronous consensus
• Validation of Stochastic Systems
• Proving time bounds for randomized distributed algorithms
• Relationship of Three Cryptographic Channels in the UC Framework
• Theory of Cryptography
• CONCUR 2003 - Concurrency Theory
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Task-structured probabilistic I/O automata