555 search results - page 52 / 111 » From ABZ to Cryptography |
TCC
2010
Springer
14 years 6 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
ACNS
2005
Springer
14 years 3 months ago
2005
Springer
We have developed techniques to automatically infer mother's maiden names from public records. We demonstrate our techniques using publicly available records from the state o...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
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...
ASAP
2004
IEEE
14 years 1 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...