SBA Research is a research center for Information Security funded partly by the national initiative for COMET Competence Centers for Excellent Technologies. Within a network of more than 70 companies, 15 Austrian and international universities and research institutions, and many additional international research partners we jointly work on research challenges ranging from organizational to technical security to strengthen Europe’s Cybersecurity capabilities.
ISIS @ TU Wien IAIK @ TU Graz DKE @ Uni Wien NM @ WU Wien FH St. Pölten AIT


Guest lectures: Sonehara, Ichifuji, Echizen & Wohlgemuth

Starting at 3pm

Dr. N. Sonehara, “Data-centric Socio-Informatics Supporting Public Policy Decision Making, NII and ROIS/TRIC.
Dr. Y. Ichifuji, “Web Data Driven Information Circulation and Its application of Resilience Evaluation”, ROIS/TRIC
Dr. I. Echizen, “Multimedia Location Privacy Control Mechanism”, NII
Dr. S. Wohlgemuth, “Resilient Social System Design Methods”, ROIS/TRIC, Associate Professor at NII / ROIS

Generalversammlung SBA

Heute findet die Generalversammlung statt. Markus Klemen gibt einen Überblick über das erfolgreiche letzte Jahr und die Revision des K-ind-Zeitraums.

Sigrun Goluch: homomorphic cryptography. Gentry’s privacy homomorphism

Sigrun Goluch: The development of homomorphic cryptography From RSA to Gentry’s privacy homomorphism

Ever since the discovery of public-key cryptography by Diffie and Hellman in 1976, the necessity for total privacy of digital data has become stronger and stronger, especially since the internet has become an indispensable part of both our private and work lives. Naturally, the question for more secure encryption schemes arose in the past few decades.
One way to achieve con?dentiality in applications, such as online banking, electronic voting, virtual networks etc. are
homomorphic and especially fully homomorphic cryptographic schemes. Fully homomorphic cryptosystems or privacy homomorphisms were introduced by Rivest, Adleman, and Dertouzous in 1978. They asked for a way to allow a third, untrusted party to carry out extensive computation on encrypted data, without having to decrypt fi?rst. The search for fully homomorphic cryptosystems began and ended almost 4 decades later when Craih Gentry published his fully homomorphic method. Although not yet useful for practical applications, it ended the long search for the in 1978 emerged question about the existence of privacy homomorphisms.

Follow us on Twitter!

We now have a Twitter account for our news section. Follow us at @SBA_Research on Twitter.

Oberösterreichische Nachrichten: Martina Lindorfer “im Team der weltbesten Hacker”

Die Wächter über Datenströme und Web- attacken sind am Institut für Rechnergestützte Automation der TU Wien daheim. Jetzt haben sie einen der wichtigsten Hackerwettbewerbe weltweit gewonnen. Mit im Team: Martina Lindorfer aus Linz” (OÖN)

IFIP WG 8.4 Web Site hosted by SBA

Edgar Weippl is the new chair of the WG and SBA hosts the website (more…)

Victory at the iCTF 2011

The team of the Technical University of Vienna “We_0wn_Y0u” could achieve victory at the iCTF 2011 under the direction of Adrian Dabrowski. In a very exciting, nine-hour competition against 85 international competing teams, also Martin Mulazzani, Peter Frühwirt and Manuel Leithner put, as representatives of SBA Research, their skills regarding attacks and defenses of IT infrastructure to the test.

With a broad international participation field (i.a. US, Russia and China), iCTF is one of the the largest Capture-the-Flag contests worldwide. Foto

Press coverage by Standard, PresseKrone, Österreich

ERCIM fellowships: Dimitris Simos

SBA will offer an ERCIM fellowship (co-financed by the EU project “ABCDE”) to Dimitris Simos

Scientific Board: Fall Meeting

Today our scientific board met to review past research and discuss further research directions.

Guest Talk: Kai Zhang, Large Scale Unsupervised and Semi-Supervised Learning

Kai Zhang (Lawrence Berkeley National Laboratory, US Department of Energy),

Topic: Matrix approximation.

Nov 28, 3pm, SBA

Title: Large Scale Unsupervised and Semi-Supervised Learning


Clustering is a fundamental data explorative step in pattern recognition and machine learning. This talk involves two types of clustering paradigms, the mixture models and graph-based clustering methods, with the primary focus on how to improve the scaling behavior of related algorithms for large-scale application. The first part is on simplifying mixture models, and the second part is on applying low-rank matrix approximation with novel sampling scheme in a large family of mainstream learning algorithms. Topics on community detection and large scale supervised learning (SVM) will also be included.

NÖN: Wie greifbar sind Sie?

Edgar Weippl im Interview mit den Niederösterr. Nachrichten (Extrabeilage Sicher Leben)

A1 Austria Cloud: SBA Research confirms server location in Austria

“We have subjected the cloud solution from A1 to an architecture analysis and can confirm that the data in the A1 Austria Cloud are stored only on servers that are operated in Austria,” confirms Markus Klemen, CEO of Secure Business Austria Research. (mehr…)

INMOTOS Workshop at SBA

Lorenz Zechner and Peter Kieseberg organize the INMOTOS Workshop.

Wiener Zeitung: Gastkommentar

“Oft sind es erstaunlich simple Sicherheitslücken, die im Internet für Datenklau-Attacken ausgenützt werden.” (Gastkommentar Edgar Weippl, Wiener Zeitung)

Book review: Android forensics

Manuel Leithner’s book review was just published (DOI)

Software to investigate cybercrime’s social side

New Scientist: Markus Huber has developed software to help police use online clues to solve offline crimes

UCC Privacy & Security

Manuel Leitner is holding a lesson about UCC Privacy & Security in cooperation with CON.ECT. The talk is centered on multidimensional communication including audio, video, text and files. Threats endangering the privacy of the transmitted data are shown and defense strategies are presented in this talk.

IFIP WG11.9 Conference: Paper on Social Network Forensics accepted

Our paper has been accepted: Social Network Forensics: Tapping the Data Pool of Social Networks.

Wer klaut hier meine Daten: TU Forum

Internetsicherheit, Hacker und Datenschutz

Der weltweite freie Datenverkehr hat auch seine Schattenseiten: Unbekümmerte Internetuser gehen viel zu unvorsichtig mit ihren Daten um, wichtige Webseiten weisen oft ernste Schwachstellen auf, Hacker finden immer wieder neue Methoden, in Computersysteme einzudringen. Edgar Weippl (Institut für Softwaretechnik und Interaktive Systeme, TU Wien, sba-research), Christian Platzer und Gilbert Wondracek (Seclab, Institut für Rechnergestützte Automation, TU Wien) werden mögliche Gefahren aufzeigen, über Methoden von Hackern erzählen und gemeinsam diskutieren, ob es überhaupt jemals ein „sicheres“ Internet geben kann. (Termin, TU forum)

Guest talk: A Bird’s-Eye View of Optimal Codes and Symmetric Cryptography from Combinatorial Designs

A Bird’s-Eye View of Optimal Codes and Symmetric Cryptography from Combinatorial Designs

Dimitris E. Simos, Department of Mathematics, National Technical University of Athens,

 Abstract: In the past few decades, combinatorial design theory has grown to encompass a wider variety of investigations, many of which are not apparently motivated by any practical application. Rather, they are motivated by a desire to obtain a coherent and powerful theory of existence and properties of designs. Nevertheless, it comes as no surprise that applications in coding theory and communications continue to arise, and also that designs have found applications in new areas. Cryptography in particular has provided a new source of applications of designs in computer science, and simultaneously a field of new and challenging problems in design theory.

In this lecture, we present a number of applications of combinatorial designs in which the connection with classes of optimal codes and modern symmetric (private-key) cryptography appears to be substantial and meaningful. In the first part, we present some new results for self-dual codes and quasi-cyclic codes and exemplify some of their advantages in terms of encoding and decoding. In the continuum, we survey recent powerful private-key cryptosystems from special classes of combinatorial designs, that posses beautiful combinatorial properties. Practical aspects of the cryptosystems, in terms of security and cryptanalysis are analyzed and examples of real-time encryption and decryption are provided using cryptographic algorithms. We conclude, by providing a state-of-the-art comparison of private-key block ciphers in the field of modern cryptography.


Edgar Weippl is elected as vice president and will continue organizing the ECRIM fellowship program for Austria.

IT-SeCX 11.11.11: Social Snapshots

IT-SeCX 11.11.11: Markus Huber presents “Social Snapshots – Digitale Forensik für Soziale Netzwerke” at ITSeCX (more…)

SBA participates at the 2011 “IKT-Zentren Akademie”

Ulrich Bayer did hold a lesson on secure development of web applications at the “IKT-Zentren Akademie” of 2011. The talk included a theoretical and practical introduction to secure web application development and the most common attack vectors. (mehr…)

Sicherheitskonferenz Krems: Cloud Speicherdienste als Angriffsvektoren

Cloud Speicherdienste als Angriffsvektoren.

based on our Usenix Security 2011 Paper (Dark Clouds on the Horizon: Using Cloud Storage as Attack Vector and Online Slack Space), we will present some recent updates at the Sicherheitskonferenz Krems

Summerschool on Security and Privacy, Aug 2012

We will teach a course in the summer school in Italy…

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.