One-Way Functions Imply Secure Computation in a Quantum World

Secure multiparty computation without one-way functions

We describe protocols for secure computation of the sum, product, and some other functions of two or more elements of an arbitrary constructible ring, without using any one-way functions. One of the new inputs that we offer here is that, in contrast with other proposals, we conceal intermediate results of a computation. For example, when we compute the sum of k numbers, only the final result is...

One-way Quantum Computation A tutorial introduction

The circuit model of quantum computation [1, 2, 3] has been a powerful tool for the development of quantum computation, acting as both a framework for theoretical investigations and as a guide for experiment. In the circuit model (also called the network model), unitary operations are represented by a network of elementary quantum gates, for example the CNOT gate and single-qubit operations. Ma...

Secure Introduction of One-Way Functions

Conditions are given under which a one-way function can be used safely in a programming language. The security proof involves showing that secrets cannot be leaked easily by any program meeting the conditions unless breaking the one-way function is easy. The result is applied to a password system where passwords are stored in a public file as images under a one-way function.1

Provably Secure One-Way Hash Functions

This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...

The One Way to Quantum Computation