Sciweavers

152 search results - page 5 / 31
» On the Key Dependent Message Security of the Fujisaki-Okamot...
Sort
View
ACISP
2009
Springer
15 years 5 months ago
Building Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
Kenneth G. Paterson, Sriramkrishnan Srinivasan
PE
2002
Springer
158views Optimization» more  PE 2002»
14 years 10 months ago
Comparison of inter-area rekeying algorithms for secure wireless group communications
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a membe...
Chun Zhang, Brian DeCleene, James F. Kurose, Donal...
CRYPTO
2000
Springer
89views Cryptology» more  CRYPTO 2000»
15 years 2 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
TCC
2005
Springer
166views Cryptology» more  TCC 2005»
15 years 3 months ago
Adaptively-Secure, Non-interactive Public-Key Encryption
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
Ran Canetti, Shai Halevi, Jonathan Katz
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
14 years 1 months ago
Online Ciphers from Tweakable Blockciphers
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
Phillip Rogaway, Haibin Zhang