Sciweavers

135 search results - page 3 / 27
» Adaptive Security of Symbolic Encryption
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
TCC
2004
Springer
131views Cryptology» more  TCC 2004»
14 years 24 days ago
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Recently Canetti, Krawczyk and Nielsen defined the notion of replayable adaptive chosen ciphertext attack (RCCA) secure encryption. Essentially a cryptosystem that is RCCA secure ...
Jens Groth
CRYPTO
2004
Springer
138views Cryptology» more  CRYPTO 2004»
14 years 25 days ago
Secure Identity Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
Dan Boneh, Xavier Boyen
ACNS
2006
Springer
96views Cryptology» more  ACNS 2006»
13 years 9 months ago
On Optimizing the Security-Throughput Trade-Off in Wireless Networks with Adversaries
In this paper, we model the adversary (eavesdropper) present in the wireless communication medium using probabilistic models. We precisely formulate the security-throughput optimiz...
Mohamed A. Haleem, Chetan Nanjunda Mathur, Rajarat...
EUROCRYPT
2010
Springer
14 years 7 days ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
Daniele Micciancio