link.springer.com/article/10.1007/s10703-013-0184-6
Preview meta tags from the link.springer.com website.
Linked Hostnames
24- 39 links tolink.springer.com
- 34 links toscholar.google.com
- 10 links towww.springernature.com
- 7 links todoi.org
- 4 links toscholar.google.co.uk
- 4 links towww.ncbi.nlm.nih.gov
- 3 links towww.emis.de
- 2 links tocitation-needed.springer.com
Thumbnail

Search Engine Appearance
https://link.springer.com/article/10.1007/s10703-013-0184-6
Composition of password-based protocols - Formal Methods in System Design
Formal and symbolic techniques are extremely useful for modelling and analysing security protocols. They have helped to improve our understanding of such p
Bing
Composition of password-based protocols - Formal Methods in System Design
https://link.springer.com/article/10.1007/s10703-013-0184-6
Formal and symbolic techniques are extremely useful for modelling and analysing security protocols. They have helped to improve our understanding of such p
DuckDuckGo
Composition of password-based protocols - Formal Methods in System Design
Formal and symbolic techniques are extremely useful for modelling and analysing security protocols. They have helped to improve our understanding of such p
General Meta Tags
115- titleComposition of password-based protocols | Formal Methods in System Design
- charsetUTF-8
- X-UA-CompatibleIE=edge
- applicable-devicepc,mobile
- viewportwidth=device-width, initial-scale=1
Open Graph Meta Tags
6- og:urlhttps://link.springer.com/article/10.1007/s10703-013-0184-6
- og:typearticle
- og:site_nameSpringerLink
- og:titleComposition of password-based protocols - Formal Methods in System Design
- og:descriptionFormal and symbolic techniques are extremely useful for modelling and analysing security protocols. They have helped to improve our understanding of such protocols, allowed us to discover flaws, and they also provide support for protocol design. However, such analyses usually consider that the protocol is executed in isolation or assume a bounded number of protocol sessions. Hence, no security guarantee is provided when the protocol is executed in a more complex environment.In this paper, we study whether password protocols can be safely composed, even when a same password is reused. More precisely, we present a transformation which maps a password protocol that is secure for a single protocol session (a decidable problem) to a protocol that is secure for an unbounded number of sessions. Our result provides an effective strategy to design secure password protocols: (i) design a protocol intended to be secure for one protocol session; (ii) apply our transformation and obtain a protocol which is secure for an unbounded number of sessions. Our technique also applies to compose different password protocols allowing us to obtain both inter-protocol and inter-session composition.
Twitter Meta Tags
6- twitter:site@SpringerLink
- twitter:cardsummary_large_image
- twitter:image:altContent cover image
- twitter:titleComposition of password-based protocols
- twitter:descriptionFormal Methods in System Design - Formal and symbolic techniques are extremely useful for modelling and analysing security protocols. They have helped to improve our understanding of such...
Item Prop Meta Tags
3- position1
- position2
- position3
Link Tags
9- apple-touch-icon/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
- canonicalhttps://link.springer.com/article/10.1007/s10703-013-0184-6
- icon/oscar-static/img/favicons/darwin/android-chrome-192x192.png
- icon/oscar-static/img/favicons/darwin/favicon-32x32.png
- icon/oscar-static/img/favicons/darwin/favicon-16x16.png
Emails
1Links
120- http://eprint.iacr.org
- http://scholar.google.com/scholar_lookup?&title=A%20derivation%20system%20and%20compositional%20logic%20for%20security%20protocols&journal=J%20Comput%20Secur&volume=13&issue=3&pages=423-482&publication_year=2005&author=Datta%2CA&author=Derek%2CA&author=Mitchell%2CJ&author=Pavlovic%2CD
- http://scholar.google.com/scholar_lookup?&title=A%C2%A0calculus%20for%20cryptographic%20protocols%3A%20the%20spi%20calculus&pages=36-47&publication_year=1997&author=Abadi%2CM&author=Gordon%2CAD
- http://scholar.google.com/scholar_lookup?&title=A%C2%A0framework%20for%20compositional%20verification%20of%20security%20protocols&journal=Inf%20Comput&doi=10.1016%2Fj.ic.2007.07.002&volume=206&issue=2%E2%80%934&pages=425-459&publication_year=2008&author=Andova%2CS&author=Cremers%2CCJF&author=Gj%C3%B8steen%2CK&author=Mauw%2CS&author=Mj%C3%B8lsnes%2CSF&author=Radomirovic%2CS
- http://scholar.google.com/scholar_lookup?&title=An%20efficient%20cryptographic%20protocol%20verifier%20based%20on%20prolog%20rules&doi=10.1109%2FCSFW.2001.930138&pages=82-96&publication_year=2001&author=Blanchet%2CB