J
Jörn Müller-Quade
Researcher at Karlsruhe Institute of Technology
Publications - 119
Citations - 1922
Jörn Müller-Quade is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Universal composability & Oblivious transfer. The author has an hindex of 24, co-authored 114 publications receiving 1799 citations. Previous affiliations of Jörn Müller-Quade include Forschungszentrum Informatik & University of Tokyo.
Papers
More filters
Journal ArticleDOI
Composability in quantum cryptography
Jörn Müller-Quade,Renato Renner +1 more
TL;DR: This article explains the universal composability (UC) framework and state the composition theorem that guarantees that secure protocols can securely be composed to larger applications and shows how to generate a continuous key stream by sequentially composing rounds of a QKD protocol.
Book ChapterDOI
Bingo voting: secure and coercion-free voting using a trusted random number generator
TL;DR: A new verifiable and coercion-free voting scheme Bingo Voting is presented, which is based on a trusted random number generator, which shows the practicality of the scheme: all costly computations can be moved to a non time critical pre-voting phase.
Posted Content
Bingo Voting: Secure and coercion-free voting using a trusted random number generator.
TL;DR: Bingo Voting as mentioned in this paper is a voting scheme based on a trusted random number generator that allows the voter to contribute randomness to the voting scheme, which can be used to avoid vote buying attacks.
Book ChapterDOI
Universally Composable Commitments Using Random Oracles
TL;DR: The use of random oracles to achieve universal composability of commitment protocols is motivated and two constructions are given which allow to turn a given non-interactive commitment scheme into a non-Interactive universally composable commitment scheme in the random oracle model.
Book ChapterDOI
Unconditional and composable security using a single stateful tamper-proof hardware token
TL;DR: This work presents the first protocol realizing universally composable two-party computations with information-theoretic security using only one single tamper-proof device issued by one of the mutually distrusting parties.