Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Wullschleger, Jürg"'
Autor:
Wullschleger, Jürg.
Diss., Eidgenössische Technische Hochschule ETH Zürich, Nr. 17125, 2007.
Externí odkaz:
http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17125
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Winkler, Severin, Wullschleger, Jürg
Publikováno v:
IEEE Trans. Inf. Th., vol. 60, no. 6, p. 1-21 (2014)
We provide bounds on the efficiency of secure one-sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results we derive bounds on the efficiency of protocols that us
Externí odkaz:
http://arxiv.org/abs/1205.5136
Publikováno v:
Commun. Math. Phys. 328, 251 (2014)
If a quantum system A, which is initially correlated to another system, E, undergoes an evolution separated from E, then the correlation to E generally decreases. Here, we study the conditions under which the correlation disappears (almost) completel
Externí odkaz:
http://arxiv.org/abs/1012.6044
Autor:
Wullschleger, Jürg
Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum knowledge. Th
Externí odkaz:
http://arxiv.org/abs/1012.2291
Autor:
Hänggi, Esther, Wullschleger, Jürg
Publikováno v:
Proceedings of TCC 2011, p 468-485
Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a tight bou
Externí odkaz:
http://arxiv.org/abs/1009.4741
Publikováno v:
IEEE Trans. Inf. Th., vol. 58, no. 3, p. 1962-1984 (2012)
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment,
Externí odkaz:
http://arxiv.org/abs/0906.1030
Publikováno v:
IEEE Transactions on Information Theory, Vol. 57, No. 3, pp. 1770 -1779, 2011
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives
Externí odkaz:
http://arxiv.org/abs/0811.3589
Autor:
Wehner, Stephanie, Wullschleger, Jürg
Publikováno v:
Proceedings of ICALP 2008, pages 604--615
We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequ
Externí odkaz:
http://arxiv.org/abs/0709.0492
Autor:
Wullschleger, Jürg
Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way for both par
Externí odkaz:
http://arxiv.org/abs/cs/0608076