Analyzing security protocols using time-bounded task-PIOAs

DOI10.1007/s10626-007-0032-1zbMath1161.93320OpenAlexW2098593535MaRDI QIDQ1020557

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

Publication date: 29 May 2009

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-007-0032-1

zbMATH Keywords

oblivious transfersecurity protocolsprobabilistic input/output automatatime-bounded task-PIOAs

Mathematics Subject Classification ID

Cryptography (94A60) Stochastic scheduling theory in operations research (90B36) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03) Authentication, digital signatures and secret sharing (94A62)

Related Items (13)

Layout randomization and nondeterminism ⋮ Polynomial runtime and composability ⋮ Abstract probabilistic automata ⋮ Layered reasoning for randomized distributed algorithms ⋮ Layout Randomization and Nondeterminism ⋮ Specification Theories for Probabilistic and Real-Time Systems ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Bisimulation for Demonic Schedulers ⋮ Abstract Probabilistic Automata ⋮ Distributed Synthesis in Continuous Time ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ Relationship of Three Cryptographic Channels in the UC Framework ⋮ A Universally Composable Framework for the Analysis of Browser-Based Security Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analyzing security protocols using time-bounded task-PIOAs
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• Universally composable two-party and multi-party secure computation
• The Knowledge Complexity of Interactive Proof Systems
• On the security of public key protocols
• Foundations of Cryptography
• Foundations of Cryptography
• Automated Reasoning
• Foundations of Software Science and Computation Structures
• CONCUR 2003 - Concurrency Theory
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Analyzing security protocols using time-bounded task-PIOAs