Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Protocol, mobility and adversary models for the verification of security
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication.
2016 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The increasing heterogeneity of communicating devices, ranging from resource constrained battery driven sensor nodes to multi-core processor computers, challenges protocol design. We examine security and privacy protocols with respect to exterior factors such as users, adversaries, and computing and communication resources; and also interior factors such as the operations, the interactions and the parameters of a protocol.

Users and adversaries interact with security and privacy protocols, and even affect the outcome of the protocols. We propose user mobility and adversary models to examine how the location privacy of users is affected when they move relative to each other in specific patterns while adversaries with varying strengths try to identify the users based on their historical locations. The location privacy of the users are simulated with the support of the K-Anonymity protection mechanism, the Distortion-based metric, and our models of users' mobility patterns and adversaries' knowledge about users.

Security and privacy protocols need to operate on various computing and communication resources. Some of these protocols can be adjusted for different situations by changing parameters. A common example is to use longer secret keys in encryption for stronger security. We experiment with the trade-off between the security and the performance of the Fiat–Shamir identification protocol. We pipeline the protocol to increase its utilisation as the communication delay outweighs the computation.

A mathematical specification based on a formal method leads to a strong proof of security. We use three formal languages with their tool supports in order to model and verify the Secure Hierarchical In-Network Aggregation (SHIA) protocol for Wireless Sensor Networks (WSNs). The three formal languages specialise on cryptographic operations, distributed systems and mobile processes. Finding an appropriate level of abstraction to represent the essential features of the protocol in three formal languages was central.

Place, publisher, year, edition, pages
Uppsala University, 2016. , 132 p.
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2016-007
National Category
Computer Science Communication Systems
Research subject
Computer Science with specialization in Computer Communication
Identifiers
URN: urn:nbn:se:uu:diva-298943OAI: oai:DiVA.org:uu-298943DiVA: diva2:948581
Supervisors
Projects
ProFuN
Available from: 2016-07-12 Created: 2016-07-12 Last updated: 2016-07-28Bibliographically approved
List of papers
1. The impact of trace and adversary models on location privacy provided by K-anonymity
Open this publication in new window or tab >>The impact of trace and adversary models on location privacy provided by K-anonymity
2012 (English)In: Proc. 1st Workshop on Measurement, Privacy, and Mobility, New York: ACM Press, 2012, 6Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
New York: ACM Press, 2012
National Category
Computer Science
Research subject
Computer Science with specialization in Computer Communication
Identifiers
urn:nbn:se:uu:diva-171581 (URN)10.1145/2181196.2181202 (DOI)978-1-4503-1163-2 (ISBN)
Conference
MPM 2012
Projects
ProFuNWISENET
Available from: 2012-04-10 Created: 2012-03-22 Last updated: 2016-07-12Bibliographically approved
2. Towards adaptive zero-knowledge protocols: A case study with Fiat–Shamir identification protocol
Open this publication in new window or tab >>Towards adaptive zero-knowledge protocols: A case study with Fiat–Shamir identification protocol
2013 (English)In: Proc. 9th Swedish National Computer Networking Workshop, 2013, 67-70 p.Conference paper, Published paper (Refereed)
Abstract [en]

Interactive zero-knowledge protocols are used as identification protocols. The protocols are executed in rounds, with security being increased with every round. This allows for a trade-off between security and performance to adapt the protocol to the requirements of the scenario. We experimentally investigate the Fiat–Shamir identification protocol on machines and networks with different performance characteristics. We find that the delay of the protocol highly depends on network latency and upload bandwidth. Computation time becomes more visible, when the protocol transmits little amount of data via a low latency network. We also experience that the impact of the sizes of the variables on the delay of the protocol is less than the number of rounds', which are interior factors in the protocol.

National Category
Computer Science
Research subject
Computer Science with specialization in Computer Communication
Identifiers
urn:nbn:se:uu:diva-201070 (URN)
Conference
SNCNW 2013
Projects
WISENETProFuN
Available from: 2013-06-05 Created: 2013-06-05 Last updated: 2016-07-12Bibliographically approved
3. Modelling and analysing a WSN secure aggregation protocol: A comparison of languages and tool support
Open this publication in new window or tab >>Modelling and analysing a WSN secure aggregation protocol: A comparison of languages and tool support
2015 (English)Report (Other academic)
Series
Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2015-033
National Category
Computer Science Communication Systems
Research subject
Computer Science with specialization in Computer Communication
Identifiers
urn:nbn:se:uu:diva-268453 (URN)
Projects
ProFuN
Funder
Swedish Foundation for Strategic Research , RIT08-0065
Available from: 2015-12-03 Created: 2015-12-04 Last updated: 2016-07-12Bibliographically approved

Open Access in DiVA

fulltext(9684 kB)119 downloads
File information
File name FULLTEXT01.pdfFile size 9684 kBChecksum SHA-512
7df0ecbdaa29fdfe018cf4bc289f2f9cd6524f1724047ec1a7b7b25fce846d6c174b964cfa46b14bda0da53a99db2766d64e7e5d8b5459fbcba0fe0a3798371f
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Cambazoglu, Volkan
By organisation
Division of Computer SystemsComputer Architecture and Computer Communication
Computer ScienceCommunication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 119 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 564 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf