English
Related papers

Related papers: Commitment Schemes from OWFs with Applications to …

200 papers

Narrowband Internet of Things (NB-IoT) is a wireless communication technology that enables a wide range of applications, from smart cities to industrial automation. As a part of the 5G extension, NB-IoT promises to connect billions of…

Cryptography and Security · Computer Science 2023-09-08 Kadir Sabanci , Mumin Cebe

We describe new unconditionally secure bit commitment schemes whose security is based on Minkowski causality and the monogamy of quantum entanglement. We first describe an ideal scheme that is purely deterministic, in the sense that neither…

Quantum Physics · Physics 2015-09-17 Emily Adlam , Adrian Kent

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long…

Quantum Physics · Physics 2010-08-03 Iordanis Kerenidis , Stephanie Wehner

Unconditionally secure quantum bit commitment (QBC) was widely believed to be impossible for more than two decades. But recently, based on an anomalous behavior found in quantum steering, we proposed a QBC protocol which can be…

Quantum Physics · Physics 2023-07-25 Guang Ping He

Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the…

Quantum Physics · Physics 2007-05-23 Stefan Wolf , Jürg Wullschleger

A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum…

Quantum Physics · Physics 2021-04-14 Anne Broadbent , Sevag Gharibian , Hong-Sheng Zhou

We construct simulation-secure one-time memories (OTM) in the random oracle model, and present a plausible argument for their security against quantum adversaries with bounded and adaptive depth. Our contributions include: (1) A simple…

Quantum Physics · Physics 2026-03-17 Lev Stambler

Due to the commonly known impossibility results, unconditional security for oblivious transfer is seen as impossible even in the quantum world. In this paper, we try to overcome these impossibility results by proposing a protocol which is…

Quantum Physics · Physics 2010-04-29 K. Y. Cheong , Min-Hsiu Hsieh , Takeshi Koshiba

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger…

In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but…

Quantum Physics · Physics 2015-05-27 Adrian Kent

Quantum computing is rapidly advancing toward cloud-based services, raising significant concerns about the privacy and security of computations outsourced to untrusted quantum servers. Universal Blind Quantum Computation (UBQC) protocols…

Quantum Physics · Physics 2025-08-07 Youngkyung Lee , Doyoung Chung

We present a robust and composable device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices in the bounded storage model in which the (honest and cheating) devices and parties have…

Quantum Physics · Physics 2026-04-13 Rishabh Batra , Sayantan Chakraborty , Rahul Jain , Upendra Kapshikar

In this paper, we describe an attack against one of the Oblivious-Transfer-based blind signatures scheme, proposed in [1]. An attacker with a primitive capability of producing specific-range random numbers, while exhibiting a partial MITM…

Cryptography and Security · Computer Science 2009-11-10 Stylianos Basagiannis , Panagiotis Katsaros , Andrew Pombortsis

The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications,…

Quantum Physics · Physics 2007-05-23 Horace P. Yuen

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is…

Quantum Physics · Physics 2007-05-23 Horace P. Yuen

Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network. Although it is possible with two servers, any existing protocol works only with classical messages. We propose…

Quantum Physics · Physics 2024-09-10 Masahito Hayashi , Seunghoan Song

Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios,…

Cryptography and Security · Computer Science 2015-03-19 Michael Backes , Ian Goldberg , Aniket Kate , Tomas Toft

This article describes a quantum bit commitment protocol, QBC1, based on entanglement destruction via forced measurements and proves its unconditional security.

Quantum Physics · Physics 2012-12-06 Horace P. Yuen

It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller…

Quantum Physics · Physics 2009-10-30 Hoi-Kwong Lo

Bit commitment (BC) is an important cryptographic primitive for an agent to convince a mutually mistrustful party that she has already made a binding choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC protocol…

Quantum Physics · Physics 2014-11-20 H. F. Chau , C. -H. Fred Fung , H. -K. Lo
‹ Prev 1 4 5 6 7 8 10 Next ›