Sciweavers

2108 search results - page 309 / 422
» Encrypted
Sort
View
148
Voted
TIT
2010
130views Education» more  TIT 2010»
14 years 9 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
159
Voted
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 6 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
ISPEC
2011
Springer
14 years 5 months ago
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
The AES block cipher has a 128-bit block length and a user key of 128, 192 or 256 bits, released by NIST for data encryption in the USA; it became an ISO international standard in ...
Yongzhuang Wei, Jiqiang Lu, Yupu Hu
157
Voted
ASIACRYPT
2011
Springer
14 years 2 months ago
Leakage-Resilient Cryptography from the Inner-Product Extractor
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
Stefan Dziembowski, Sebastian Faust
IACR
2011
173views more  IACR 2011»
14 years 2 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz