Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
16,715
Cryptography without one-way functions
, 2011
"... We show that some problems in cryptography 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 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 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 ̸ = NP
On hardness amplification of one-way functions
- IN PROC. 2ND TCC
, 2005
"... We continue the study of the efficiency of black-box reductions in cryptography. We focus on the question of constructing strong one-way functions (respectively, permutations) from weak one-way 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 black-box reductions in cryptography. We focus on the question of constructing strong one-way functions (respectively, permutations) from weak one-way functions (respectively, permutations). To make our impossibility results stronger, we focus
SECRECY WITHOUT ONE-WAY FUNCTIONS
"... Abstract. 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 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 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
One-Way 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 polynomial-time many-one reductions are P-isomorphic to each other. From previous research it has been widely believed that all NP-complete sets are reducible each other by one-to-one ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
and length-increasing polynomial-time reductions, but we may not hope for the full p-isomorphism due to the existence of one-way functions. Here we showed two results on the relation between one-way functions and the Isomorphism Conjecture. Firstly, we imporve the result of Agrawal [Agrawal, CCC’02] to show
Using One-Way Functions for Authentication
- Computer Communication Review
, 1989
"... Techniques are suggested to construct authentication protocols on a basis of one-way 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 one-way 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 One-Way 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 one-way functions cannot exist. 1 Introduction Keywords: computational complexity, Kolmogorov complexity, one-way 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 One-Way Functions
"... Abstract How can we assign unique, tamper-resistant, and unforgeable identifiers to everyday objects at a very low cost? Physical One-Way 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, tamper-resistant, and unforgeable identifiers to everyday objects at a very low cost? Physical One-Way 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 one-way 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 one-wayness or collision-resistance, 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 one-wayness or collision-resistance, extractability has proven to be a powerful tool
One-Way Functions and Balanced NP
- Theoretical Computer Science
"... The existence of cryptographically secure one-way 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 one-way 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 One-way Functions
, 2013
"... In this short note, we demonstrate that the existence of one-way 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 one-way functions implies the existence of an ω(1)-round simultaneously resettable witness indistinguishable argument of knowledge. 1
Results 11 - 20
of
16,715
