Sciweavers

135 search results - page 1 / 27
» Formal Indistinguishability Extended to the Random Oracle Mo...
Sort
View
ESORICS
2009
Springer
14 years 5 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
CCS
2010
ACM
13 years 5 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
CADE
2004
Springer
14 years 5 months ago
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model
Gilles Barthe, Jan Cederquist, Sabrina Tarento
ASIACRYPT
2006
Springer
13 years 8 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...