A framework for analyzing probabilistic protocols and its application to the partial secrets exchange

DOI10.1016/J.TCS.2007.09.006MaRDI QIDQ2463563zbMATH OpenOpenAlexFDO

Authors Konstantinos Chatzikokolakis, Catuscia Palamidessi

Publication date 14 December 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.09.006

zbMATH Keywords

securityoblivious transferprobabilistic protocolscontract signing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Trustworthy Global Computing
• On quantitative analysis of probabilistic protocols
• scientific article; zbMATH DE number 2090701
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Automata, Languages and Programming
• scientific article; zbMATH DE number 697830
• scientific article; zbMATH DE number 1692932
• A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference

Cites work

• scientific article; zbMATH DE number 1318512 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 2090701 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Probabilistic extensions of process algebras.
• Testing equivalences for processes
• Trustworthy Global Computing

Cited in

(8)

• Hidden-Markov program algebra with iteration
• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• A quantitative doxastic logic for probabilistic processes and applications to information-hiding
• Trustworthy Global Computing
• Formalisation of probabilistic concealment
• Financial Cryptography and Data Security
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols

This page was built for publication: A framework for analyzing probabilistic protocols and its application to the partial secrets exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463563)