From Laurent.Vigneron at Loria.Fr Wed Oct 5 13:43:19 2005 From: Laurent.Vigneron at Loria.Fr (Laurent Vigneron) Date: Tue May 2 17:43:47 2006 Subject: [Avispa-users] Re: working with sets Message-ID: <17219.48215.782636.829041@valhey.loria.fr> Hi Tseno, There is no special instruction for updating a value in a set. But you can easily do it by combining de deletion and an addition. For example, you can write: ... /\ in(C.K_CS.D1',KeyRing) =|> ... /\ KeyRing':=delete(C.K_CS.D1',KeyRing) /\ D2' := data_c2 /\ KeyRing':=cons(C.K_CS.D2',KeyRing) In this example (based on yours), the "in" predicate in the left-hand side permits to check that the element to change really exists. In the right-hand side, there is the deletion of the existing element, and the addition of the new one. Note that in this example, I have assumed that C and K_CS are known by the agent, and that the third component was unknown (so written D1'). This was just for avoiing a too simple example... ;) Does this example fully solve your problem? Best, Laurent. PS: You can also replace the last two lines of the example by: /\ KeyRing':=cons(C.K_CS.data_c2,KeyRing) Tseno Tsenov wrote: > I have a short question about sets: > I know how to search in a set and how to initialize it. But, how can > I update a value in a set? > For example, if I have: > > KeyRing : (agent.symmetric_key.text) set > > it is initialized in the environment role with: > init KeyRing = {c.k_cs.data_c, i.k_is.data_i} > > and in one of the agent roles I would like to update the value of data_c > How can I do this? From jacopo at dist.unige.it Mon Oct 17 16:56:43 2005 From: jacopo at dist.unige.it (Jacopo Mantovani) Date: Tue May 2 17:43:47 2006 Subject: [Avispa-users] CFP: TCS special issue on Automated Reasoning for Security Protocol Analysis Message-ID: <4353BBAB.6020809@dist.unige.it> ============================================================================== Special Issue of Theoretical Computer Science on Automated Reasoning for Security Protocol Analysis http://www.avispa-project.org/arspa *********************** *** CALL FOR PAPERS *** *********************** BACKGROUND AND SCOPE ==================== In connection with The Second Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA'05) which took place as a satellite event of ICALP'05, we are guest-editing a Special Issue of Theoretical Computer Science devoted to original papers on formal security protocol specification, analysis and verification. Contributions are welcomed on the following topics and related ones: - Automated analysis and verification of security protocols. - Languages, logics, and calculi for the design and specification of security protocols. - Verification methods: accuracy, efficiency. - Decidability and complexity of cryptographic verification problems. - Synthesis and composition of security protocols. - Integration of formal security specification, refinement and validation techniques in development methods and tools. SUBMISSION ========== Authors should submit their papers electronically, in portable document format (pdf) or postscript (ps), by sending an email with subject "TCS submission" to the address arspa -at- avispa-project.org with the file of the paper as an attachment, by November 13, 2005. The following information should be included in the body of the email, in plain text: - paper title - author names - coordinates of the corresponding author - abstract of the paper The cover page of the submission should also include this information. Authors are strongly encouraged to use Elsevier Science's document class 'elsart', or alternatively the standard document class 'article'. The Elsevier LaTeX package (including detailed instructions for LaTeX preparation) can be obtained from Elsevier's web site: http://www.elsevier.com/locate/latex (see also http://www.elsevier.com/wps/find/journaldescription.cws_home/505625/description). Submitted papers must be original and not submitted for publication elsewhere. The submitted papers will be subject to the standard journal refereeing process. We kindly ask the authors to send us an abstract of their submission by November 6, 2005. DEADLINES ========= Submission of abstract: November 6, 2005 Submission of paper: November 13, 2005 EDITORS ======= Pierpaolo Degano (Universita` di Pisa, Italy) Luca Vigano` (ETH Zurich, Switzerland) WEB-SITE ======== http://www.avispa-project.org/arspa From isalekul at hotmail.com Sun Oct 23 06:05:12 2005 From: isalekul at hotmail.com (Salekul Islam) Date: Tue May 2 17:43:47 2006 Subject: [Avispa-users] User Manual of HLPSL Message-ID: Dear AVISPA users, I am a new user of AVISPA and using the Web based version. I am looking for a detail user manual of HLPSL. I have already downloaded Deliverable 2.1. I have found some keywords in the examples of Deliverable 6.2 which are not listed in the manual I have downloaded. Is there any other helpful document? Thank you and regards, Salekul Islam Ph.D student, Concordia University Montreal, Canada -------------- next part -------------- An HTML attachment was scrubbed... URL: http://carroll.ai.dist.unige.it/pipermail/avispa-users/attachments/20051023/a7a9eb91/attachment-0002.htm From ug85bas at cs.bham.ac.uk Sun Oct 23 11:59:08 2005 From: ug85bas at cs.bham.ac.uk (Ben Smyth) Date: Tue May 2 17:43:47 2006 Subject: [SPAM?] [Avispa-users] User Manual of HLPSL In-Reply-To: References: Message-ID: <435B5EEC.8030003@cs.bham.ac.uk> > I am a new user of AVISPA and using the Web based version. I am looking for a detail user manual of HLPSL. I have already downloaded Deliverable 2.1. I have found some keywords in the examples of Deliverable 6.2 which are not listed in the manual I have downloaded. Is there any other helpful document? Try downloading the AVISPA package, if I remember correctly it contains the necessary documentation. From MDemissie at PRIMUSTEL.com Thu Oct 27 19:22:42 2005 From: MDemissie at PRIMUSTEL.com (Demissie, Meron) Date: Tue May 2 17:43:47 2006 Subject: [Avispa-users] FW: Onion Router Protocol Verification Message-ID: <50E7CECE11ED7A498DD237E4FE277E5F0A4ACC0D@mclex01.us.primus> Hello: Has anyone tried to verify an onion routing protocol? If so, what were the obstacles you faced? Can someone please send me a sample if available? I would appreciate it. Thanks! Meron -----Original Message----- From: Laurent Vigneron [mailto:Laurent.Vigneron@Loria.Fr] Sent: Thursday, October 27, 2005 1:16 PM To: Demissie, Meron Subject: Re: Onion Router Protocol Verification Dear Meron, We did not model any onion router protocol yet. This is indeed a very interesting challenge, but I guess that for this you have to face the problem of specifying a dynamic network, right? (no predefined number of nodes) You can ask this question to the users mailing list of the AVISPA tool (avispa-users@avispa-project.org) in case someone has already tried to do this. Sincerely, Laurent. > Hello: > > Is there a sample of an onion router protocol (or anonymous > communication protocol) that has been verified by AVISPA tool? I have > not located a similar sample in your online protocol library. Can you > please help with this request? I appreciate it. > > > > Thanks, > > Meron ________________________________________________________________________ Lingo. Save up to 80% off your traditional phone service with unlimited US local, long distance, Canada and Western Europe minutes plus a lot of great calling features for $19.95 per month plus 1 month FREE. www.lingo.com - The Talk of Broadband From Michael.Rusinowitch at loria.fr Fri Oct 28 08:28:49 2005 From: Michael.Rusinowitch at loria.fr (Michael Rusinowitch) Date: Tue May 2 17:43:47 2006 Subject: [Avispa-users] FW: Onion Router Protocol Verification In-Reply-To: <50E7CECE11ED7A498DD237E4FE277E5F0A4ACC0D@mclex01.us.primus> References: <50E7CECE11ED7A498DD237E4FE277E5F0A4ACC0D@mclex01.us.primus> Message-ID: <17249.50465.674449.62891@villette.loria.fr> As far as I can remember in the following paper there is an approximated solution of your problem (an onion has few slices!) that can also be applied with avispa tool. regards Michael S. Mauw, J.H.S. Verschuren, and E.P. de Vink. A formalization of anonymity and onion routing. In P. Samarati, P. Ryan, D. Gollmann, and R. Molva, editors, ESORICS'04, pages 109-124, Sophia Antipolis, 2004. Demissie, Meron writes: > Hello: > Has anyone tried to verify an onion routing protocol? If so, what were > the obstacles you faced? Can someone please send me a sample if > available? I would appreciate it. > > Thanks! > Meron > > -----Original Message----- > From: Laurent Vigneron [mailto:Laurent.Vigneron@Loria.Fr] > Sent: Thursday, October 27, 2005 1:16 PM > To: Demissie, Meron > Subject: Re: Onion Router Protocol Verification > > > Dear Meron, > > We did not model any onion router protocol yet. > This is indeed a very interesting challenge, but I guess that for this > you have to face the problem of specifying a dynamic network, right? > (no predefined number of nodes) > > You can ask this question to the users mailing list of the AVISPA tool > (avispa-users@avispa-project.org) in case someone has already tried to > do this. > > Sincerely, > > Laurent. > > > > Hello: > > > > Is there a sample of an onion router protocol (or anonymous > > communication protocol) that has been verified by AVISPA tool? I > have > > not located a similar sample in your online protocol library. Can > you > > please help with this request? I appreciate it. > > > > > > > > Thanks, > > > > Meron > > ________________________________________________________________________ > Lingo. Save up to 80% off your traditional phone service with unlimited US local, long distance, Canada and Western Europe minutes plus a lot of great calling features for $19.95 per month plus 1 month FREE. www.lingo.com - The Talk of Broadband > _______________________________________________ > Avispa-users mailing list > Avispa-users@avispa-project.org > http://www.avispa-project.org/mailman/listinfo/avispa-users >