International Association for Cryptologic Research
The authors show that some problems in information security can be solved with-out using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious \"P 6= NP\" conjecture. This is why cryptographic primitives that do not employ one-way functions are often called \"Unconditionally secure\". In this paper, they suggest 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.