1 citations · 2 across the 3 of their papers we have counts for
4 papers
On the Gold Standard for Security of Universal Steganography
Sebastian Berndt, Maciej Liśkiewicz
While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key count…
Algorithm Substitution Attacks from a Steganographic Perspective
Sebastian Berndt, Maciej Liskiewicz
The goal of an algorithm substitution attack (ASA), also called a subversion attack (SA), is to replace an honest implementation of a cryptographic tool by a subverted one which al…
A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
Maciej Liskiewicz, Martin R. Schuster
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an -vertex graph…
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independentl…