Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols

DOI10.1007/11864219_17zbMath1155.68326OpenAlexW2121635143MaRDI QIDQ3524308

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

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/35193

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Network protocols (68M12)

Related Items (15)

Polynomial runtime and composability ⋮ On the Security of Long-Lived Archiving Systems Based on the Evidence Record Syntax ⋮ Universal Composition with Responsive Environments ⋮ The IITM model: a simple and expressive model for universal composability ⋮ Joint state composition theorems for public-key encryption and digital signature functionalities with local computation ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Task-structured probabilistic I/O automata ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Information hiding in probabilistic concurrent systems ⋮ Making random choices invisible to the scheduler ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ Bisimulation for Demonic Schedulers ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ On the relationships between notions of simulation-based security ⋮ Relationship of Three Cryptographic Channels in the UC Framework

This page was built for publication: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols