Reasoning about Probabilistic Security Using Task-PIOAs
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 2-22
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Anonymity protocols as noisy channelsInformation and Computation, 2008
- Making Random Choices Invisible to the Scheduler2007
- Labelled Markov Processes as Generalised Stochastic RelationsElectronic Notes in Theoretical Computer Science, 2007
- Probabilistic Anonymity Via Coalgebraic SimulationsLecture Notes in Computer Science, 2007
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocolsTheoretical Computer Science, 2006
- Approximating labelled Markov processesInformation and Computation, 2003
- A Calculus for Cryptographic Protocols: The Spi CalculusInformation and Computation, 1999
- Bisimulation through probabilistic testingInformation and Computation, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988