FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
EIT
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
CSR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
ESORICS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...