Sciweavers

1834 search results - page 239 / 367
» Public Key Cryptography
Sort
View
FOCS
1999
IEEE
14 years 8 days ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
ESORICS
1994
Springer
14 years 1 days ago
A Calculus for Secure Channel Establishment in Open Networks
This paper presents a calculus of channel security properties which allows to analyze and compare protocols for establishing secure in an insecure open network at a high level of a...
Ueli M. Maurer, Pierre E. Schmid
ACNS
2006
Springer
241views Cryptology» more  ACNS 2006»
13 years 11 months ago
High Diffusion Cipher: Encryption and Error Correction in a Single Cryptographic Primitive
In this paper we combine the error correction and encryption functionality into one block cipher, which we call High Diffusion (HD) cipher. The error correcting property of this ci...
Chetan Nanjunda Mathur, Karthik Narayan, K. P. Sub...
FOCS
2004
IEEE
13 years 11 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
EUROCRYPT
2006
Springer
13 years 11 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret