Analyzing security protocols using time-bounded task-PIOAs
type: Item
instance of: scholarly article
title: Analyzing security protocols using time-bounded task-PIOAs
zbMATH Open document ID: 1161.93320
author: Ran Canetti
author: Ling Cheung
author: Dilsun Kaynar
author: Moses Liskov
author: Olivier Pereira
author: Roberto Segala
author: Nancy Lynch
published in: Discrete Event Dynamic Systems
publication date: 2009-05-29T00:00:00Z
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5559863
zbMATH Keywords: security protocols
zbMATH Keywords: time-bounded task-PIOAs
zbMATH Keywords: probabilistic input/output automata
zbMATH Keywords: oblivious transfer
MaRDI profile type: Publication
full work available at URL: s10626-007-0032-1
OpenAlex ID: W2098593535
cites work: Reconciling two views of cryptography (The computational soundness of formal encryption)
cites work: Automated Reasoning
cites work: Theory of Cryptography
cites work: Q4364559
cites work: Universally composable two-party and multi-party secure computation
cites work: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
cites work: On the security of public key protocols
cites work: Q3325625
cites work: Foundations of Cryptography
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Q3519383
cites work: CONCUR 2003 - Concurrency Theory
cites work: Foundations of Software Science and Computation Structures
cites work: Q4847023
DOI: 10.1007/S10626-007-0032-1
Recommended article: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Recommended article: Q5418256
Recommended article: Q4484506
Recommended article: Q4673388
Recommended article: Q5192937
Recommended article: Q5422283
description: scientific article; zbMATH DE number 5559863