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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
26
search results - page 6 / 6
»
A Logical Model for Commitment and Argument Network for Agen...
Sort
relevance
views
votes
recent
update
View
thumb
title
24
click to vote
FSTTCS
2003
Springer
91
views
Software Engineering
»
more
FSTTCS 2003
»
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
14 years 1 months ago
Download
www.cmi.ac.in
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
claim paper
Read More »
« Prev
« First
page 6 / 6
Last »
Next »