The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
Stephanie Wehner - One of the best experts on this subject based on the ideXlab platform.
-
Continuous-variable protocol for oblivious transfer in the noisy-Storage Model
Nature Communications, 2018Co-Authors: Fabian Furrer, Christian Schaffner, Tobias Gehring, Christoph Pacher, Roman Schnabel, Stephanie WehnerAbstract:Oblivious transfer is a standard primitive for cryptography between two parties which do not trust each other. Here, the authors propose a continuous-variable protocol which is secure against a dishonest party with bounded quantum Storage capacity, and realize a proof-of-principle implementation.AbstractCryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We present and experimentally demonstrate here a quantum protocol for oblivious transfer for optical continuous-variable systems, and prove its security in the noisy-Storage Model. This Model allows us to establish security by sending more quantum signals than an attacker can reliably store during the protocol. The security proof is based on uncertainty relations which we derive for continuous-variable systems, that differ from the ones used in quantum key distribution. We experimentally demonstrate in a proof-of-principle experiment the proposed oblivious transfer protocol for various channel losses by using entangled two-mode squeezed states measured with balanced homodyne detection. Our work enables the implementation of arbitrary two-party quantum cryptographic protocols with continuous-variable communication systems.
-
An experimental implementation of oblivious transfer in the noisy Storage Model.
Nature Communications, 2014Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Nikolay Gigov, Gregor WeihsAbstract:The oblivious transfer protocol is a cryptographic primitive used to create many different secure two-party schemes. Here, Erven et al. provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy Storage Model.
-
Experimental implementation of bit commitment in the noisy-Storage Model
Nature Communications, 2012Co-Authors: Siddarth Koduru Joshi, Chia Chen Ming, Christian Kurtsiefer, Stephanie WehnerAbstract:In quantum communication, the noisy-Storage Model assumes that an attacker’s memory device is imperfect, thus enabling two parties to implement protocols securely. Using polarization-entangled photon pairs, Ng et al. analyse and verify a two-party bit commitment protocol within the noisy-Storage.
-
Experimental implementation of oblivious transfer in the noisy Storage Model
Conference on Lasers and Electro-Optics 2012, 2012Co-Authors: Chris Erven, Stephanie Wehner, Raymond Laflamme, Gregor WeihsAbstract:We report on the first experimental implementation of 1–2 random oblivious transfer in the noisy Storage Model using a modified entangled quantum key distribution (QKD) system implementing Schaffner's simple protocol.
-
ICALP (2) - Composable Security in the Bounded-Quantum-Storage Model
Automata Languages and Programming, 2008Co-Authors: Stephanie Wehner, Jürg WullschlegerAbstract:We give a new, simulation-based, definition for security in the bounded-quantum-Storage Model, and show that this definition allows for sequential composition of protocols. Damgard et al.(FOCS '05, CRYPTO '07) showed how to securely implement bit commitment and oblivious transfer in the bounded-quantum-Storage Model, where the adversary is only allowed to store a limited number of qubits. However, their security definitions did only apply to the standalone setting, and it was not clear if their protocols could be composed. Indeed, we show that these protocols are notcomposable in our framework without a small refinement. We then prove the security of their randomized oblivious transfer protocol with our refinement. Secure implementations of oblivious transfer and bit commitment follow easily by a (classical) reduction to randomized oblivious transfer.
Wei Wang - One of the best experts on this subject based on the ideXlab platform.
-
path materialization revisited an efficient Storage Model for xml data
Australasian Database Conference, 2002Co-Authors: Haifeng Jiang, Wei WangAbstract:XML is emerging as a new major standard for representing data on the world wide web. Several XML Storage Models have been proposed to store XML data in different database management systems. The unique feature of Model-mapping-based approaches is that no DTD information is required for XML data Storage. In this paper, we present a new Model-mapping-based Storage Model, called XParent. Unlike the existing work on Model-mapping-based approaches that emphasized on converting XML documents to/from database schema and translation of XML queries into SQL queries, in this paper, we focus ourselves on the effectiveness of Storage Models in terms of query processing. We study the key issues that affect query performance, namely, Storage schema design (storing XML data across multiple tables) and path materialization (storing path information in databases). We show that similar but different Storage Models significantly affect query performance. A performance study is conducted using three data sets and query sets. The experimental results are presented.
-
Australasian Database Conference - Path materialization revisited: an efficient Storage Model for XML data
2002Co-Authors: Haifeng Jiang, Wei WangAbstract:XML is emerging as a new major standard for representing data on the world wide web. Several XML Storage Models have been proposed to store XML data in different database management systems. The unique feature of Model-mapping-based approaches is that no DTD information is required for XML data Storage. In this paper, we present a new Model-mapping-based Storage Model, called XParent. Unlike the existing work on Model-mapping-based approaches that emphasized on converting XML documents to/from database schema and translation of XML queries into SQL queries, in this paper, we focus ourselves on the effectiveness of Storage Models in terms of query processing. We study the key issues that affect query performance, namely, Storage schema design (storing XML data across multiple tables) and path materialization (storing path information in databases). We show that similar but different Storage Models significantly affect query performance. A performance study is conducted using three data sets and query sets. The experimental results are presented.
Haifeng Jiang - One of the best experts on this subject based on the ideXlab platform.
-
path materialization revisited an efficient Storage Model for xml data
Australasian Database Conference, 2002Co-Authors: Haifeng Jiang, Wei WangAbstract:XML is emerging as a new major standard for representing data on the world wide web. Several XML Storage Models have been proposed to store XML data in different database management systems. The unique feature of Model-mapping-based approaches is that no DTD information is required for XML data Storage. In this paper, we present a new Model-mapping-based Storage Model, called XParent. Unlike the existing work on Model-mapping-based approaches that emphasized on converting XML documents to/from database schema and translation of XML queries into SQL queries, in this paper, we focus ourselves on the effectiveness of Storage Models in terms of query processing. We study the key issues that affect query performance, namely, Storage schema design (storing XML data across multiple tables) and path materialization (storing path information in databases). We show that similar but different Storage Models significantly affect query performance. A performance study is conducted using three data sets and query sets. The experimental results are presented.
-
Australasian Database Conference - Path materialization revisited: an efficient Storage Model for XML data
2002Co-Authors: Haifeng Jiang, Wei WangAbstract:XML is emerging as a new major standard for representing data on the world wide web. Several XML Storage Models have been proposed to store XML data in different database management systems. The unique feature of Model-mapping-based approaches is that no DTD information is required for XML data Storage. In this paper, we present a new Model-mapping-based Storage Model, called XParent. Unlike the existing work on Model-mapping-based approaches that emphasized on converting XML documents to/from database schema and translation of XML queries into SQL queries, in this paper, we focus ourselves on the effectiveness of Storage Models in terms of query processing. We study the key issues that affect query performance, namely, Storage schema design (storing XML data across multiple tables) and path materialization (storing path information in databases). We show that similar but different Storage Models significantly affect query performance. A performance study is conducted using three data sets and query sets. The experimental results are presented.
Rajeev Ranjan Sahay - One of the best experts on this subject based on the ideXlab platform.
-
Predicting Transient Storage Model Parameters of Rivers by Genetic Algorithm
Water Resources Management, 2012Co-Authors: Rajeev Ranjan SahayAbstract:The presence of transient Storage zone modifies the riverine pollutant transport. In the present work, new empirical expressions for three key parameters of transient Storage Model (TSM), an important method for predicting concentration variation of pollutants in rivers, have been derived employing genetic algorithm on published hydraulic data on river reaches and TSM parameters. The proposed expressions use few hydraulic and geometric characteristics of rivers that are usually available. Based on various performance indices, it can be concluded that the proposed expressions predict TSM parameters more reliably in comparison to the other empirical expressions for predicting TSM parameters.
Antonio Acín - One of the best experts on this subject based on the ideXlab platform.
-
Security of Device-Independent Quantum Key Distribution in the Bounded-Quantum-Storage Model
Physical Review X, 2013Co-Authors: Stefano Pironio, Lluis Masanes, Anthony Leverrier, Antonio AcínAbstract:Device-independent quantum key distribution (DIQKD) is a formalism that supersedes traditional quantum key distribution, as its security does not rely on any detailed Modeling of the internal working of the devices. This strong form of security is only possible using devices producing correlations that violate a Bell inequality. Full security proofs of DIQKD have recently been reported, but they tolerate zero or small amounts of noise and are restricted to protocols based on specific Bell inequalities. Here, we provide a security proof of DIQKD that is both more efficient and noise resistant, and also more general, as it applies to protocols based on arbitrary Bell inequalities and can be adapted to cover supraquantum eavesdroppers limited by the no-signaling principle only. It is formulated, however, in the bounded-quantum-Storage Model, where an upper bound on the adversary's quantum memory is a priori known. This condition is not a limitation at present, since the best existing quantum memories have very short coherence times.
