Sciweavers

15 search results - page 1 / 3
» On the Round Security of Symmetric-Key Cryptographic Primiti...
Sort
View
CRYPTO
2000
Springer
89views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
On the Round Security of Symmetric-Key Cryptographic Primitives
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
Zulfikar Ramzan, Leonid Reyzin
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 5 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
STORAGESS
2005
ACM
13 years 10 months ago
Toward securing untrusted storage without public-key operations
Adding security capabilities to shared, remote and untrusted storage file systems leads to performance degradation that limits their use. Public-key cryptographic primitives, wid...
Dalit Naor, Amir Shenhav, Avishai Wool
ACNS
2006
Springer
241views Cryptology» more  ACNS 2006»
13 years 8 months ago
High Diffusion Cipher: Encryption and Error Correction in a Single Cryptographic Primitive
In this paper we combine the error correction and encryption functionality into one block cipher, which we call High Diffusion (HD) cipher. The error correcting property of this ci...
Chetan Nanjunda Mathur, Karthik Narayan, K. P. Sub...
PPDP
2005
Springer
13 years 10 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...