Sciweavers

2967 search results - page 148 / 594
» Cryptology
Sort
View
ASIACRYPT
2000
Springer
15 years 11 months ago
Proofs of Security for the Unix Password Hashing Algorithm
We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost...
David Wagner, Ian Goldberg
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
The XTR Public Key System
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR ...
Arjen K. Lenstra, Eric R. Verheul
ASIACRYPT
1999
Springer
15 years 11 months ago
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered secu...
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheu...
EUROCRYPT
1999
Springer
15 years 11 months ago
Computationally Private Information Retrieval with Polylogarithmic Communication
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
Christian Cachin, Silvio Micali, Markus Stadler
IMA
1999
Springer
108views Cryptology» more  IMA 1999»
15 years 11 months ago
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
Roger Fischlin, Jean-Pierre Seifert