Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Secure Multi-Party Sorting and Applications
Reykjavik University.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
KTH, School of Electrical Engineering (EES), Communication Networks.
2011 (English)Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
2011.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-32421OAI: oai:DiVA.org:kth-32421DiVA: diva2:410599
Conference
ACNS 2011. Applied Cryptography and Network Security. Nerja (Malaga), Spain. June 7-10 2011
Funder
ICT - The Next Generation
Note

QC 20110420. Industrial Track

Available from: 2011-04-14 Created: 2011-04-14 Last updated: 2013-11-25Bibliographically approved
In thesis
1. Aspects of Secure and Efficient Streaming and Collaboration
Open this publication in new window or tab >>Aspects of Secure and Efficient Streaming and Collaboration
2011 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Research within the area of cryptography constitutes the core of this the- sis. In addition to cryptography, we also present results in peer-assisted streaming and web security. We present results on two specific cryptographic problems: broadcast encryption and secure multi-party computation. Broad- cast encryption is the problem of efficiently and securely distributing content to a large and changing group of receivers. Secure multi-party computation is the subject of how a number of parties can collaborate securely. All in all, this thesis spans from systems work discussing the Spotify streaming system with millions of users, to more theoretic, foundational results. Streaming is among the largest applications of the Internet today. On- demand streaming services allow users to consume the media content they want, at their convenience. With the large catalogs offered by many services, users can access a wide selection of content. Live streaming provides the means for corporations as well as individuals to broadcast to the world. The power of such broadcasts was shown in the recent (early 2011) revolts in Tunisia and Egypt, where protesters streamed live from demonstrations. To stream media to a large global audience requires significant resources, in particular in terms of the bandwidth needed. One approach to reduce the requirements is to use peer-to-peer techniques, where clients assist in distributing the media. Spotify is a commercial music-on-demand streaming system, using peer-to-peer streaming. In this thesis, we discuss the Spotify protocol and measurements on its performance. In many streaming systems, it is important to restrict access to content. One approach is to use cryptographic solutions from the area of broadcast encryption. Within this area, we present two results. The first is a protocol which improves the efficiency of previous systems at the cost of lowered secu- rity guarantees. The second contains lower-bound proofs, showing that early protocols in the subset cover framework are essentially optimal. Many streaming systems are web-based, where the user accesses content in a web browser. Apart from this usage of the web, subscriptions for streaming services are bought using a web browser. This means that to provide a secure streaming service, we must understand web security. This thesis contains a result on a new type of attack, using an old history detection vulnerability to time the execution of a redirect of a victim’s browser. Within the area of secure multi-party computation, this thesis has three contributions. Firstly, we give efficient protocols for the basic functions of summation and disjunction which adapt to the network they run on. Secondly, we provide efficient protocols for sorting and aggregation, by using techniques from the area of sorting networks. Finally, we prove a dichotomy theorem, showing that all functions with three distinct outputs are either maximally easy or maximally difficult with regards to the security provided.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. xi, 74 p.
Series
Trita-CSC-A, ISSN 1653-5723 ; 2011:05
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-32424 (URN)978-91-7415-942-4 (ISBN)
Public defence
2011-05-13, D2, Lindstedtsvägen 5, KTH, Stockholm, 13:15 (English)
Opponent
Supervisors
Funder
ICT - The Next Generation
Note
QC 20110420Available from: 2011-04-20 Created: 2011-04-14 Last updated: 2012-06-14Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jónsson, Kristjan ValurKreitz, GunnarUddin, Misbah
By organisation
Theoretical Computer Science, TCSCommunication Networks
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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