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

DOI10.1016/j.tcs.2007.09.006zbMath1132.68026OpenAlexW2097255270MaRDI QIDQ2463563

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)

Related Items (4)

Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Hidden-Markov program algebra with iteration ⋮ A quantitative doxastic logic for probabilistic processes and applications to information-hiding

Cites Work

• A randomized encoding of the \(\pi\)-calculus with mixed choice
• A calculus for cryptographic protocols: The spi calculus
• Testing equivalences for processes
• Trustworthy Global Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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