PSPeter Schartner

Peter Schartner

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Peter Schartner has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    False-Bottom Encryption: Deniable Encryption From Secret Sharing

    by Shahzad Ahmad, Stefan Rass, Peter Schartner

    We show how to implement a deniable encryption method from secret sharing. Unlike the related concept of honey encryption, which employs a preprocessing step in symmetric encryption to re-shape the distribution of a plaintext towards making the real plaintext indistinguishable from a ciphertext for a fake message, we can avoid both, computational intractability assumptions and preprocessing of the data. This accomplishes deniability against an attacker that can force decryptions, and it can brute-force break a ciphertext with sufficient computational power. Following the concept of plausible deniability, we herein have different decryption keys to open up distinct plaintexts from within the same ciphertext. For instance, a plaintext revealed from a ciphertext with a key which was shared by a victim under duress, will convince the attacker that it is real, while the actual secret remains unnoticed. False Bottom Encryption constructs a symmetric scheme (in the sense of using the same key to encrypt and decrypt) that shares the properties of both honey encryption and deniable encryption. We specifically formalize and differentiate “deniable” from “plausibly deniable” as a security feature, showing how plausible deniability falls back to (only) deniability, depending on the plaintext distribution. Our scheme is simple, lightweight to implement and efficient in terms of encryption and decryption, and is based on secret sharing. As such, we do not rely on computational intractability. We corroborate the construction by giving numeric examples and providing implementations of the method as a Jupyter notebook supplementary to this work.


  • Open Access

    Generic Parity-Based Concurrent Error Detection for Lightweight ARX Ciphers

    by Sergei Bauer, Stefan Rass, Peter Schartner

    Cryptographic functions for constrained processing environments can be devised using lightweight cryptography. For use in safety relevant automotive applications where transient faults can occur at runtime the calculation of a cipher text requires verification. We propose an algorithm to generate a group parity based concurrent error detection for generic ciphers based on addition, rotation and XOR (ARX). The generated function is capable of detecting odd hamming weight faults according to the single event error model used in automotive applications. The the generated fault detection scheme is smaller in circuit size than presently existing concurrent error detection schemes and can be executed parallel to the cryptographic function. We provide a proof for the correctness of the generated prediction function and estimate the circuit complexity in terms of size and depth. We evaluate our solution in terms of gate count and throughput on IC synthesis level.


  • Open Access

    Smart city technology meets smart health assistive systems - on the example of the project AYUDO

    by Daniela Elisabeth Ströckl, Elena Oberrauner, Johanna Plattner, Claudia Steinberger, Vladimir A. Shekhovtsov, Gerhard Leitner, Christian Kop, Peter Schartner

    Active and Assisted Living (AAL) systems have been developed over the last decade to improve the quality of life, independence and well-being of the elderly. In the future, there will be an increased need to embed context sensitive AAL systems in an existing smart environment, equipped with built-in sensors, wearable sensors or smart devices. Especially in the health sector, AAL system architectures show similarities with application architectures in the field of Smart Homes or Smart Cities. In all these domains the use of context-based middleware is essential. Internet of Things (IoT) platforms, which are used particularly in the area of Smart Homes or Smart Cities, deal with a wider range of data than AAL middleware, for which there is no generally accepted solution yet. The aim of this paper is to present a flexible, model-based coupling of context-based middleware, which is widely accepted especially in the field of Smart Cities, with standard interfaces for use in the AAL area. In this paper we use the project AYUDO as an AAL use case and FIWARE, an open IoT middleware platform, as a context-based middleware candidate for this coupling.


  • Authentic Quantum Nonces

    by Stefan Rass, Peter Schartner


  • Security for the Robot Operating System

    by Bernhard Dieber, Benjamin Breiling, Sebastian Taurer, Severin Kacianka, Stefan Rass, Peter Schartner


  • Quantum key distribution and Denial-of-Service: Using strengthened classical cryptography as a fallback option

    by Peter Schartner, Stefan Rass

    Within quantum networks (employing quantum key distribution - QKD), the attacker has no chance to get hold of the established keys (most commonly used as one time pads) without being detected by the communicating parties. So the attacker might change his strategy to denial of service in order to inhibit the efficient usage of the quantum-key-distribution-links and one-time-pad-encryption and hence to force the use of classical (a)symmetric cryptography. In this paper we will propose a method for strengthening classical cryptographic algorithms by the use of small amounts of one time pads, so that these algorithms can be used for an emergency operation when suffering a Denial-of-Service attack and during the time needed to fix it. Additional scenarios of using the presented approach include the down time of QKD-links or QKD-devices in case of failure or maintenance.