Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
147
click to vote
CONCUR
2003
Springer
106
views
Distributed And Parallel Com...
»
more
CONCUR 2003
»
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
15 years 8 months ago
Download
wslc.math.ist.utl.pt
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
claim paper
Read More »