95 search results - page 5 / 19 » Bounded CCA2-Secure Encryption |
ICST
2009
IEEE
13 years 4 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
CCS
2010
ACM
13 years 4 months ago
2010
ACM
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
TIT
2010
13 years 1 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
ECCC
2007
13 years 6 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
EUROCRYPT
2010
Springer
13 years 11 months ago
2010
Springer
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. In th...