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, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the so-called bounded-storage model which is a special case of our setting. Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties
We present a simplified framework for proving sequential composability in the quantum setting. In pa...
Dîevice-independent quantum key distribution (DIQKD) is a formalism that supersedes traditional quan...
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits fol...
We show how to implement cryptographic primitives based on the realistic assumption that quantum sto...
Previously, we demonstrated that cryptographic primitives can be implemented based on the assumption...
It was shown in [42] that cryptographic primitives can be implemented based on the assumption that q...
Cryptographic primitives such as oblivious transfer and bit commitment are impossible to realize if ...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
This progress report presents the scientic results obtained in part A of my PhD studies at BRICS. We...
Cryptographic primitives such as oblivious transfer and bit commitment are impossible to realize if ...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
The noisy-storage model allows the implementation of secure two-party protocols under the sole assum...
Fundamental primitives such as bit commitment and oblivious transfer serve as building blocks for ma...
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks wi...
We present a simplified framework for proving sequential composability in the quantum setting. In pa...
Dîevice-independent quantum key distribution (DIQKD) is a formalism that supersedes traditional quan...
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits fol...
We show how to implement cryptographic primitives based on the realistic assumption that quantum sto...
Previously, we demonstrated that cryptographic primitives can be implemented based on the assumption...
It was shown in [42] that cryptographic primitives can be implemented based on the assumption that q...
Cryptographic primitives such as oblivious transfer and bit commitment are impossible to realize if ...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
This progress report presents the scientic results obtained in part A of my PhD studies at BRICS. We...
Cryptographic primitives such as oblivious transfer and bit commitment are impossible to realize if ...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming th...
The noisy-storage model allows the implementation of secure two-party protocols under the sole assum...
Fundamental primitives such as bit commitment and oblivious transfer serve as building blocks for ma...
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks wi...
We present a simplified framework for proving sequential composability in the quantum setting. In pa...
Dîevice-independent quantum key distribution (DIQKD) is a formalism that supersedes traditional quan...
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits fol...