Sciweavers

1562 search results - page 34 / 313
» Mathematics, Cryptology, Security
Sort
View
ASIACRYPT
2000
Springer
15 years 2 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
1998
Springer
119views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractabili...
Ronald Cramer, Victor Shoup
EUROCRYPT
2007
Springer
15 years 1 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
EUROCRYPT
2006
Springer
15 years 1 months ago
Security Analysis of the Strong Diffie-Hellman Problem
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
Jung Hee Cheon
EUROCRYPT
2000
Springer
15 years 1 months ago
The Sum of PRPs Is a Secure PRF
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
Stefan Lucks