Sciweavers

61 search results - page 4 / 13
» A Machine-Checked Formalization of the Random Oracle Model
Sort
View
101
Voted
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
14 years 7 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud
83
Voted
ASIACRYPT
2006
Springer
15 years 1 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...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 1 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
CCS
2010
ACM
14 years 9 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,...
EUROCRYPT
2008
Springer
14 years 11 months ago
Towards Key-Dependent Message Security in the Standard Model
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security...
Dennis Hofheinz, Dominique Unruh