Result 1 to 20 from 69 total
On the security of hash functions employing blockcipher postprocessing. (English)
Joux, Antoine (ed.), Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21701-2/pbk). Lecture Notes in Computer Science 6733, 146-166 (2011).
1
The domination numbers of cylindrical grid graphs. (English)
Appl. Math. Comput. 217, No. 10, 4879-4889 (2011).
2
Indifferentiability of the hash algorithm BLAKE (English)
IACR Cryptology ePrint Archive 2011, 623 (2011).
3
The domination numbers of cylindrical grid graphs (English)
Applied Mathematics and Computation 217, No. 10, 4879-4889 (2011).
4
On the security of hash functions employing blockcipher postprocessing (English)
FSE, 146-166 (2011).
5
Stamp-it: a method for enhancing the universal verifiability of E2E voting systems. (English)
Jha, Somesh (ed.) et al., Information systems security. 6th international conference, ICISS 2010, Gandhinagar, India, December 17‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17713-2/pbk). Lecture Notes in Computer Science 6503, 81-95 (2010).
6
Speeding up the wide-pipe: secure and fast hashing. (English)
Gong, Guang (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2010. 11th international conference on cryptology in India, Hyderabad, India, December 12‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17400-1/pbk). Lecture Notes in Computer Science 6498, 144-162 (2010).
7
The characterization of Luby-Rackoff and its optimum single-key variants. (English)
Gong, Guang (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2010. 11th international conference on cryptology in India, Hyderabad, India, December 12‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17400-1/pbk). Lecture Notes in Computer Science 6498, 82-97 (2010).
8
A unified method for improving PRF bounds for a class of blockcipher based MACs. (English)
Hong, Seokhie (ed.) et al., Fast software encryption. 17th international workshop, FSE 2010, Seoul, Korea, February 7‒10, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-13857-7/pbk). Lecture Notes in Computer Science 6147, 212-229 (2010).
9
Security analysis of the mode of JH hash function. (English)
Hong, Seokhie (ed.) et al., Fast software encryption. 17th international workshop, FSE 2010, Seoul, Korea, February 7‒10, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-13857-7/pbk). Lecture Notes in Computer Science 6147, 168-191 (2010).
10
A unified method for improving PRF bounds for a class of blockcipher based macs (English)
IACR Cryptology ePrint Archive 2010, 14 (2010).
11
Speeding up the widepipe: secure and fast hashing (English)
IACR Cryptology ePrint Archive 2010, 193 (2010).
12
On the security of hash functions employing blockcipher postprocessing (English)
IACR Cryptology ePrint Archive 2010, 629 (2010).
13
Security analysis of the mode of JH hash function (English)
FSE, 168-191 (2010).
14
A unified method for improving PRF bounds for a class of blockcipher based macs (English)
FSE, 212-229 (2010).
15
Stamp-it: A method for enhancing the universal verifiability of E2E voting systems (English)
ICISS, 81-95 (2010).
16
The characterization of luby-rackoff and its optimum single-key variants (English)
INDOCRYPT, 82-97 (2010).
17
Speeding up the wide-pipe: secure and fast hashing (English)
INDOCRYPT, 144-162 (2010).
18
Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions. (English)
Roy, Bimal (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2009. 10th international conference on cryptology in India, New Delhi, India, December 13‒16, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10627-9/pbk). Lecture Notes in Computer Science 5922, 199-218 (2009).
19
Improved security analysis for OMAC as a pseudorandom function. (English)
J. Math. Cryptol. 3, No. 2, 133-148 (2009).
20
Result 1 to 20 from 69 total
Start
Contact
Print
General Help
