Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/4779
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goldberg, Ian | - |
dc.contributor.author | Stebila, Douglas | - |
dc.contributor.author | Ustaoğlu, Berkant | - |
dc.date.accessioned | 2017-02-02T06:51:30Z | - |
dc.date.available | 2017-02-02T06:51:30Z | - |
dc.date.issued | 2013-05 | - |
dc.identifier.citation | Goldberg, I., Stebila, D., and Ustaoğlu, B. (2013). Anonymity and one-way authentication in key exchange protocols. Designs, Codes, and Cryptography, 67(2), 245-269. doi:10.1007/s10623-011-9604-z | en_US |
dc.identifier.issn | 0925-1022 | - |
dc.identifier.uri | http://doi.org/10.1007/s10623-011-9604-z | - |
dc.identifier.uri | http://hdl.handle.net/11147/4779 | - |
dc.description.abstract | Key establishment is a crucial cryptographic primitive for building secure communication channels between two parties in a network. It has been studied extensively in theory and widely deployed in practice. In the research literature a typical protocol in the public-key setting aims for key secrecy and mutual authentication. However, there are many important practical scenarios where mutual authentication is undesirable, such as in anonymity networks like Tor, or is difficult to achieve due to insufficient public-key infrastructure at the user level, as is the case on the Internet today. In this work we are concerned with the scenario where two parties establish a private shared session key, but only one party authenticates to the other; in fact, the unauthenticated party may wish to have strong anonymity guarantees. We present a desirable set of security, authentication, and anonymity goals for this setting and develop a model which captures these properties. Our approach allows for clients to choose among different levels of authentication. We also describe an attack on a previous protocol of Øverlier and Syverson, and present a new, efficient key exchange protocol that provides one-way authentication and anonymity. © 2012 Springer Science+Business Media, LLC. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Designs, Codes, and Cryptography | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Network protocols | en_US |
dc.subject | Anonymity | en_US |
dc.subject | Key exchange | en_US |
dc.subject | Security model | en_US |
dc.subject | Tor network | en_US |
dc.title | Anonymity and one-way authentication in key exchange protocols | en_US |
dc.type | Article | en_US |
dc.authorid | TR102756 | en_US |
dc.institutionauthor | Ustaoğlu, Berkant | - |
dc.department | İzmir Institute of Technology. Mathematics | en_US |
dc.identifier.volume | 67 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 245 | en_US |
dc.identifier.endpage | 269 | en_US |
dc.identifier.wos | WOS:000316207200009 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1007/s10623-011-9604-z | - |
dc.relation.doi | 10.1007/s10623-011-9604-z | en_US |
dc.coverage.doi | 10.1007/s10623-011-9604-z | en_US |
dc.identifier.wosquality | Q2 | - |
dc.identifier.scopusquality | Q3 | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
crisitem.author.dept | 04.02. Department of Mathematics | - |
Appears in Collections: | Mathematics / Matematik Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
36
checked on Nov 15, 2024
WEB OF SCIENCETM
Citations
18
checked on Oct 26, 2024
Page view(s)
408
checked on Nov 18, 2024
Download(s)
196
checked on Nov 18, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.