English
Related papers

Related papers: Low Ambiguity in Strong, Total, Associative, One-W…

200 papers

We show that some problems in information security can be solved without 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…

Cryptography and Security · Computer Science 2013-01-23 Dima Grigoriev , Vladimir Shpilrain

The existence of one-way functions is one of the most fundamental assumptions in classical cryptography. In the quantum world, on the other hand, there are evidences that some cryptographic primitives can exist even if one-way functions do…

Quantum Physics · Physics 2024-05-09 Tomoyuki Morimae , Takashi Yamakawa

We show that if $y=(y_n)_{n\ge 1}$ is a bounded sequence with zero average along every infinite arithmetic progression then for every $N\ge 2$ there exist (unilateral or bilateral) subshifts $\Sigma$ over $N$ symbols, with entropy…

Dynamical Systems · Mathematics 2016-11-08 Tomasz Downarowicz , Jacek Serafin

Conway's real closed field $\mathbf{No}$ of surreal numbers is a sweeping generalization of the real numbers and the ordinals to which a number of elementary functions such as log and exponentiation have been shown to extend. The problems…

Logic · Mathematics 2024-07-08 Ovidiu Costin , Philip Ehrlich

In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string…

Computational Complexity · Computer Science 2008-02-21 Arist Kojevnikov , Sergey I. Nikolenko

We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribution of binary strings over which it is hard to approximate…

Cryptography and Security · Computer Science 2024-10-08 Bruno P. Cavalar , Eli Goldin , Matthew Gray , Peter Hall

In 2013, Farid and Vasiliev [arXiv:quant-ph/1310.4922] for the first time proposed a way to construct a protocol for the realisation of "{\em Classical to Quantum}" one-way hash function, a derivative of the Quantum one-way function as…

Quantum Physics · Physics 2018-10-10 Amit Behera , Goutam Paul

We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…

Classical Analysis and ODEs · Mathematics 2018-04-16 Richard R. Hall , Eli Hawkins , Bernard S. Kay

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

Computational Complexity · Computer Science 2023-07-19 Stefan Rass

Sponge hashing is a widely used class of cryptographic hash algorithms which underlies the current international hash function standard SHA-3. In a nutshell, a sponge function takes as input a bit-stream of any length and processes it via a…

Quantum Physics · Physics 2025-01-17 Joseph Carolan , Alexander Poremba

We give examples of $L^{1}$-functions that are essentially unbounded on every nonempty open subset of their domains of definition. We obtain such functions as limits of weighted sums of functions with the unboundedly increasing number of…

Classical Analysis and ODEs · Mathematics 2010-10-05 Alexander A. Kovalevsky

We consider Gomory and Johnson's infinite group model with a single row. Valid inequalities for this model are expressed by valid functions and it has been recently shown that any valid function is dominated by some nonnegative valid…

Optimization and Control · Mathematics 2018-02-06 Amitabh Basu , Michele Conforti , Marco Di Summa

The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on ''most'' inputs in a simple and…

Computational Complexity · Computer Science 2008-02-27 Alex D. Myasnikov

We consider Bergman spaces and variations of them in one or several complex variables. For some domains we show that in these spaces the generic function is totally unbounded and hence non - extendable. We also show that the generic…

Complex Variables · Mathematics 2017-04-10 T. Hatziafratis , K. Kioulafa , V. Nestoridis

We show that the existence of a coin-flipping protocol safe against \emph{any} non-trivial constant bias (\eg $.499$) implies the existence of one-way functions. This improves upon a recent result of Haitner and Omri [FOCS '11], who proved…

Cryptography and Security · Computer Science 2021-05-05 Itay Berman , Iftach Haitner , Aris Tentes

We construct a classical oracle relative to which $\mathsf{P} = \mathsf{NP}$ but quantum-computable quantum-secure trapdoor one-way functions exist. This is a substantial strengthening of the result of Kretschmer, Qian, Sinha, and Tal (STOC…

Quantum Physics · Physics 2025-09-18 William Kretschmer , Luowen Qian , Avishay Tal

We investigate quantum analogues of collision resistance and obtain separations between quantum ``one-way'' and ``collision-resistant'' primitives. 1. Our first result studies one-wayness versus collision-resistance defined over quantum…

A gap in the proof of the main result in reference [1] in our original submission propagated into the constructions presented in the first version of our manuscript. In this version we give an alternative proof for the existence of…

Differential Geometry · Mathematics 2023-06-23 Diego Corro , Fernando Galaz-Garcia

It is shown that given a metric space $X$ and a $\sigma$-finite positive regular Borel measure $\mu$ on $X$, there exists a bounded continuous real-valued function on $X$ that is one-to-one on the complement of a set of $\mu$ measure zero.

General Topology · Mathematics 2017-07-05 Alexander J. Izzo

Given an $r$-uniform hypergraph $H=(V,E)$ and a weight function $\omega:E\to\{1,\dots,w\}$, a coloring of vertices of $H$, induced by $\omega$, is defined by $c(v) = \sum_{e\ni v} w(e)$ for all $v\in V$. If there exists such a coloring that…

Combinatorics · Mathematics 2015-12-11 Patrick Bennett , Andrzej Dudek , Alan Frieze , Laars Helenius