5-Systemtest-Automatisierung_20160519

•

0 gefällt mir•72 views

Thomas Briner

Weitere ähnliche Inhalte

Mehr von Thomas Briner

Testgetriebene Datenmigration

Thomas Briner

IBM IS Directors Conference 2014, Interlaken Félix Mauron, Thomas Briner; Abraxas Informatik AG Wer eine Mobile-Strategie erfolgreich entwickeln und umsetzen will, muss komplett neu denken lernen. Neben einem sorgfältigen Gerätemanagement als Grundlage für einen sicheren Betrieb, bedarf es mehr als einer Mobilisierung bestehender Prozesse – nämlich eines neuen Prozessdesigns. Nur so kommen die Fähigkeiten mobiler Geräte voll zum Tragen. Um die neuen Prozesse in mobilen Applikationen individuell und doch wirtschaftlich abbilden zu können, muss ein Hersteller Pattern erkennen. Diese Muster wiederholen sich in vielen Arbeitsprozessen. Auf ihrer Basis lässt sich eine auf die spezifische Herausforderung zugeschnittene und integrierbare Applikation entwickeln. Ein solches Muster ist der Inspektionsprozess. Mit Abraxas Inspect hat Abraxas einen Lösungsbaukasten entwickelt, mit dem unterschiedlichste Inspektionsprozesse sicher auf Tablets gebracht werden können.

Mobile Computing verlangt nach neuen Denkansätzen

Thomas Briner

IT im Fokus, Praxisgespräche "Informationssicherheit", November 2013, Hotel Marriott, Zürich Risiken und Lösungen beim Mobile Computing Smartphones und Tablets unterscheiden sich nicht nur betreffend ihrer Grösse von Laptops. Im Windschatten ihres Siegeszuges sind neue Bedrohungen aufgetaucht, die neuer Antworten bedürfen. Thomas Briner zeigt, worauf es bei Lösungen für Smartphones und Tablets zu achten gilt.

Sicherheit im Mobile Computing

Thomas Briner

System Test Automation

Thomas Briner

Zero-Knowledge Proof-of-Knowledge protocols are of particular interest for authentication systems as developed for example in the IBM research laboratory in Zurich. There is an arbitrary number of protocol instances that vary in terms of protocol structure, additional restrictions on the preimages of the homomorphisms, but also regarding the homomorphisms and groups itself that are used. Depending on the concrete instance these protocols have certain properties that might be useful for such systems. The generation of a complete protocol instance for reasons of specification or testing is a very time-consuming and error prone piece of work. Therefore this process should be automated by the compiler that was developed during this diploma thesis. For this purpose an input language was created that allows to specify instances of a certain protocol type and to add additional types of checks using some auxiliary parameters. The user has the choice between different levels of abstraction in specifying a certain protocol instance. The compiler itself is written in java and is based on the traditional object-oriented compiler design patterns. It contains in its library the basic skeleton of the well-known Sigma protocol and of the 2Sigma protocol that was developed in the research lab. The compiler reads the input files with the protocol specifications written in the input language mentioned above and checks for syntactical correctness. Furthermore some semantic checks on the proper use of the protocol parameters are performed. From these informations the compiler generates the protocol instance either written as latex code or as java source code. The latex code shows the detailed specification of the protocol instance consisting of the documentation of the involved algebraic elements, the facts that can be deduced in case of acceptance of the proof and all the steps performed during the protocol execution. In case of java code generation it produces runnable java source code. This code is based on an interface hierarchy that was developed during this diploma thesis as well. At runtime the protocol instance has to be instantiated with concrete implementations and can then be used for example for testing reasons.

Compiler for Zero-Knowledge Proof-of-Knowledge Protocols

Thomas Briner

Electronic Voting in the Standard Model Thomas Briner September 2003 Electronic voting schemes that claim to satisfy the property of receipt-freeness usually need strong physical assumptions which are not available in real life. In this paper we present a protocol that achieves receipt-freeness in a threshold model without unrealistic assumptions. It is designed for large scale votes. It uses an existing type of untappable channels for the initialization of a vote but only usual internet connections for the voting phase. The untappable channels are needed only in order to achieve receipt-freeness but are not mandatory for all other properties. The protocol achieves receipt-freeness by allowing each voter to convince a votebuyer who is willing to pay for a certain vote even though the voter casted an arbitrary vote. Even if the votebuyer is able to eavesdrop all channels between voters and authorities except for the untappable ones, it is indistinguishable for him whether or not the voter is telling the truth. In case of coercion, a voter who is forced to cast a certain vote is still able to make sure that the vote will be considered invalid and therefore ignored by the authorities without giving the coercer the opportunity to figure it out. All these properties hold under the assumption that no authority cooperates with a votebuyer or blackmailer. A dishonest authority is able to prevent a voter from casting a vote. This cannot be prevented but at least it will be detected that some irregularity has occurred. It is possible that the correctness of the result can be influenced by dishonest authorities, but in a context of a large scale vote, the level of overall correctness can still be judged by detecting the number of such irregularities and comparing it to the result. Universal verifiability is not achieved with this protocol. The protocol is based on a threshold on the number of honest authorities. This is no loss compared to the protocols that claim to have the property of universal verifiability in theory as they need additional elements e.g. a kind of bulletin board that do not exist in real life. To implement this bulletin board it has to be simulated by the authorities and therefore depends on the honesty of those authorities too.

Electronic Voting in the Standard Model

Thomas Briner

Mehr von Thomas Briner (6)

Testgetriebene Datenmigration

Mobile Computing verlangt nach neuen Denkansätzen

Sicherheit im Mobile Computing

System Test Automation

Compiler for Zero-Knowledge Proof-of-Knowledge Protocols

Electronic Voting in the Standard Model

5-Systemtest-Automatisierung_20160519

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Mehr von Thomas Briner

Mehr von Thomas Briner (6)