Sciweavers

87 search results - page 11 / 18
» Ciphers Secure against Related-Key Attacks
Sort
View
CCS
2007
ACM
15 years 5 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
ASIACRYPT
2006
Springer
15 years 3 months ago
Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yu...
FSE
2004
Springer
125views Cryptology» more  FSE 2004»
15 years 3 months ago
New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
Tetsu Iwata, Tadayoshi Kohno
IJNSEC
2007
82views more  IJNSEC 2007»
14 years 11 months ago
On Software Implementation of Fast DDP-based Ciphers
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
EUROCRYPT
2010
Springer
15 years 4 months ago
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
This paper presents a formal security analysis of SSH in counter mode in a security model that accurately captures the capabilities of real-world attackers, as well as security-rel...
Kenneth G. Paterson, Gaven J. Watson