Results 11  20
of
16,715
Cryptography without oneway functions
, 2011
"... We show that some problems in cryptography can be solved without using oneway functions. The latter are usually regarded as a central concept of cryptography, but the very existence of oneway functions depends on difficult conjectures in complexity theory, most notably on the notorious “P ̸ = NP ..."
Abstract
 Add to MetaCart
We show that some problems in cryptography can be solved without using oneway functions. The latter are usually regarded as a central concept of cryptography, but the very existence of oneway functions depends on difficult conjectures in complexity theory, most notably on the notorious “P ̸ = NP
On hardness amplification of oneway functions
 IN PROC. 2ND TCC
, 2005
"... We continue the study of the efficiency of blackbox reductions in cryptography. We focus on the question of constructing strong oneway functions (respectively, permutations) from weak oneway functions (respectively, permutations). To make our impossibility results stronger, we focus on the weake ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We continue the study of the efficiency of blackbox reductions in cryptography. We focus on the question of constructing strong oneway functions (respectively, permutations) from weak oneway functions (respectively, permutations). To make our impossibility results stronger, we focus
SECRECY WITHOUT ONEWAY FUNCTIONS
"... Abstract. We show that some problems in information security can be solved without using oneway functions. The latter are usually regarded as a central concept of cryptography, but the very existence of oneway functions depends on difficult conjectures in complexity theory, most notably on the not ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We show that some problems in information security can be solved without using oneway functions. The latter are usually regarded as a central concept of cryptography, but the very existence of oneway functions depends on difficult conjectures in complexity theory, most notably
OneWay Functions and the Isomorphism Conjecture
, 2009
"... We study the Isomorphism Conjecture proposed by Berman and Hartmanis. It states that all sets complete for NP under polynomialtime manyone reductions are Pisomorphic to each other. From previous research it has been widely believed that all NPcomplete sets are reducible each other by onetoone ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
and lengthincreasing polynomialtime reductions, but we may not hope for the full pisomorphism due to the existence of oneway functions. Here we showed two results on the relation between oneway functions and the Isomorphism Conjecture. Firstly, we imporve the result of Agrawal [Agrawal, CCC’02] to show
Using OneWay Functions for Authentication
 Computer Communication Review
, 1989
"... Techniques are suggested to construct authentication protocols on a basis of oneway functions rather than encryption algorithms. This approach is thought of interest for several reasons. It appears that this approach could achieve, at least, equally simple and capable protocols. 1 Introduction In ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
Techniques are suggested to construct authentication protocols on a basis of oneway functions rather than encryption algorithms. This approach is thought of interest for several reasons. It appears that this approach could achieve, at least, equally simple and capable protocols. 1 Introduction
Symmetry of Information and OneWay Functions
 Inform. Proc. letters
, 1993
"... Symmetry of information (in Kolmogorov complexity) is a concept that comes from formalizing the idea of how much information about a string y is contained in a string x. The situation is symmetric because it can be shown that the amount of information contained in the string y about the string x is ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
for polynomial time bounds, then oneway functions cannot exist. 1 Introduction Keywords: computational complexity, Kolmogorov complexity, oneway functions. In probability theory, the phenomenon of dependence between random variables is well known. Cast in terms of classical Shannon entropy [Sha48, Sha49
III. Physical OneWay Functions
"... Abstract How can we assign unique, tamperresistant, and unforgeable identifiers to everyday objects at a very low cost? Physical OneWay Functions (POWFs) provide a novel approach to answering this question. POWFs can be obtained from the inherent threedimensional microstructure of a large class o ..."
Abstract
 Add to MetaCart
Abstract How can we assign unique, tamperresistant, and unforgeable identifiers to everyday objects at a very low cost? Physical OneWay Functions (POWFs) provide a novel approach to answering this question. POWFs can be obtained from the inherent threedimensional microstructure of a large class
On the existence of extractable oneway functions
, 2014
"... A function f is extractable if it is possible to algorithmically “extract,” from any adversarial program that outputs a value y in the image of f, a preimage of y. When combined with hardness properties such as onewayness or collisionresistance, extractability has proven to be a powerful tool. How ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
A function f is extractable if it is possible to algorithmically “extract,” from any adversarial program that outputs a value y in the image of f, a preimage of y. When combined with hardness properties such as onewayness or collisionresistance, extractability has proven to be a powerful tool
OneWay Functions and Balanced NP
 Theoretical Computer Science
"... The existence of cryptographically secure oneway functions is related to the measure of a subclass of NP. This subclass, called fiNP ("balanced NP"), contains 3SAT and other standard NP problems. The hypothesis that fiNP is not a subset of P is equivalent to the P 6= NP conjecture. A str ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The existence of cryptographically secure oneway functions is related to the measure of a subclass of NP. This subclass, called fiNP ("balanced NP"), contains 3SAT and other standard NP problems. The hypothesis that fiNP is not a subset of P is equivalent to the P 6= NP conjecture. A
Simultaneous Resettable WI from Oneway Functions
, 2013
"... In this short note, we demonstrate that the existence of oneway functions implies the existence of an ω(1)round simultaneously resettable witness indistinguishable argument of knowledge. 1 ..."
Abstract
 Add to MetaCart
In this short note, we demonstrate that the existence of oneway functions implies the existence of an ω(1)round simultaneously resettable witness indistinguishable argument of knowledge. 1
Results 11  20
of
16,715